Fast universal quantum computation with railroad-switch local Hamiltonians

DOI10.1063/1.3384661MaRDI QIDQ5251258zbMATH OpenOpenAlexWikidataFDO

Authors 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

Applications of operator theory in systems, signals, circuits, and control theory (47N70) 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)

Abstract: We present two universal models of quantum computation with a time-independent, frustration-free Hamiltonian. The first construction uses 3-local (qubit) projectors, and the second one requires only 2-local qubit-qutrit projectors. We build on Feynman's Hamiltonian computer idea and use a railroad-switch type clock register. The resources required to simulate a quantum circuit with L gates in this model are O(L) small-dimensional quantum systems (qubits or qutrits), a time-independent Hamiltonian composed of O(L) local, constant norm, projector terms, the possibility to prepare computational basis product states, a running time O(L log^2 L), and the possibility to measure a few qubits in the computational basis. Our models also give a simplified proof of the universality of 3-local Adiabatic Quantum Computation.

Recommendations

• Efficient circuits for exact-universal computation with qudits
• scientific article; zbMATH DE number 5320194
• Instantaneous non-local computation of low T-depth quantum circuits
• Universal quantum computation with spin-1/2 pairs and Heisenberg exchange
• High fidelity universal set of quantum gates using non-adiabatic rapid passage
• scientific article; zbMATH DE number 5666680
• Efficient Universal Quantum Circuits
• Superpolynomial Speedups Based on Almost Any Quantum Circuit
• Universal quantum computation with electronic qubits in decoherence-free subspace
• Fast and robust implementation of quantum gates by transitionless quantum driving

Cites work

• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• Entropy generation in a model of reversible computation
• Ergodic quantum computing
• Fault-tolerant quantum computation by anyons
• Grover's algorithm on a Feynman computer
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 5320237 (Why is no real title available?)
• scientific article; zbMATH DE number 1776257 (Why is no real title available?)
• New construction for a QMA complete three-local Hamiltonian
• QUANTUM COMPUTATION BY MEASUREMENTS
• Quantum walks on graphs
• Realizable Hamiltonians for universal adiabatic quantum computers
• Speed and entropy of an interacting continuous time quantum walk
• The clock of a quantum computer
• The complexity of quantum spin systems on a two-dimensional square lattice
• The Complexity of the Local Hamiltonian Problem

Cited in

(10)

• On the quantum adiabatic evolution with the most general system Hamiltonian
• Quantum 3-SAT Is QMA₁-complete
• Quantum walks on necklaces and mixing
• scientific article; zbMATH DE number 5320194 (Why is no real title available?)
• Quantum algorithm for simulating real time evolution of lattice Hamiltonians
• Space-time circuit-to-Hamiltonian construction and its applications
• Time independent universal computing with spin chains: quantum plinko machine
• Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
• Universal resources for quantum computing
• The power of quantum systems on a line

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5251258)