Quantum Register Physics

Abstract

Motivated by Feynman's 1983 paper on the simulation of physics by computers, we present a general approach to the description of quantum experiments which uses quantum bit registers to represent the spatio-temporal changes occurring in apparatus-systems during the course of such experiments. To illustrate our ideas, we discuss the Stern-Gerlach experiment, Wollaston prisms, beam splitters, Mach-Zender interferometers, von Neumann (PVM) tests, the more general POVM formalism, and a variety of modern quantum experiments, such as two-particle interferometry and the EPR scenario.

32 pages, 17 figures

References in corpus (1)

• Quantum Adiabatic Evolution Algorithms with Different Paths

Cited by in corpus (7)

• Scaling and diabatic effects in quantum annealing with a D-Wave device
• Exponential complexity of an adiabatic algorithm for an NP-complete problem
• Scaling of running time of quantum adiabatic algorithm for propositional satisfiability
• Spin-1/2 particles moving on a 2D lattice with nearest-neighbor interactions can realize an autonomous quantum computer
• Assessment of Quantum Annealing for the Construction of Satisfiability Filters
• Quantum Adiabatic Computation and the Travelling Salesman Problem
• Eigenlevel statistics of the quantum adiabatic algorithm