• Corpus ID: 248811491

Hay from the haystack: explicit examples of exponential quantum circuit complexity

@inproceedings{Jia2022HayFT,
  title={Hay from the haystack: explicit examples of exponential quantum circuit complexity},
  author={Yifan Jia and Michael M. Wolf},
  year={2022}
}
: The vast majority of quantum states and unitaries have circuit complexity exponential in the number of qubits. In a similar vein, most of them also have exponential minimum description length, which makes it difficult to pinpoint examples of exponential complexity. In this work, we construct examples of constant description length but exponential circuit complexity. We provide infinite families such that each element requires an exponential number of two-qubit gates to be generated exactly from… 

Figures from this paper

References

SHOWING 1-10 OF 41 REFERENCES
Efficient discrete approximations of quantum gates
TLDR
Here it is proved that using certain sets of base gates quantum compiling requires a string length that is linear in log 1/e, a result which matches the lower bound from counting volume up to constant factor.
Approximation by Quantum Circuits
TLDR
The overall conclusion is that almost all problems are hard to solve with quantum circuits, including decision problem and guess checkable functions.
Asymptotically optimal quantum circuits for d-level systems.
TLDR
Both a lower bound and a constructive upper bound on the number of two-qudit gates result, proving a sharp asymptotic of theta(d(2n)) gates, which closes the complexity question for all d-level systems (d finite).
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.
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.
Quantum computation and quantum information
  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal
Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm
TLDR
The first inversefree Solovay-Kitaev algorithm is provided, which makes no assumption on the structure within a gate set beyond universality, answering this problem in the affirmative, and providing an efficient compilation algorithm in the absence of inverses for both SU(d) and SL(d,C).
A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function
TLDR
A (3+1/86)n-o(n) lower bound on the size of a Boolean circuits over the full binary basis for an explicitly defined predicate, namely an affine disperser for sublinear dimension is proved.
Lieb-Robinson bounds and the generation of correlations and topological quantum order.
The Lieb-Robinson bound states that local Hamiltonian evolution in nonrelativistic quantum mechanical theories gives rise to the notion of an effective light cone with exponentially decaying tails.
Generating topological order: No speedup by dissipation
TLDR
This work considers the problem of converting a product state to a ground state of a topologically ordered system through a locally generated open-system dynamic, and shows that such a conversion takes an amount of time proportional to the diameter of the system.
...
...