# Quantum Circuit Complexity

@inproceedings{Yao1993QuantumCC,
title={Quantum Circuit Complexity},
author={Andrew Chi-Chih Yao},
booktitle={FOCS},
year={1993}
}
• A. Yao
• Published in FOCS 3 November 1993
• Mathematics, Computer Science
We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomial-size quantum circuit. This result also enables us to construct a universal quantum computer which can simulate, with a polynomial factor slowdown, a broader class of quantum machines than that considered by E. Bernstein and U. Vazirani (1993), thus answering an open question raised by… Expand
705 Citations
Quantum computers that can be simulated classically in polynomial time
It is shown that two-bit operations characterized by 4 \times 4 matrices in which the sixteen entries obey a set of five polynomial relations can be composed according to certain rules to yield a class of circuits that can be simulated classically in polynometric time. Expand
On the Complexity of Quantum Languages
• Physics, Mathematics
• 2005
The standard inputs given to a quantum machine are classical binary strings. In this view, any quantum complexity class is a collection of subsets of {0, 1} � . However, a quantum machine can alsoExpand
Quantum complexity theory
• Computer Science
• STOC '93
• 1993
This dissertation proves that relative to an oracle chosen uniformly at random, the class NP cannot be solved on a quantum Turing machine in time $o(2\sp{n/2}).$ and gives evidence suggesting that quantum Turing Machines cannot efficiently solve all of NP. Expand
Quantum Complexity Theory
• Computer Science
• SIAM J. Comput.
• 1997
This paper gives the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis, and proves that bits of precision suffice to support a step computation. Expand
Quantum Turing Machines Computations and Measurements
• Computer Science
• ArXiv
• 2017
A new formulation of Quantum Turing Ma- chines is proposed, as an extension of those proposed by Bernstein and Vazirani, to define a class of quantum computable functions - any such a function is a mapping from a general quantum state to a distribution of probability of natural numbers. Expand
Quantum computing and quantum complexity theory
• U. Vazirani
• Computer Science
• 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353)
• 2000
This paper will describe two formal models for quantum computers: quantum circuits and quantum Turing Machines, introduced by Deutsch [1985]. Expand
A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
• T. Yamakami
• Computer Science, Mathematics
• The Journal of Symbolic Logic
• 2020
A new, schematic definition of quantum functions mapping finite-dimensional Hilbert spaces to themselves, which avoids the cumbersome introduction of the well-formedness condition imposed on a quantum Turing machine model as well as of the uniformity condition necessary for a quantum circuit model. Expand
An Introduction to Quantum Complexity Theory
In 1985, D. Deutsch introduced quantum Turing machines (QTMs for short) as Turing machines which can perform so called quantum parallel computations. Then, in 1994, P. Shor showed that QTM can factorExpand
Quantum branching programs and space-bounded nonuniform quantum complexity
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2005
It is shown that non-uniform quantum Turing machines with algebraic amplitudes and QBPs with a suitable analogous set of amplitudes are equivalent in computational power if both models work with bounded or unbounded error. Expand
On the Power of Quantum Computation
This work presents a problem of distinguishing between two fairly natural classes of functions, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an oracle drawn equiprobably from the uniform distribution on either class. Expand

#### References

SHOWING 1-10 OF 19 REFERENCES
Quantum complexity theory
• Computer Science
• STOC '93
• 1993
This dissertation proves that relative to an oracle chosen uniformly at random, the class NP cannot be solved on a quantum Turing machine in time $o(2\sp{n/2}).$ and gives evidence suggesting that quantum Turing Machines cannot efficiently solve all of NP. Expand
The quantum challenge to structural complexity theory
• Computer Science
• [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference
• 1992
There are cryptographic tasks that are demonstrably impossible to implement with unlimited computing power probabilistic interactive turning machines, yet they can be implemented even in practice by quantum mechanical apparatus. Expand
Quantum theory, the Church–Turing principle and the universal quantum computer
• D. Deutsch
• Mathematics
• Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
• 1985
It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every finitely realizibleExpand
Characterizing classes of functions computable by quantum parallelism
• R. Jozsa
• Mathematics
• Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
• 1991
Computation by quantum parallelism involves associating a quantum state v(f) to each function f: Zm → Zn. v(f) is formed from superpositions of states labelled by the values of f, the standard choiceExpand
Quantum computational networks
• D. Deutsch
• Mathematics
• Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
• 1989
The theory of quantum computational networks is the quantum generalization of the theory of logic circuits used in classical computing machines. Quantum gates are the generalization of classicalExpand
Monotone Circuits for Connectivity Require Super-Logarithmic Depth
• Mathematics, Computer Science
• SIAM J. Discret. Math.
• 1990
It is proved here that every monotone circuit which tests $st$-connectivity of an undirected graph on n nodes has depth $\Omega (\log^2 \,n)$. This implies a superpolynomial $(n^{\Omega (\log n)} )$Expand
Logical reversibility of computation
This result makes plausible the existence of thermodynamically reversible computers which could perform useful computations at useful speed while dissipating considerably less than kT of energy per logical step. Expand
Relations Among Complexity Measures
• Computer Science
• JACM
• 1979
It is shown that n steps of the computation of an arbitrary machine with one- dimensional tapes can be performed by a combinational logic network of cost O( n log n) and delay O(n) and the results are the best possible, at least insofar as on-hne simulation is concerned. Expand
Some complexity questions related to distributive computing(Preliminary Report)
• A. Yao
• Computer Science, Mathematics
• STOC
• 1979
The quantity of interest, which measures the information exchange necessary for computing f, is the minimum number of bits exchanged in any algorithm. Expand
Computational Work and Time on Finite Machines
In this paper, measures of the computational work and computational delay required by ms chines to compute functions are given and many e~ change inequalities involving storage, time, and other important parameters of computation are developed. Expand