Linear growth of quantum circuit complexity

  title={Linear growth of quantum circuit complexity},
  author={Jonas Haferkamp and Philippe Faist and Naga B. T. Kothakonda and Jens Eisert and Nicole Yunger Halpern},
  journal={Nature Physics},
The complexity of quantum states has become a key quantity of interest across various subfields of physics, from quantum computing to the theory of black holes. The evolution of generic quantum systems can be modelled by considering a collection of qubits subjected to sequences of random unitary gates. Here we investigate how the complexity of these random quantum circuits increases by considering how to construct a unitary operation from Haar-random two-qubit quantum gates. Implementing the… 
Saturation and recurrence of quantum complexity in random quantum circuits
Quantum complexity is a measure of the minimal number of elementary operations required to approximately prepare a given state or unitary channel. Recently, this concept has found applica-tions
Short Proofs of Linear Growth of Quantum Circuit Complexity
Two short proofs of the fact that the complexity of quantum gates built from random quantum circuits almost surely grows linearly with the number of building blocks are provided.
Quantum computational complexity from quantum information to black holes and back
Quantum computational complexity estimates the difficulty of constructing quantum states from elementary operations, a problem of prime importance for quantum computation. Surprisingly, this quantity
A new measure of quantum state complexity
We propose a measure of quantum state complexity defined by minimizing the spread of the wavefunction over all choices of basis. Our measure is controlled by the “survival amplitude” for a state to
Quantum chaos and the complexity of spread of states
A measure of quantum state complexity is proposed by minimizing the spread of the wavefunction over all choices of basis by controlling the “survival amplitude” for a state to remain unchanged, and can be computed in theories with discrete spectra.
Quantum Complexity as Hydrodynamics
As a new step towards defining complexity for quantum field theories, we consider Nielsen’s geometric approach to operator complexity for the SU(N) group. We develop a tractable large N limit which
Topologically-driven impossibility of superposing unknown states
Surprisingly, it is proved that quantum circuits of any sample complexity cannot output a superposition for all input state-pairs – not even when postselection and approximations are allowed.
Quantum Complexity: Theory and Application
This report documents the program and outcomes of Dagstuhl Seminar 21261 “Quantum Complexity: Theory and Application”. The seminar ran from June 27 to July 2 , 2021, and was held in a hybrid format
Fast decay of classification error in variational quantum circuits
This work proposes a VQC system with the optimal classical post-processing---maximum-likelihood estimation on measuring all V QC output qubits, finding that utilizing the symmetry of the input properly can improve the performance, while oversimplification can lead to degradation.
Tight bounds on the convergence of noisy random circuits to uniform
It is shown that in certain depth regimes, noise-agnostic proof techniques might still work in order to prove an often-conjectured claim in the literature on quantum computational advantage, contrary to what was thought prior to this work.


Models of Quantum Complexity Growth
The concept of quantum complexity has far-reaching implications spanning theoretical computer science, quantum many-body physics, and high energy physics. The quantum complexity of a unitary
Entangling Power and Quantum Circuit Complexity.
  • J. Eisert
  • Physics, Computer Science
    Physical review letters
  • 2021
This work discusses a simple relationship when both the entanglement of a state and the cost of a unitary take small values, building on ideas on how values of entangling power of quantum gates add up, and proposes a continuous-variable small incremental entangling bound.
Second law of quantum complexity
We give arguments for the existence of a thermodynamics of quantum complexity that includes a “second law of complexity.” To guide us, we derive a correspondence between the computational (circuit)
Local Random Quantum Circuits are Approximate Polynomial-Designs
We prove that local random quantum circuits acting on n qubits composed of O(t10n2) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whether
A geometric approach to quantum circuit lower bounds
Several Finsler metrics whose minimal length geodesics provide lower bounds on quantum circuitsize are constructed and a large class of solutions to the geodesic equation, which are called Pauli geodesICS, since they arise from isometries generated by the Pauli group.
Approximation by Quantum Circuits
The overall conclusion is that almost all problems are hard to solve with quantum circuits, including decision problem and guess checkable functions.
The Heisenberg Representation of Quantum Computers
Since Shor`s discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features
Efficient Quantum Pseudorandomness.
This work shows that random quantum unitary time evolutions ("circuits") are a powerful source of quantum pseudorandomness, and gives for the first time a polynomial-time construction of quantum unitARY designs, which can replace fully random operations in most applications.
Improved spectral gaps for random quantum circuits: Large local dimensions and all-to-all interactions
The smallest non-trivial case exactly is solved exactly and numerics and Knabe bounds are combined to improve the constants involved in the spectral gap for small values of $t$ and a recursion relation for the spectral gaps involving an auxiliary random walk is proved.
Unitary designs from statistical mechanics in random quantum circuits.
It is argued that random circuits form approximate unitary $k$-designs in O(nk) depth and are thus essentially optimal in both £n and $k, and can be shown in the limit of large local dimension.