Quantum computation as geometry
From MaRDI portal
Publication:3101404
Information theory (general) (94A15) Quantum computation (81P68) Variational principles of physics (49S05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Variational problems in applications to the theory of geodesics (problems in one independent variable) (58E10)
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.
Recommendations
Cited in
(only showing first 100 items - show all)- Complexity of mixed states in QFT and holography
- Complexity from the reduced density matrix: a new diagnostic for chaos
- How smooth is quantum complexity?
- Quantumness and memory of one qubit in a dissipative cavity under classical control
- Quantum Talagrand, KKL and Friedgut's theorems and the learnability of quantum Boolean functions
- The Python's lunch: geometric obstructions to decoding Hawking radiation
- Krylov complexity in quantum field theory
- C=anything and the switchback effect in Schwarzschild-de Sitter space
- Inflationary Krylov complexity
- Cost of holographic path integrals
- Complexity change under conformal transformations in $\mathrm{AdS}_3 / \mathrm{CFT}_{2}$
- Complexity in the presence of a boundary
- Geometrical aspects and quantum brachistochrone problem for a collection of \(N\) spin-\(s\) system with long-range Ising-type interaction
- Quantum computing with classical bits
- Geometry and speed of evolution for a spin-s system with long-range zz-type Ising interaction
- Complexity of operators generated by quantum mechanical Hamiltonians
- Aspects of the first law of complexity
- Cosmological complexity of the modified dispersion relation
- Measuring distance between quantum states on a quantum computer
- Complexity of quantum circuits via sensitivity, magic, and coherence
- Integrability and complexity in quantum spin chains
- Circuit complexity in interacting QFTs and RG flows
- Holographic complexity of the extended Schwarzschild-de Sitter space
- Complexity growth and the Krylov-Wigner function
- Krylov complexity for Jacobi coherent states
- The early universe as an open quantum system: complexity and decoherence
- Evolution of complexity following a quantum quench in free field theory
- Conformal field theory complexity from Euler-Arnold equations
- Geometry of quantum state manifolds generated by the Lie algebra operators
- Geometrical and dynamical description of two interacting spins under the XXZ-type Heisenberg model
- Circuit complexity in quantum field theory
- Complexity, information geometry, and Loschmidt echo near quantum criticality
- Subsystem complexity and holography
- Riemannian geometry of quantum computation
- scientific article; zbMATH DE number 2190773 (Why is no real title available?)
- Algebraic representation of Three Qubit Quantum Circuit Problems
- Information geometry for Fermi-Dirac and Bose-Einstein quantum statistics
- Geometric algebra and information geometry for quantum computational software
- Holographic complexity of Einstein-Maxwell-Dilaton gravity
- ASPECTS OF THE RIEMANNIAN GEOMETRY OF QUANTUM COMPUTATION
- Topological quantum gates in homotopy type theory
- Holographic fluctuations and the principle of minimal complexity
- Krylov complexity and orthogonal polynomials
- Deterministic generations of quantum state with no more than six qubits
- Complexity of formation in holography
- Comments on holographic complexity
- Post-quench evolution of complexity and entanglement in a topological system
- Charged complexity and the thermofield double state
- Islands and complexity of eternal black hole and radiation subsystems for a doubly holographic model
- Quantifying the complexity of geodesic paths on curved statistical manifolds through information geometric entropies and Jacobi fields
- Quantum computation with coherent spin states and the close Hadamard problem
- Sewing spacetime with Lorentzian threads: complexity and the emergence of time in quantum gravity
- Delicate windows into evaporating black holes
- Universal chaotic dynamics from Krylov space
- Computational Geometry Analysis of Quantum State Space and Its Applications
- Hyper CNOT and hyper Bell-state analysis assisted by quantum dots in double-side optical microcavities
- Complexity for charged thermofield double states
- Quantum state geometry and entanglement of two spins with anisotropic interaction in evolution
- Circuit complexity for free fermions
- Holographic subregion complexity under a thermal quench
- Holographic complexity under a global quantum quench
- Quantum computational geodesics
- Complexity measures in QFT and constrained geometric actions
- Circuit complexity through phase transitions: consequences in quantum state preparation
- scientific article; zbMATH DE number 2103531 (Why is no real title available?)
- Evolution of circuit complexity in a harmonic chain under multiple quenches
- Quantum computational complexity in curved spacetime
- scientific article; zbMATH DE number 5863327 (Why is no real title available?)
- Non-analyticity in holographic complexity near critical points
- Time evolution of complexity: a critique of three methods
- Holographic entanglement entropy, subregion complexity and Fisher information metric of `black' non-susy D3 brane
- Geometric methods in quantum information and entanglement variational principle
- The geometry of quantum computing
- Unitary transformations can be distinguished locally
- Holographic complexity of LST and single trace \(T\overline{T}\)
- Tools in the Riemannian geometry of quantum computation
- Krylov complexity in free and interacting scalar field theories with bounded power spectrum
- Complexity=anything: singularity probes
- Gravitation from optimized computation: Einstein and beyond
- Holographic complexity of Jackiw-Teitelboim gravity from Karch-Randall braneworld
- Complexity measures from geometric actions on Virasoro and Kac-Moody orbits
- General bounds on holographic complexity
- Complexity of mixed Gaussian states from Fisher information geometry
- More on complexity of operators in quantum field theory
- The theory of variational hybrid quantum-classical algorithms
- Circuit complexity of knot states in Chern-Simons theory
- Complexity of the AdS soliton
- Krylov complexity of deformed conformal field theories
- Entanglement and quantum state geometry of a spin system with all-range Ising-type interaction
- Complexity of the Einstein-Born-Infeld-massive black holes
- Quantum advantage with shallow circuits
- The roles of drift and control field constraints upon quantum control speed limits
- Operator growth and Krylov complexity in Bose-Hubbard model
- Circuit complexity for Carrollian conformal (BMS) field theories
- Towards a geometrization of quantum complexity and chaos
- One-qubit quantum gates associated with topological defects in solids
- Aspects of the Riemannian geometry of quantum computation
- Complexity is a matter of distance
- Krylov complexity and spectral form factor for noisy random matrix models
- Faster than Hermitian quantum mechanics
This page was built for publication: Quantum computation as geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3101404)
