Non-invertible symmetries define quantum gates with generalized complexity distances, and simple objects in symmetry categories turn out to be computationally complex in concrete 4D and 2D QFT examples.
Quantum Computation as Geometry
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
abstract
Quantum computers hold great promise, but it remains a challenge to find efficient quantum circuits that solve interesting computational problems. We show that finding optimal quantum circuits is essentially equivalent to finding the shortest path between two points in a certain curved geometry. By recasting the problem of finding quantum circuits as a geometric problem, we open up the possibility of using the mathematical techniques of Riemannian geometry to suggest new quantum algorithms, or to prove limitations on the power of quantum computers.
citation-role summary
background 2
citation-polarity summary
fields
hep-th 5verdicts
UNVERDICTED 5roles
background 2polarities
background 2representative citing papers
Krylov complexity equals Fubini-Study volume for closed and open two-mode squeezed states, providing analytic support for the generalized CV conjecture via information geometry.
Studies holographic complexity in the Klebanov-Strassler background, reporting common scaling with confinement scale across functionals and more complex UV divergences than in AdS.
Holographic complexity of CFTs in global dS_d is computed via volume and action prescriptions in AdS foliation and brane setups, then compared to results from static and Poincare patches.
Time-dependent holographic entanglement entropy and complexity are computed perturbatively for braneworld FLRW universes with radiation, matter, and exotic matter by using time-dependent brane positions in black brane bulk geometries.
citing papers explorer
-
Generalized Complexity Distances and Non-Invertible Symmetries
Non-invertible symmetries define quantum gates with generalized complexity distances, and simple objects in symmetry categories turn out to be computationally complex in concrete 4D and 2D QFT examples.
-
Generalized CV Conjecture and Krylov Complexity in Two-Mode Hermitian Systems via Information Geometry
Krylov complexity equals Fubini-Study volume for closed and open two-mode squeezed states, providing analytic support for the generalized CV conjecture via information geometry.
-
Holographic complexity of the Klebanov-Strassler background
Studies holographic complexity in the Klebanov-Strassler background, reporting common scaling with confinement scale across functionals and more complex UV divergences than in AdS.
-
Holographic complexity of conformal fields in global de Sitter spacetime
Holographic complexity of CFTs in global dS_d is computed via volume and action prescriptions in AdS foliation and brane setups, then compared to results from static and Poincare patches.
-
Holographic entanglement entropy and complexity for the cosmological braneworld model
Time-dependent holographic entanglement entropy and complexity are computed perturbatively for braneworld FLRW universes with radiation, matter, and exotic matter by using time-dependent brane positions in black brane bulk geometries.