Second law of quantum complexity

@article{Brown2018SecondLO,
  title={Second law of quantum complexity},
  author={Adam R. Brown and Leonard Susskind},
  journal={Physical Review D},
  year={2018},
  volume={97},
  pages={086015}
}
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) complexity of a quantum system of K qubits, and the positional entropy of a related classical system with 2K degrees of freedom. We also argue that the kinetic entropy of the classical system is equivalent to the Kolmogorov complexity of the quantum Hamiltonian. We observe that the expected pattern… 

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

Geometry of quantum complexity

Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum

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

Quantum Cellular Automata, Black Hole Thermodynamics and the Laws of Quantum Complexity

This paper introduces a new formalism for quantum cellular automata (QCAs), based on evolving tensor products of qubits using local unitary operators, and demonstrates that the expected exponential relationships between the quantum circuit complexity of the evolution operator, the classical entropy of the equilibrium QCA state, and the characteristic equilibration time of the QCA, all hold within this new model.

Wasserstein Complexity of Quantum Circuits

This letter obtains a new lower bound for the quantum circuit complexity in terms of a novel complexity measure that is based on the quantum Wasserstein distance, a metric on the space of quantum states, which implies a quantum limit on converting quantum resources to computational resources.

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

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

Complexity of operators generated by quantum mechanical Hamiltonians

A bstractWe propose how to compute the complexity of operators generated by Hamiltonians in quantum field theory (QFT) and quantum mechanics (QM). The Hamiltonians in QFT/QM and quantum circuit have

Quantum complexity and the virial theorem

It is claimed that by applying the virial theorem to the group manifold, one can derive a generic relation between Kolmogorov complexity and computational complexity in the thermal equilibrium.

Circuit Complexity From Supersymmetric Quantum Field Theory With Morse Function

This paper studies the relationship between the circuit complexity and Morse theory within the framework of algebraic topology, which will then help to study circuit complexity in supersymmetric quantum field theory describing both simple and inverted harmonic oscillators up to higher orders of quantum corrections.
...

References

SHOWING 1-10 OF 44 REFERENCES

Resource theory of quantum states out of thermal equilibrium.

It is shown that the free energy of thermodynamics emerges naturally from the resource theory of energy-preserving transformations, provided that a sublinear amount of coherent superposition over energy levels is available, a situation analogous to the sub linear amount of classical communication required for entanglement dilution.

Holographic fluctuations and the principle of minimal complexity

A bstractWe discuss, from a quantum information perspective, recent proposals of Maldacena, Ryu, Takayanagi, van Raamsdonk, Swingle, and Susskind that spacetime is an emergent property of the quantum

The resource theory of stabilizer quantum computation

A resource theory, analogous to the theory of entanglement, is developed that is relevant for fault-tolerant stabilizer computation and introduces two quantitative measures for the amount of non-stabilizer resource, including the sum of the negative entries of the discrete Wigner representation of a quantum state.

Power of One Bit of Quantum Information

In standard quantum computation, the initial state is pure and the answer is determined by making a measurement of some of the bits in the computational basis. What can be accomplished if the initial

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.

Quantum complexity and negative curvature

As time passes, once simple quantum states tend to become more complex. For strongly coupled k-local Hamiltonians, this growth of computational complexity has been conjectured to follow a distinctive

Fast Scramblers

The problem of how fast a quantum system can scramble (thermalize) information, given that the interactions are between bounded clusters of degrees of freedom is considered, and it is conjecture that black holes are the fastest scramblers in nature.

Estimating Jones polynomials is a complete problem for one clean qubit

It is shown that evaluating a certain approximation to the Jones polynomial at a fifth root of unity for the trace closure of a braid is a complete problem for the one clean qubit complexity class.

Addendum to computational complexity and black hole horizons

In this addendum to [arXiv:1402.5674] two points are discussed. In the first additional evidence is provided for a dual connection between the geometric length of an Einstein‐Rosen bridge and the