Fetching the paper…
Reading the bibliography…
The framework of postselection is becoming more and more important in various recent directions in Quantum Computation research.
Positive functions on C ∗ \text{C}^{*} -algebras
W Forrest Stinespring · 1955
Earlier work this paper cites.
Quantum computations: algorithms and error correction
A Yu Kitaev · 1997
Earlier work this paper cites.
Quantum circuits with mixed states
Dorit Aharonov, Alexei Kitaev, and Noam Nisan · 1998
Earlier work this paper cites.
A scheme for efficient quantum computation with linear optics
Emanuel Knill, Raymond Laflamme, and Gerald J Milburn · 2001
Earlier work this paper cites.
Quantum computing with realistically noisy devices
Emanuel Knill · 2005
Earlier work this paper cites.
Quantum computing, postselection, and probabilistic polynomial-time
Scott Aaronson · 2005
Earlier work this paper cites.
Notes on super-operator norms induced by schatten norms
John Watrous · 2005
Cited alongside, same era.
Error-detection-based quantum fault tolerance against discrete pauli noise
Ben W Reichardt · 2006
Cited alongside, same era.
Accuracy threshold for postselected quantum computation
Panos Aliferis, Daniel Gottesman, and John Preskill · 2008
Cited alongside, same era.
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Michael J Bremner, Richard Jozsa, and Dan J Shepherd · 2011
Cited alongside, same era.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2011
Cited alongside, same era.
Hardness of classically simulating the one-clean-qubit model
Tomoyuki Morimae, Keisuke Fujii, and Joseph F Fitzsimons · 2014
Cited alongside, same era.
Quantum union bounds for sequential projective measurements
Jingliang Gao · 2015
Later among the works it cites.
Achieving quantum supremacy with sparse and noisy commuting quantum computations
Michael J Bremner, Ashley Montanaro, and Dan J Shepherd · 2017
Later among the works it cites.
The theory of quantum information
John Watrous · 2018
Later among the works it cites.
On the complexity and verification of quantum random circuit sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani · 2019
Later among the works it cites.
Online learning of quantum states
Scott Aaronson, Xinyi Chen, Elad Hazan, Satyen Kale, and Ashwin Nayak · 2019
Later among the works it cites.
Lower bounds on the non-clifford resources for quantum computations
Michael E Beverland, Earl Campbell, Mark Howard, and Vadym Kliuchnikov · 2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…