REVIEW 14 cited by
The geometry of quantum computation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.
Forward citations
Cited by 14 Pith papers
-
The Geometry of Quantum Complexity in Open Systems
Open-system quantum complexity is governed by a sub-Finslerian geometry whose curvature depends on the cost penalties for unitary and dissipative controls.
-
Page transition for the complexity of an evaporating black hole
The complexity of radiation from an evaporating black hole is argued to undergo a sharp Page-like transition, dominated after the Page time by the volume of an island in the entanglement wedge.
-
Krylov complexity, mode-resolved complexity and entanglement entropy across phase transitions in the non-Hermitian extended Su-Schrieffer-Heeger model
Mode-resolved Krylov complexity and entanglement entropy signal exceptional-point and topological transitions and dynamical phases in the non-Hermitian extended SSH model.
-
Controlled Chaos in 4D SCFTs
Orbifolds of N=4 SYM produce SCFTs whose dilatation operator in a subsector is realized by a tunable spin chain whose eigenvalue statistics exhibit chaos for specific marginal couplings.
-
Quantum Cosmology in Krylov Space: Complexity and Entropy
In a sharply peaked Gaussian state of a flat FLRW universe with a massless scalar clock, Krylov state complexity grows as σ²(φ−φ0)²/4 and operator complexity is exactly twice that, in both Wheeler-DeWitt and loop quan...
-
CFT Complexity and Penalty Factors
A submersion-based method turns weighted generator costs into state-complexity metrics for CFTs, giving analytic formulas in simple limits and constraints on which weight choices are viable.
-
Spread complexity and the saturation of wormhole size
For finite-N DSSYK, the chord basis is the early part of the physical Krylov basis, and spread complexity, taken as the non-perturbative ER bridge size, saturates after a universality-class-dependent peak and slope.
-
On volume subregion complexity in Vaidya spacetime
In the AdS3 Vaidya geometry, the extremal volume defining holographic subregion complexity is genuinely x-dependent during the quench, so the standard x-independent ansatz fails at intermediate times; early and late t...
-
Emergence of Krylov complexity through quantum walks: An exploration of the quantum origins of complexity
Reducing a graph walk to distance-layers reproduces Krylov/spread complexity, yielding analytic finite-q SYK Lanczos coefficients and hypercube complexity D sin²(t/D), with faster saturation than classical-walk circuits.
-
Generalized Krylov Complexity
The paper defines generalized Krylov complexity for multi-generator unitary evolutions, computes it for U(1)xU(1), a U(1)xU(1) subgroup of SO(10), and SU(2), and introduces a weighted version.
-
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.
-
Universal Euler-Cartan Circuits for Quantum Field Theories
Presents a universal parametrized quantum circuit ansatz based on Euler-Cartan decompositions, benchmarked on energy spectra of lattice QFT models with short- and long-range interactions.
-
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.
-
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.
Discussion (0). Continue with ORCID to comment.