article

Small depth quantum circuits

Authors:

Debajyoti Bera,

Frederic Green, and

Steven HomerAuthors Info & Claims

ACM SIGACT News, Volume 38, Issue 2

Pages 35 - 50

https://doi.org/10.1145/1272729.1272739

Published: 01 June 2007 Publication History

Get Access

Abstract

Small depth quantum circuits have proved to be unexpectedly powerful in comparison to their classical counterparts. We survey some of the recent work on this and present some open problems.

References

[1]

L. Adleman, J. DeMarrais, and M. Huang. "Quantum computability". SIAM Journal on Computing, 26:1524--1540, 1997.

Digital Library

Google Scholar

[2]

A. Barenco, C. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weifurter. "Elementary gates for quantum computation". Phys. Rev. A, 52:3457--3467, 1995.

Crossref

Google Scholar

[3]

J. I. Cirac and P. Zoller. "Quantum computers with cold trapped ions". Phys. Rev. Lett., 74:4091--4094, 1995.

Crossref

Google Scholar

[4]

R. Cleve and J. Watrous. "Fast parallel circuits for the quantum Fourier transform". Proc. of 41st IEEE FOCS, pages 526--536, 2000.

Digital Library

Google Scholar

[5]

V. Coffman, J. Kundu, and W. K. Wootters. "Distributed Entanglement". Phys. Rev. A, 61, 052306, 2000.

Crossref

Google Scholar

[6]

D. Coppersmith. "An approximate Fourier transform useful in quantum factoring". IBM technical report RC19642, quant-ph/0201067, 1994.

Google Scholar

[7]

S. Fenner. "A physics-free introduction to the quantum computation model", Computational Complexity Column. Bulletin of EATCS, 79:69--85, 2003.

Google Scholar

[8]

M. Fang, S. Fenner, F. Green, S. Homer, and Y. Zhang. "Quantum lower bounds for fanout". Quantum Information and Computation, 6(1):046--057, 2006.

Digital Library

Google Scholar

[9]

S. Fenner, F. Green, S. Homer, and R. Pruim. "Quantum NP is hard for PH". Proceedings of 6th Italian Conference on theoretical Computer Science, World Scientific, Singapore, pages 241--252, 1998.

Google Scholar

[10]

L. Fortnow and J. Rogers. "Complexity Limitations on Quantum Computation". Proceedings of 13th IEEE Conference on Computational Complexity, pages 202--209, 1998.

Digital Library

Google Scholar

[11]

M. Furst, J. B. Saxe, and M. Sipser. "Parity, circuits, and the polynomial-time hierarchy". Math. Syst. Theory, 17:13--27, 1984.

Crossref

Google Scholar

[12]

N. Gershenfeld and I. Chuang. "Bulk spin resonance quantum computation". Science, 275:350--356, 1997.

Crossref

Google Scholar

[13]

F. Green, S. Homer, C. Moore and C. Pollett. "Counting, Fanout, and the Complexity of Quantum ACC". Quantum Information and Computation, 2(1):35--65, 2002.

Digital Library

Google Scholar

[14]

P. Høyer and R. Špalek. "Quantum fan-out is powerful". Theory of Computing, 1:81--103, 2005.

Crossref

Google Scholar

[15]

Cristopher Moore. "Quantum Circuits: Fanout, Parity, and Counting". In Los Alamos Preprint archives quant-ph/9903046, 1999.

Google Scholar

[16]

Cristopher Moore and Martin Nilsson. "Parallel Quantum Computation and Quantum Codes". In Los Alamos Preprint archives quant-ph/9808027, 1998.

Google Scholar

[17]

M. A. Nielsen and I. L. Chuang. "Quantum computation and quantum information". Cambridge University Press, 2000.

Digital Library

Google Scholar

[18]

N. Nisan. "CREW PRAMs and decision trees". SIAM J. Computing, 20:999--1007, 1991.

Digital Library

Google Scholar

[19]

H. Nishimura and M. Ozawa. "Computational complexity of uniform quantum circuit families and quantum Turing machines". Theoretical Computer Science, 1--2(276):147--181, 2002.

Digital Library

Google Scholar

[20]

S. Parker and M. B. Plenio. "Efficient factorization with a single pure qubit and logN Mixed qubits". Physics Review Letters, 85(14):3049--3052, Oct 2000.

Crossref

Google Scholar

[21]

A. A. Razborov. "Lower bounds for the size of circuits of bounded depth with basis {&, &oplus;&oplus;}". Math. Notes Acad. Sci. USSR, 41(4):333--338, 1987.

Crossref

Google Scholar

[22]

P. W. Shor. "Polynomial-time algorithms for prime number factorization and discrete logarithms on a quantum computer". SIAM J. Comp., 26:1484--1509, 1997.

Digital Library

Google Scholar

[23]

K.-Y. Siu, J. Bruck, T. Kailath and T. Hofmeister "Depth efficient neural networks for division and related problems". IEEE Transactions on Information Theory, 39(3):946--956, 1993.

Digital Library

Google Scholar

[24]

R. Smolensky. "Algebraic methods in the theory of lower bounds for Boolean circuit complexity". Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 77--82, 1987.

Digital Library

Google Scholar

[25]

R. Špalek. "Quantum Circuits with Unbounded Fan-out". Master's Thesis, Faculty of Sciences, Vrije Universiteit, Amsterdam, 2002.

