[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Local Random Quantum Circuits are Approximate Polynomial-Designs

  • Published:
Communications in Mathematical Physics Aims and scope Submit manuscript

Abstract

We prove that local random quantum circuits acting on n qubits composed of O(t 10 n 2) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whether random quantum circuits were a t-design for any t >  3. The proof is based on an interplay of techniques from quantum many-body theory, representation theory, and the theory of Markov chains. In particular we employ a result of Nachtergaele for lower bounding the spectral gap of frustration-free quantum local Hamiltonians; a quasi-orthogonality property of permutation matrices; a result of Oliveira which extends to the unitary group the path-coupling method for bounding the mixing time of random walks; and a result of Bourgain and Gamburd showing that dense subgroups of the special unitary group, composed of elements with algebraic entries, are ∞-copy tensor-product expanders. We also consider pseudo-randomness properties of local random quantum circuits of small depth and prove that circuits of depth O(t 10 n) constitute a quantum t-copy tensor-product expander. The proof also rests on techniques from quantum many-body theory, in particular on the detectability lemma of Aharonov, Arad, Landau, and Vazirani. We give applications of the results to cryptography, equilibration of closed quantum dynamics, and the generation of topological order. In particular we show the following pseudo-randomness property of generic quantum circuits: Almost every circuit U of size O(n k) on n qubits cannot be distinguished from a Haar uniform unitary by circuits of size O(n (k-9)/11) that are given oracle access to U.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Abeyesinghe A., Devetak I., Hayden P., Winter A.: The mother of all protocols: restructuring quantum information’s family tree. Proc. R. Soc. A 465(2108), 2537–2563 (2009) arXiv:quant-ph/0606225

    Article  ADS  MathSciNet  MATH  Google Scholar 

  2. Hayden P., Shor P.W., Leung D.W., Winter A.J.: Randomizing quantum states: constructions and applications. Commun. Math. Phys. 250, 371–391 (2004) arXiv:quant-ph/0307104

    Article  ADS  MathSciNet  MATH  Google Scholar 

  3. Sen, P.: Random measurement bases, quantum state distinction and applications to the hidden subgroup problem. In: IEEE Conference on Computational omplexity, pp. 274–287 (2006). arXiv:quant-ph/0512085

  4. Knill, E.: Approximation by quantum circuits (1995). arXiv:quant-ph/9508006

  5. Tóth G., García-Ripoll J.J.: Efficient algorithm for multiqudit twirling for ensemble quantum computation. Phys. Rev. A 75, 042311 (2007) arXiv:quant-ph/0609052

    Article  ADS  MathSciNet  Google Scholar 

  6. Dankert C., Cleve R., Emerson J., Livine E.: Exact and approximate unitary 2-designs and their application to fidelity estimation. Phys. Rev. A 80, 012304 (2009) arXiv:quant-ph/0606161

    Article  ADS  Google Scholar 

  7. Gross, D., Audenaert, K., Eisert, J.: Evenly distributed unitaries: on the structure of unitary designs. J. Math. Phys. 48, 052104 (2007). arXiv:quant-ph/0611002

  8. Emerson, J., Livine, E., Lloyd, S.: Convergence conditions for random quantum circuits. Phys. Rev. A 72, 060302 (2005). arXiv:quant-ph/0503210

  9. Oliveira, R., Dahlsten, O.C.O., Plenio, M.B.: Efficient generation of generic entanglement. Phys. Rev. Lett. 98, 130502 (2007). arXiv:quant-ph/0605126

  10. Dahlsten O.C.O., Oliveira R., Plenio M.B.: The emergence of typical entanglement in two-party random processes. J. Phys. A: Math. Theor. 40(28), 8081–8108 (2007) arXiv:quant-ph/0701125

    Article  ADS  MathSciNet  MATH  Google Scholar 

  11. Harrow A., Low R.: Random quantum circuits are approximate 2-designs. Commun. Math. Phys. 291, 257–302 (2009) arXiv:0802.1919

    Article  ADS  MathSciNet  MATH  Google Scholar 

  12. Diniz I., Jonathan D.: Comment on “Random Quantum Circuits are Approximate 2-designs”. Commun. Math. Phys. 304, 281–293 (2011) arXiv:1006.4202

    Article  ADS  MathSciNet  MATH  Google Scholar 

  13. Arnaud L., Braun D.: Efficiency of producing random unitary matrices with quantum circuits. Phys. Rev. A 78, 062329 (2008) arXiv:0807.0775

    Article  ADS  Google Scholar 

  14. Hayden P., Preskill J.: Black holes as mirrors: quantum information in random subsystems. JHEP 0709, 120 (2007) arXiv:0708.4025

    Article  ADS  MathSciNet  Google Scholar 

  15. Žnidarič M.: Exact convergence times for generation of random bipartite entanglement. Phys. Rev. A 78, 032324 (2008) arXiv:0809.0554

    Article  ADS  Google Scholar 

  16. Harrow, A.W., Low, R.A.: Efficient quantum tensor product expanders and k-designs. In: Proceedings of APPROX-RANDOM, volume 5687 of LNCS, pp. 548–561. Springer (2009). arXiv:0811.2597

  17. Roy A., Scott A.J.: Unitary designs and codes. Des. Codes Cryptogr. 53, 13–31 (2009) arXiv:0809.3813

    Article  MathSciNet  MATH  Google Scholar 

  18. Brown W.G., Viola L.: Convergence rates for arbitrary statistical moments of random quantum circuits. Phys. Rev. Lett. 104, 250501 (2010). arXiv:0910.0913

    Article  ADS  Google Scholar 

  19. Brandao F.G.S.L., Horodecki M.: Exponential quantum speed-ups are generic. Quantum Inf. Comput. 13, 0901–0924 (2013) arXiv:1010.3654

    MathSciNet  Google Scholar 

  20. Emerson J., Weinstein Y.S., Saraceno M., Lloyd S., Cory D.G.: Pseudo-random unitary operators for quantum information processing. Science 302(5653), 2098–2100 (2003)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  21. Hallgren, S., Harrow, A.W.: Superpolynomial speedups based on almost any quantum circuit. In: ICALP, volume 5125, pp. 782–795 (2008). arXiv:0805.0007

  22. Low R.A.: Large deviation bounds for k-designs. Proc. R. Soc. A: Math. Phys. Eng. Sci. 465(2111), 3289–3308 (2009) arXiv:0903.5236

    Article  ADS  MathSciNet  MATH  Google Scholar 

  23. Brodsky A., Hoory S.: Simple permutations mix even better. Random Struct. Algorithms 32, 274–289 (2008) arXiv:math/0411098

    Article  MathSciNet  MATH  Google Scholar 

  24. Kaplan E., Naor M., Reingold O.: Derandomized constructions of k-wise (almost) independent permutations. Algorithmica 55, 113–133 (2009) (ECCC TR06-002)

    Article  MathSciNet  MATH  Google Scholar 

  25. Hastings M.B., Harrow A.W.: Classical and quantum tensor product expanders. Quantum Inf. Comput. 9(3&4), 336–360 (2009) arXiv:0804.0011

    MathSciNet  MATH  Google Scholar 

  26. Low, R.A.: Pseudo-randomness and Learning in Quantum Computation. PhD thesis, University of Bristol (2010). arXiv:1006.5227

  27. Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and Quantum Computation, volume 47 of Graduate Studies in Mathematics. AMS (2002)

  28. Bourgain, J., Gamburd, A.: A spectral gap theorem in SU(d) (2011). arXiv:1108.6264

  29. Shende, V.V., Bullock, S.S., Markov, I.L.: Synthesis of quantum-logic circuits. IEEE Trans. Comput.- Aided Design Integr. Circuits Syst. 25(6), 1000–1010 (2006). arXiv:quant-ph/0406176

  30. Kassabov M.: Symmetric groups and expanders. Electron. Res. Announc. Am. Math. Soc. 11, 47–56 (2005) arXiv:math/0503204

    Article  MathSciNet  MATH  Google Scholar 

  31. Hoory S., Magen A., Myers S., Rackoff C.: Simple permutations mix well. Theor. Comput. Sci. 348(2), 251–261 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  32. Zatloukal, K.: Improved bounds for k-tensor product expanders (2012) (in preparation)

  33. Hayden P., Leung D.W., Winter A.: Aspects of generic entanglement. Commun. Math. Phys. 265(1), 95–117 (2006)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  34. Bremner M.J., Mora C., Winter A.: Are random pure states useful for quantum computation?. Phys. Rev. Lett. 102, 190502 (2009) arXiv:00812.3001

    Article  ADS  MathSciNet  Google Scholar 

  35. Gross D., Flammia S.T., Eisert J.: Most quantum states are too entangled to be useful as computational resources. Phys. Rev. Lett. 102, 190501 (2009) arXiv:0810.4331

    Article  ADS  MathSciNet  Google Scholar 

  36. Aaronson, S.: The ten most annoying questions in quantum computing (2006) http://www.scottaaronson.com/blog/?p=112

  37. Goldstein S., Lebowitz J.L., Tumulka R., Zanghi N.: Long-time behavior of macroscopic quantum systems: commentary accompanying the english translation of john von neumann’s 1929 article on the quantum ergodic theorem. Eur. Phys. J. 35, 173 (2010)

    Google Scholar 

  38. Linden N., Popescu S., Short A.J., Winter A.: Quantum mechanical evolution towards thermal equilibrium. Phys. Rev. E 79, 061103 (2009) arXiv:0812.2385

    Article  ADS  MathSciNet  Google Scholar 

  39. Cramer M., Eisert J.: A quantum central limit theorem for non-equilibrium systems: exact local relaxation of correlated states. New J. Phys. 12(5), 055020 (2010) arXiv:0911.2475

    Article  ADS  Google Scholar 

  40. Gogolin C., Müller M.P., Eisert J.: Absence of thermalization in nonintegrable systems. Phys. Rev. Lett. 106, 040401 (2011) arXiv:1009.2493

    Article  ADS  Google Scholar 

  41. Reimann P.: Foundation of statistical mechanics under experimentally realistic conditions. Phys. Rev. Lett. 101, 190403 (2008) arXiv:0810.3092

    Article  ADS  Google Scholar 

  42. Vinayak, Znidaric, M.: Subsystem dynamics under random Hamiltonian evolution. J. Phys. A: Math. Theor. 45, 125204 (2012).arXiv:1107.6035. doi:10.1088/1751-8113/45/12/125204

  43. Masanes L., Roncaglia A.J., Acin A.: The complexity of energy eigenstates as a mechanism for equilibration. Phys. Rev. E 87, 032137 (2013) arXiv:1108.0374

    Article  ADS  Google Scholar 

  44. Brandão F.G.S.L., Ćwikliński P., Horodecki M., Horodecki P., Korbicz J., Mozrzymas M.: Convergence to equilibrium under a random hamiltonian. Phys. Rev. E 86, 031101 (2012) arXiv:1108.2985

    Article  ADS  Google Scholar 

  45. Cramer M.: Thermalization under randomized local hamiltonians. New J. Phys. 14(5), 053051 (2012) arXiv:1112.5295

    Article  ADS  Google Scholar 

  46. von Neumann J.: Beweis des ergodensatzes und des h-theorems in der neuen mechanik. Zeitschrift für Physik 57(1–2), 30–70 (1929)

    Article  ADS  MATH  Google Scholar 

  47. Goldstein S., Lebowitz J.L., Tumulka R, Zanghì N: Canonical typicality. Phys. Rev. Lett. 96, 050403 (2006)

    Article  ADS  MathSciNet  Google Scholar 

  48. Trotzky S., Chen Y.-A., Flesch A., McCulloch I.P., Schollwöck U., Eisert J., Bloch I.: Probing the relaxation towards equilibrium in an isolated strongly correlated one-dimensional bose gas. Nat. Phys. 8(4), 325–330 (2012)

    Article  Google Scholar 

  49. Bañuls M.C., Cirac J.I., Hastings M.B.: Strong and weak thermalization of infinite nonintegrable quantum systems. Phys. Rev. Lett. 106, 050405 (2011)

    Article  ADS  Google Scholar 

  50. Susskind L.: Computational complexity and black hole horizons. Fortschr. Phys. 64(1), 24–43 (2016) arXiv:1402.5674

    Article  MathSciNet  MATH  Google Scholar 

  51. Wen X.-G.: Topological orders in rigid states. Int. J. Mod. Phys. 239, 050401 (1990)

    MathSciNet  Google Scholar 

  52. Kitaev A.Y.: Fault-tolerant quantum computation by anyons. Ann. Phys. 303, 1 (2003) arXiv:quant-ph/9707021

    Article  ADS  MathSciNet  MATH  Google Scholar 

  53. Nayak C., Simon S.H., Stern A., Freedman M., Sarma S.D.: Non-Abelian anyons and topological quantum computation. Rev. Mod. Phys. 80, 1083 (2008) arXiv:0707.1889

    Article  ADS  MathSciNet  MATH  Google Scholar 

  54. Bravyi S., Hastings M.B., Verstraete F.: Lieb–Robinson bounds and the generation of correlations and topological quantum order. Phys. Rev. Lett. 97, 050401 (2006) arXiv:quant-ph/0603121

    Article  ADS  Google Scholar 

  55. Chen X., Gu Z.-G., Wen X.-G.: Local unitary transformation, long-range quantum entanglement, wave function renormalization, and topological order. Phys. Rev. B 82, 1083 (2010) arXiv:1004.3835

    Google Scholar 

  56. Hastings M.B.: Topological order at non-zero temperature. Phys. Rev. Lett. 107, 210501 (2011) arXiv:1106.6026

    Article  ADS  Google Scholar 

  57. Sekino Y., Susskind L.: Fast scramblers. J. High Energy Phys. 10, 065 (2008) arXiv:0808.2096

    Article  ADS  Google Scholar 

  58. Lashkari, N., Stanford, D., Hastings,M., Osborne, T., Hayden, P.: Towards the fast scrambling conjecture J. High Energy Phys. 2013, 22 (2013)

  59. Nachtergaele B.: The spectral gap for some spin chains with discrete symmetry breaking. Commun. Math. Phys. 175, 565–606 (1996) arXiv:cond-mat/9410110

    Article  ADS  MathSciNet  MATH  Google Scholar 

  60. Fannes M., Nachtergaele B., Werner R.: Finitely correlated states on quantum spin chains. Commun. Math. Phys. 144, 443–490 (1992)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  61. Perez-Garcia D., Verstraete F., Wolf M.M., Cirac J.I.: Matrix product state representations. Quantum Inf. Comput. 7(5&6), 401–430 (2007) arXiv:quant-ph/0608197

    MathSciNet  MATH  Google Scholar 

  62. Bubley, R., Dyer, M.E.: Path coupling: a technique for proving rapid mixing in Markov chains. In: Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 223–231 (1997)

  63. Oliveira R.I.: On the convergence to equilibrium of Kac’s random walk on matrices. Ann. Appl. Probab. 19(3), 1200–1231 (2009) arXiv:0705.2253

    Article  MathSciNet  MATH  Google Scholar 

  64. Aharonov D., Arad I., Vazirani U., Landau Z.: The detectability lemma and its applications to quantum Hamiltonian complexity. New J. Phys. 13(11), 113043 (2011) arXiv:1011.3445

    Article  ADS  Google Scholar 

  65. Damgard, I.B., Fehr, S., Salvail, L., Schaffner, C.: Cryptography in the bounded quantum-storage model. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS ’05, pp. 449–458, Washington, DC, USA, 2005. IEEE Computer Society. arXiv:quant-ph/0508222.

  66. Barenco A., Bennett C.H., Cleve R., DiVincenzo D.P., Margolus N., Shor P., Sleator T., Smolin J.A., Weinfurter H.: Elementary gates for quantum computation. Phys. Rev. A 52, 3457–3467 (1995) arXiv:quant-ph/9503016

    Article  ADS  Google Scholar 

  67. Goodman, R., Wallach, N.R.: Representations and Invariants of the Classical Groups. Cambridge University Press, Cambridge (1998). http://www.math.rutgers.edu/~goodman/cuprepbook.html

  68. Christandl, M.: The structure of bipartite quantum states: insights from group theory and cryptography. PhD thesis, University of Cambridge (2006). arXiv:quant-ph/0604183

  69. Arnold, V.I., Krylov, A.L.: Uniform distribution of points on a sphere and some ergodic properties of solutions of linear ordinary differential equations in a complex domain. Sov. Math. Dokl. 148, 9–12 (1963)

  70. Szarek T.: Feller processes on nonlocally compact spaces. Ann. Probab. 34(5), 1849–1863 (2006) arXiv:math/0512221

    Article  MathSciNet  MATH  Google Scholar 

  71. Szarek, T.: (2011) (private communication)

  72. Harrow, A.W.: The church of the symmetric subspace (2013). arXiv:1308.6595

  73. Bhatia, R.: Matrix Analysis, volume 169. Springer Science & Business Media, Berlin (1997)

  74. Ambainis A., Bouda J., Winter A.: Nonmalleable encryption of quantum information. J. Math. Phys. 50(4), 042106 (2009) arXiv:0808.0353

    Article  ADS  MathSciNet  MATH  Google Scholar 

  75. Aharonov, D., Kitaev, A., Nisan, N.: Quantum circuits with mixed states. In: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pp. 20–30. ACM (1998). arXiv:quant-ph/9806029

  76. Milman, V.D., Schechtman, G.: Asymptotic theory of finite dimensional normed spaces. Lecture notes in mathematics. Springer, Berlin (1986)

  77. Bernstein, E., Vazirani, U.: Quantum complexity theory. In: Proceedings of the 25th Annual ACM Symposium on the Theory of Computation (STOC), pp. 11–20. ACM Press, El Paso, Texas (1993)

  78. Ledoux, M.: The Concentration of Measure Phenomenon. AMS Monographs, Providence (2001)

  79. Kastoryano M.J., Temme K.: Quantum logarithmic Sobolev inequalities and rapid mixing. J. Math. Phys. 54, 052202 (2013) arXiv:1207.3261

    Article  ADS  MathSciNet  MATH  Google Scholar 

  80. Stolz, G.: An introduction to the mathematics of anderson localization. Contemp. Math. 552 (2011). arXiv:1104.2317

  81. Harrow, A.W.: Applications of coherent classical communication and Schur duality to quantum information theory. PhD thesis, M.I.T., Cambridge, MA (2005). arXiv:quant-ph/0512255

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University College London, London, UK

    Fernando G. S. L. Brandão

  2. Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, MA, USA

    Aram W. Harrow

  3. Institute of Theoretical Physics and Astrophysics, National Quantum Information Centre, Faculty of Mathematics, Physics and Informatics, University of Gdańsk, Wita Stwosza 57, 80-952, Gdańsk, Poland

    Michał Horodecki

Authors
  1. Fernando G. S. L. Brandão
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aram W. Harrow
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michał Horodecki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fernando G. S. L. Brandão.

Additional information

Communicated by M. M. Wolf

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Brandão, F.G.S.L., Harrow, A.W. & Horodecki, M. Local Random Quantum Circuits are Approximate Polynomial-Designs. Commun. Math. Phys. 346, 397–434 (2016). https://doi.org/10.1007/s00220-016-2706-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00220-016-2706-8

Search

Navigation