Fast universal quantum computation with railroad-switch local Hamiltonians

DOI10.1063/1.3384661zbMath1311.81082arXiv0908.4219OpenAlexW3098236081WikidataQ59482322 ScholiaQ59482322MaRDI QIDQ5251258

Daniel Nagaj

Publication date: 19 May 2015

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0908.4219

Mathematics Subject Classification ID

Quantum computation (81P68) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05) Analytic circuit theory (94C05) Applications of operator theory in systems, signals, circuits, and control theory (47N70)

Related Items (6)

QUANTUM WALKS ON NECKLACES AND MIXING ⋮ The power of quantum systems on a line ⋮ Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians ⋮ Quantum 3-SAT Is QMA$_1$-Complete ⋮ On the quantum adiabatic evolution with the most general system Hamiltonian ⋮ Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fault-tolerant quantum computation by anyons
• Ergodic quantum computing
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Entropy generation in a model of reversible computation
• New construction for a QMA complete three-local Hamiltonian
• Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
• Grover's algorithm on a Feynman computer
• The clock of a quantum computer
• QUANTUM COMPUTATION BY MEASUREMENTS
• Realizable Hamiltonians for universal adiabatic quantum computers
• Quantum walks on graphs
• The Complexity of the Local Hamiltonian Problem
• Speed and entropy of an interacting continuous time quantum walk

This page was built for publication: Fast universal quantum computation with railroad-switch local Hamiltonians