Google Scholar

[26]

H. Vollmer. "Introduction to Circuit Complexity". Springer-Verlag, 1999.

Digital Library

Google Scholar

[27]

A. C.-C. Yao. "Quantum circuit complexity". In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, pages 352--361, 1993.

Google Scholar

Cited By

View all

Zhang ZWang QYing M(2024)Parallel Quantum Algorithm for Hamiltonian SimulationQuantum10.22331/q-2024-01-15-12288(1228)Online publication date: 15-Jan-2024
https://doi.org/10.22331/q-2024-01-15-1228
Nadimpalli SParham NVasconcelos FYuen HMohar BShinkar IO'Donnell R(2024)On the Pauli Spectrum of QAC0Proceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649662(1498-1506)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649662
Biswal LRahaman HMaity N(2021)Clifford+T-based implementation of fault-tolerant quantum circuits over XOR-Majority GraphMicroelectronics Journal10.1016/j.mejo.2021.105212(105212)Online publication date: Aug-2021
https://doi.org/10.1016/j.mejo.2021.105212
Show More Cited By

Index Terms

Small depth quantum circuits
1. Hardware
  1. Integrated circuits
    1. Logic circuits
2. Theory of computation
  1. Logic

Recommendations

Commuting quantum circuits: efficient classical simulations versus hardness results

The study of quantum circuits composed of commuting gates is particularly useful to understand the delicate boundary between quantum and classical computation. Indeed, while being a restricted class, commuting circuits exhibit genuine quantum effects ...
Read More
Quantum circuits and spin(3n) groups

All quantum gates with one and two qubits may be described by elements of Spin groups due to isomorphisms Spin(3) ≃ SU(2) and Spin(6) ≃ SU(4). However, the group of n-qubit gates SU(2ⁿ) for n > 2 has bigger dimension than Spin(3n). A quantum circuit ...
Read More
Quantum circuits for qubit fusion

We consider four-dimensional qudits as qubit pairs and their qudit Pauli operators as qubit Clifford operators. This introduces a nesting, C₁² ⊂ C₂⁴ ⊂ C₃², where C_n^m is the nth level of the m-dimensional qudit Clifford hierarchy. If we can convert ...
Read More

Comments

Information & Contributors

Information

Published In

ACM SIGACT News Volume 38, Issue 2

June 2007

79 pages

ISSN:0163-5700

DOI:10.1145/1272729

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 2007

Published in SIGACT Volume 38, Issue 2

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
381
Total Downloads

Downloads (Last 12 months)13
Downloads (Last 6 weeks)3

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhang ZWang QYing M(2024)Parallel Quantum Algorithm for Hamiltonian SimulationQuantum10.22331/q-2024-01-15-12288(1228)Online publication date: 15-Jan-2024
https://doi.org/10.22331/q-2024-01-15-1228
Nadimpalli SParham NVasconcelos FYuen HMohar BShinkar IO'Donnell R(2024)On the Pauli Spectrum of QAC0Proceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649662(1498-1506)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649662
Biswal LRahaman HMaity N(2021)Clifford+T-based implementation of fault-tolerant quantum circuits over XOR-Majority GraphMicroelectronics Journal10.1016/j.mejo.2021.105212(105212)Online publication date: Aug-2021
https://doi.org/10.1016/j.mejo.2021.105212
Takahashi YTani S(2020)Power of uninitialized qubits in shallow quantum circuitsTheoretical Computer Science10.1016/j.tcs.2020.11.039Online publication date: Nov-2020
https://doi.org/10.1016/j.tcs.2020.11.039
Watts AKothari RSchaeffer LTal ACharikar MCohen E(2019)Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuitsProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing10.1145/3313276.3316404(515-526)Online publication date: 23-Jun-2019
https://dl.acm.org/doi/10.1145/3313276.3316404
Bera D(2018)Amplitude Amplification for Operator Identification and Randomized ClassesComputing and Combinatorics10.1007/978-3-319-94776-1_48(579-591)Online publication date: 2-Jul-2018
https://dl.acm.org/doi/10.1007/978-3-319-94776-1_48
Watrous J(2014)Quantum Computational ComplexityEncyclopedia of Complexity and Systems Science10.1007/978-3-642-27737-5_428-3(1-40)Online publication date: 6-May-2014
https://doi.org/10.1007/978-3-642-27737-5_428-3
Watrous J(2012)Quantum Computational ComplexityComputational Complexity10.1007/978-1-4614-1800-9_147(2361-2387)Online publication date: 2012
https://doi.org/10.1007/978-1-4614-1800-9_147
Bera D(2011)A lower bound method for quantum circuitsInformation Processing Letters10.1016/j.ipl.2011.05.002111:15(723-726)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.1016/j.ipl.2011.05.002
Bera DFenner SGreen FHomer S(2010)Efficient universal quantum circuitsQuantum Information & Computation10.5555/2011438.201144010:1(16-28)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/2011438.2011440
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Commuting quantum circuits: efficient classical simulations versus hardness results

Quantum circuits and spin(3n) groups

Quantum circuits for qubit fusion

Comments

Published In

Publisher

Publication History

Check for updates

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Commuting quantum circuits: efficient classical simulations versus hardness results

Quantum circuits and spin(3n) groups

Quantum circuits for qubit fusion

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations