Quantum Circuits That Can Be Simulated Classically in Polynomial Time
By Leslie G. Valiant. SIAM journal on computing (Print), 2002
310 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/b054eded4231b8d14378702c1862352512701855
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Patrick J. Coles
- M. Cerezo
- Lukasz Cincio
- Suguru Endo
- Andrew Arrasmith
- Jarrod R. McClean
- Simon C. Benjamin
- Xiao Yuan
In Computational Theory and Mathematics
- Patrick J. Coles
- Lukasz Cincio
- Suguru Endo
- Alexei Y. Arkhipov
- Richard Jozsa
- Scott Aaronson
- Xiao Yuan
- Keisuke Fujii
Citations in the corpus
- Qulacs: a fast and versatile quantum circuit simulator for research purpose (2020, methodology): “When quantum circuits are constructed only with efficiently simulatable quantum gates such as Clifford gates [78, 79] or matchgates [80–82], these circuits are efficiently simulated via specialized algorithms.”
- The computational complexity of linear optics (2010, background): “This is why the basis states in our model are lists of nonnegative integers, whereas the basis states in Valiant s model are binary strings. some formal connection between quantum computing and the class”
- Variational quantum algorithms (2020, background): “For instance, in quantum chemistry one can exploit the classical simulability of free fermion dynamics to apply quantum operations via classical post-processing [38–43].”
- Matchgates and classical simulation of quantum circuits (2008, methodology): “1 is very similar to the classical simulation result of Terhal & DiVincenzo (2002) and Valiant (2002). Our result is more general in the feature of allowing arbitrary product state inputs (rather than just computational basis states). It is more restrictive in considering only single-bit outputs (ra”
- Improved Simulation of Stabilizer Circuits (2004, unknown): “ in a follow-up paper [37], Vidal actually implemented his algorithm and used it to simulate 1-dimensional quantum spin chains consisting of hundreds of spins. A second example is a result of Valiant [33], which reduces the problem of simulating a restricted class of quantum computers to that of com”