• Corpus ID: 248887663

Saturation and recurrence of quantum complexity in random quantum circuits

@inproceedings{Oszmaniec2022SaturationAR,
  title={Saturation and recurrence of quantum complexity in random quantum circuits},
  author={Michał Oszmaniec and Michal Horodecki and Nicholas Hunter-Jones},
  year={2022}
}
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 beyond quantum computing—in studying the dynamics of quantum many-body systems and the long-time properties of AdS black holes. In this context Brown and Susskind [1] conjectured that the complexity of a chaotic quantum system grows linearly in time up to times exponential in the system size, saturating… 
1 Citations

Figures from this paper

Concentration of quantum equilibration and an estimate of the recurrence time

We show that the dynamics of generic quantum systems concentrate around their equilibrium value when measuring at arbitrary times. This means that the probability of finding them away from equilibrium

References

SHOWING 1-10 OF 66 REFERENCES

Linear growth of quantum circuit complexity

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

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

Improved spectral gaps for random quantum circuits: Large local dimensions and all-to-all interactions

TLDR
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.

Decoupling with Random Quantum Circuits

TLDR
It is proved that random quantum circuits with O(n log2n) gates satisfy an essentially optimal decoupling theorem and can be implemented in depth O(log3n), which proves that decoupled can happen in a time that scales polylogarithmically in the number of particles in the system.

Convergence rates for arbitrary statistical moments of random quantum circuits.

We consider a class of random quantum circuits where at each step a gate from a universal set is applied to a random pair of qubits, and determine how quickly averages of arbitrary finite-degree

The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes

  • S. Aaronson
  • Physics
    Electron. Colloquium Comput. Complex.
  • 2016
TLDR
The focus is quantum circuit complexity---i.e., the minimum number of gates needed to prepare a given quantum state or apply a given unitary transformation---as a unifying theme tying together several topics of recent interest in the field.

Exponential quantum speed-ups are generic

TLDR
It is shown that for almost any sufficiently long quantum circuit one can construct a black-box problem which is solved by the circuit with a constant number of quantum queries, but which requires exponentially many classical queries, even if the classical machine has the ability to postselect.

Quantum complexity of time evolution with chaotic Hamiltonians

TLDR
It is shown numerically that the large- N SYK model (which is chaotic) satisfies ECH and thus has no local obstructions to linear growth of complexity for exponential time, as expected from holographic duality.

A geometric approach to quantum circuit lower bounds

TLDR
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.

Unitary designs from statistical mechanics in random quantum circuits.

TLDR
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.
...