Integrable quantum computation
From MaRDI portal
Publication:1937235
DOI10.1007/S11128-012-0409-4zbMATH Open1263.81127arXiv1111.3940OpenAlexW2085882982MaRDI QIDQ1937235FDOQ1937235
Publication date: 28 February 2013
Published in: Quantum Information Processing (Search for Journal in Brave)
Abstract: Integrable quantum computation is defined as quantum computing via the integrable condition, in which two-qubit gates are either nontrivial unitary solutions of the Yang--Baxter equation or the Swap gate (permutation). To make the definition clear, in this article, we explore the physics underlying the quantum circuit model, and then present a unified description on both quantum computing via the Bethe ansatz and quantum computing via the Yang--Baxter equation.
Full work available at URL: https://arxiv.org/abs/1111.3940
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Yang-Baxter equations (16T25) Bethe-Salpeter and other integral equations arising in quantum theory (81Q40)
Cites Work
Cited In (15)
- Discrete quantum computation and Lagrange's four-square theorem
- Interferometric computation beyond quantum theory
- Quantum Computation of Universal Link Invariants
- Factorization problems on rational loop groups, and the Poisson geometry of Yang-Baxter maps
- Quantum abacus
- Quantum computation using action variables
- Geometry and symmetric coherent states of three qubits systems
- Quantum computation with programmable connections between gates
- Geometric representations of braid and Yang-Baxter gates
- Ergodic quantum computing
- Title not available (Why is that?)
- Index
- Quantum computation by quantumlike systems
- Title not available (Why is that?)
- Quantum algorithm for Feynman loop integrals
This page was built for publication: Integrable quantum computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1937235)
