Quantum computation as geometry
From MaRDI portal
Publication:3101404
DOI10.1126/SCIENCE.1121541zbMATH Open1226.81049arXivquant-ph/0603161OpenAlexW1967883933WikidataQ51631130 ScholiaQ51631130MaRDI QIDQ3101404FDOQ3101404
Authors: Mark R. Dowling, Mile Gu, Andrew C. Doherty, Michael Nielsen 
Publication date: 28 November 2011
Published in: Science (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/quant-ph/0603161
Recommendations
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)
Cited In (only showing first 100 items - show all)
- 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
- The Python's lunch: geometric obstructions to decoding Hawking radiation
- Complexity change under conformal transformations in $\mathrm{AdS}_3 / \mathrm{CFT}_{2}$
- Complexity in the presence of a boundary
- Quantum computing with classical bits
- Complexity of operators generated by quantum mechanical Hamiltonians
- Measuring distance between quantum states on a quantum computer
- Circuit complexity in interacting QFTs and RG flows
- Conformal field theory complexity from Euler-Arnold equations
- Evolution of complexity following a quantum quench in free field theory
- Geometry of quantum state manifolds generated by the Lie algebra operators
- Circuit complexity in quantum field theory
- Subsystem complexity and holography
- Title not available (Why is that?)
- Riemannian geometry of quantum computation
- 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
- Holographic fluctuations and the principle of minimal complexity
- Deterministic generations of quantum state with no more than six qubits
- Complexity of formation in holography
- Comments on holographic complexity
- Charged complexity and the thermofield double state
- Post-quench evolution of complexity and entanglement in a topological system
- Islands and complexity of eternal black hole and radiation subsystems for a doubly holographic model
- Sewing spacetime with Lorentzian threads: complexity and the emergence of time in quantum gravity
- 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
- Quantum computational geodesics
- Complexity for charged thermofield double states
- Quantum state geometry and entanglement of two spins with anisotropic interaction in evolution
- Hyper CNOT and hyper Bell-state analysis assisted by quantum dots in double-side optical microcavities
- Circuit complexity for free fermions
- Holographic subregion complexity under a thermal quench
- Holographic complexity under a global quantum quench
- Complexity measures in QFT and constrained geometric actions
- Title not available (Why is that?)
- Time evolution of complexity: a critique of three methods
- Unitary transformations can be distinguished locally
- Tools in the Riemannian geometry of quantum computation
- Complexity measures from geometric actions on Virasoro and Kac-Moody orbits
- Complexity of mixed Gaussian states from Fisher information geometry
- General bounds on holographic complexity
- Complexity of the AdS soliton
- Quantum advantage with shallow circuits
- 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
- Channel divergences and complexity in algebraic QFT
- Faster than Hermitian quantum mechanics
- A geometric algebra perspective on quantum computational gates and universality in quantum computing
- Dynamic programming and viscosity solutions for the optimal control of quantum spin systems
- Geometry of discrete quantum computing
- Title not available (Why is that?)
- WdW-patches in \(\mathrm{AdS}_3\) and complexity change under conformal transformations. II
- Geometrical description of the dynamics of entangled two-qubit states under \(U(2)\times U(2)\) local unitary operations
- On operator growth and emergent Poincaré symmetries
- Holographic and QFT complexity with angular momentum
- Circuit complexity for coherent states
- Black holes, complexity and quantum chaos
- Probing the geometry of two-qubit state space by evolution
- Quantum computational complexity, Einstein's equations and accelerated expansion of the Universe
- The quantum brachistochrone problem for an arbitrary spin in a magnetic field
- Subsystem complexity after a local quantum quench
- Complexity growth in integrable and chaotic models
- Reparameterization dependence is useful for holographic complexity
- Spacetime as a quantum circuit
- Holographic complexity of rotating black holes
- Subsystem complexity after a global quantum quench
- Complexity of mixed states in QFT and holography
- 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
- Aspects of the first law of complexity
- Geometrical aspects and quantum brachistochrone problem for a collection of \(N\) spin-\(s\) system with long-range Ising-type interaction
- Cosmological complexity of the modified dispersion relation
- Geometry and speed of evolution for a spin-\(s\) system with long-range \(zz\)-type Ising interaction
- Complexity of quantum circuits via sensitivity, magic, and coherence
- Integrability and complexity in quantum spin chains
- 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
- Geometrical and dynamical description of two interacting spins under the XXZ-type Heisenberg model
- Complexity, information geometry, and Loschmidt echo near quantum criticality
- Algebraic representation of Three Qubit Quantum Circuit Problems
- Topological quantum gates in homotopy type theory
- ASPECTS OF THE RIEMANNIAN GEOMETRY OF QUANTUM COMPUTATION
- Krylov complexity and orthogonal polynomials
- Delicate windows into evaporating black holes
- Universal chaotic dynamics from Krylov space
- Computational Geometry Analysis of Quantum State Space and Its Applications
- Circuit complexity through phase transitions: consequences in quantum state preparation
- Title not available (Why is that?)
- Evolution of circuit complexity in a harmonic chain under multiple quenches
- Quantum computational complexity in curved spacetime
- Non-analyticity in holographic complexity near critical points
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)
