Quantum Computation as Geometry
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 8 Pith papers
-
Complexity Inequalities for Quantum Subsystems
Introduces tripartite complexity and complexity gap for three-region subsystems and reports that the gap has a definite sign in holographic volume complexity, Fisher-Rao Gaussian complexity, and Krylov-space approaches.
-
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.
-
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.
-
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.
-
Post-Selection Probability and Fidelity of Bidirectional Teleportation
Post-selection probability and fidelity of bidirectional teleportation are expressed via the Loschmidt echo, revealing initial-state dependence of fidelity and stability of probability in integrable models.
-
Nielsen complexity with multiple cost factors
Generalizes Nielsen complexity to multiple cost factors, derives modified Euler-Arnold and Jacobi equations, and examines effects on conjugate points in single-qubit and SYK systems.
-
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...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.