Quantum analogue computing

  title={Quantum analogue computing},
  author={Viv Kendon and Kae Nemoto and William J. Munro},
  journal={Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences},
  pages={3609 - 3620}
  • V. Kendon, K. Nemoto, W. Munro
  • Published 13 January 2010
  • Computer Science, Medicine, Physics, Biology
  • Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
We briefly review what a quantum computer is, what it promises to do for us and why it is so hard to build one. Among the first applications anticipated to bear fruit is the quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data are encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the… Expand
4 – Quantum Computing
While quantum parallelism offers tangible speedups, NP-hard problems probably cannot be solved in polynomial time; the entropy and fidelity of quantum states are discussed. Expand
Using the qubus for quantum computing
In this thesis I explore using the qubus for quantum computing. The qubus is an architecture of quantum computing, where a continuous variable ancilla is used to generate operations between matterExpand
Using Quantum Computers for Quantum Simulation
The theoretical and experimental development of quantum simulation using quantum computers is surveyed, from the first ideas to the intense research efforts currently underway. Expand
Hybrid quantum computing with ancillas
This review provides an overview of the basic concepts of the gate model quantum computer architecture, including the different possible forms of information encodings – from base two up to continuous variables – and a more detailed description of how the main types of ancilla-mediated quantum operations provide efficient quantum gates. Expand
Can one trust quantum simulators?
It is found that disorder can decrease the reliability of an analog quantum simulator of this model, although large errors in local observables are introduced only for strong levels of disorder. Expand
Quantum information processing with superconducting circuits: a review.
  • G. Wendin
  • Physics, Medicine
  • Reports on progress in physics. Physical Society
  • 2017
The time is ripe for describing some of the recent development of superconducting devices, systems and applications as well as practical applications of QIP, such as computation and simulation in Physics and Chemistry. Expand
What is a quantum simulator?
Quantum simulators are devices that actively use quantum effects to answer questions about model systems and, through them, real systems. In this review we expand on this definition by answeringExpand
What is a quantum simulator
This work expands on this definition by answering several fundamental questions about the nature and use of quantum simulators by providing a perspective on the achievements and directions of the field of quantum simulation. Expand
Value of NMR Parameters and DFT Calculations for Quantum Information Processing Utilizing Phosphorus Heterocycles.
BDF-NO2 was the best candidate for NMR quantum computations (NMR-QC) among the studied series and showed a significant similarity with the experimental geometrical parameters. Expand
Analog quantum computing (AQC) and the need for time-symmetric physics
This paper discusses what will be necessary to achieve the full potential capabilities of analog quantum computing (AQC), which is defined here as the enrichment of continuous-variable computing toExpand


Quantum theory, the Church–Turing principle and the universal quantum computer
  • D. Deutsch
  • Mathematics
  • Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1985
It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every finitely realizibleExpand
A random walk approach to quantum algorithms
  • V. Kendon
  • Computer Science, Mathematics
  • Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2006
Surprisingly, the effect of making the walk slightly less than perfectly quantum can optimize the properties of the quantum walk for algorithmic applications, which forms the basis of a quantum speed up, which can be exploited to solve problems faster. Expand
Limitations of quantum simulation examined by simulating a pairing Hamiltonian using nuclear magnetic resonance.
A theoretical and experimental study of an algorithm proposed by Wu, Byrd, and Lidar to find the low-lying spectrum of a pairing Hamiltonian is demonstrated with a three qubit NMR system. Expand
Adiabatic quantum computation is equivalent to standard quantum computation
The model of adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its exact computational power has been unknown, so this result implies that the adiABatic computation model and the standard quantum circuit model are polynomially equivalent. Expand
Quantum information with continuous variables
  • T. Ralph
  • Computer Science
  • Conference Digest. 2000 International Quantum Electronics Conference (Cat. No.00TH8504)
  • 2000
This work discusses new work that shows how entanglement of the Bell-type can be observed in continuous variable, homodyne measurement schemes, and contrasts the various classical limits which emerge from the different ways of assessing teleportation. Expand
Massively parallel quantum computer simulator
The results demonstrate that the simulator exhibits nearly ideal scaling as a function of the number of processors and suggest that the simulation software described in this paper may also serve as benchmark for testing high-end parallel computers. Expand
Multiple-particle interference and quantum error correction
  • A. Steane
  • Physics, Mathematics
  • Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1996
The concept of multiple-particle interference is discussed, using insights provided by the classical theory of error correcting codes. This leads to a discussion of error correction in a quantumExpand
A fast quantum mechanical algorithm for database search
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) . Expand
Perfect Quantum Error Correcting Code.
A quantum error correction code which protects a qubit of information against general one qubit errors and encode the original state by distributing quantum information over five qubits, the minimal number required for this task. Expand
Quantum Computation by Adiabatic Evolution
We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian thatExpand