Quantum analogue computing

DOI10.1098/RSTA.2010.0017MaRDI QIDQ3065831zbMATH OpenOpenAlexWikidataFDO

Authors Vivien M. Kendon, K. Nemoto, W. J. Munro

Publication date 7 January 2011

Published in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1001.2215, https://strathprints.strath.ac.uk/79060/

zbMATH Keywords

quantum computationquantum informationquantum simulation

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02) Quantum computation (81P68)

Abstract: 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 quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data is encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the Hilbert space of the (logical) qubits in the quantum computer. This type of direct correspondence is how data is encoded in a classical analogue computer. There is no binary encoding, and increasing precision becomes exponentially costly: an extra bit of precision doubles the size of the computer. This has important consequences for both the precision and error correction requirements of quantum simulation, and significant open questions remain about its practicality. It also means that the quantum version of analogue computers, continuous variable quantum computers (CVQC) becomes an equally efficient architecture for quantum simulation. Lessons from past use of classical analogue computers can help us to build better quantum simulators in future.

Recommendations

• Using quantum computers for quantum simulation
• Simulating quantum systems on a quantum computer
• Quantum analog computing
• Ancilla-based quantum simulation
• Quantum computing classical physics

Cites work

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Universal Quantum Simulators

Cited in

(9)

• Binary representation of coordinate and momentum in quantum mechanics
• Quantum abacus
• Analog quantum computing (AQC) and the need for time-symmetric physics
• RISQ - reduced instruction set quantum computers
• The road to quantum computational supremacy
• Ancilla-based quantum simulation
• Quantum Implementation of Numerical Methods for Convection-Diffusion Equations: Toward Computational Fluid Dynamics
• Quantum computation by quantumlike systems
• The quantum monadology

This page was built for publication: Quantum analogue computing

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