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)- A geometric algebra perspective on quantum computational gates and universality in quantum computing
- Channel divergences and complexity in algebraic QFT
- Geometric quantum complexity of bosonic oscillator systems
- Quantum computer graphics algorithms
- Dynamic programming and viscosity solutions for the optimal control of quantum spin systems
- Spontaneously interacting qubits from Gauss-Bonnet
- Information theoretic measures for Lifshitz system
- Measurable Krylov spaces and eigenenergy count in quantum state dynamics
- Universal early-time growth in quantum circuit complexity
- Towards complexity in de Sitter space from the doubled-scaled Sachdev-Ye-Kitaev model
- C${\cal C}$osmological K${\cal K}$rylov C${\cal C}$omplexity
- Circuit complexity near critical points
- An online calculator for quantum computing operations based on geometric algebra
- Quantum fibrations: quantum computation on an arbitrary topological space
- Encoding quantum bits in bound electronic states of a graphene nanotorus
- WdW-patches in \(\mathrm{AdS}_3\) and complexity change under conformal transformations. II
- Geometry of discrete quantum computing
- scientific article; zbMATH DE number 1746668 (Why is no real title available?)
- Holographic complexity of LST and single trace \(T\overline{T}\), \(J\overline{T}\) and \(T\overline{J}\) deformations
- Complexity for superconformal primaries from BCH techniques
- An upper bound on the time required to implement unitary operations
- On operator growth and emergent Poincaré symmetries
- Geometrical description of the dynamics of entangled two-qubit states under \(U(2)\times U(2)\) local unitary operations
- Holographic and QFT complexity with angular momentum
- Spread complexity and topological transitions in the Kitaev chain
- Circuit complexity for coherent states
- Complexity of quantum-mechanical evolutions from probability amplitudes
- Probing Krylov complexity in scalar field theory with general temperatures
- Black holes, complexity and quantum chaos
- Quantum computing in exactly solvable models and geometric phases
- Probing the geometry of two-qubit state space by evolution
- Complexity from spinning primaries
- Complexity of scalar collapse in anti-de Sitter spacetime
- Partial islands and subregion complexity in geometric secret-sharing model
- Saturation of thermal complexity of purification
- Position dependence of Nielsen complexity for the thermofield double state
- The quantum brachistochrone problem for an arbitrary spin in a magnetic field
- Quantum computational complexity, Einstein's equations and accelerated expansion of the Universe
- 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
- Krylov localization and suppression of complexity
- Q-curvature and path integral complexity
- Symmetry breaking to Majorana Brown-Susskind metric
- Toward the nonequilibrium thermodynamic analog of complexity and the Jarzynski identity
- Holographic complexity of rotating black holes
- Subsystem complexity after a global quantum quench
- Krylov complexity of fermionic and bosonic Gaussian states
- Geometric phase of a two-level system driven by a classical field
- Implementing a quantum computation by free falling
- 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
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)
