Quantum circuit complexity

@article{ChiChihYao1993QuantumCC,
  title={Quantum circuit complexity},
  author={A. Chi-Chih Yao},
  journal={Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science},
  year={1993},
  pages={352-361}
}
  • A. Chi-Chih Yao
  • Published 1993
  • Computer Science
  • Proceedings of 1993 IEEE 34th Annual Foundations of 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… 

Figures from this paper

Reuse Method for Quantum Circuit Synthesis

TLDR
This paper presents an attempt to extend the algebraic decomposition of a unitary operator to a general framework of circuit synthesis to find suitable groups for the implementation of new quantum circuits.

Creation and manipulation of quantum states in nanostructures

Nanostructures are promising building blocks for quantum technologies due to their reproducible nature and ability to self-assemble into complex structures. However, the need to control these

Topological quantum scheme based on quantum walk

Topological quantum computation provides efficiency with fault-tolerant and error-correction to overcome decoherence problem. Here we investigate a class of topological quantum computation device. We