arXiv subjects

K. De Raedt

Publications and source records attributed to K. De Raedt.

8 recordsLinked to original sources

arXiv2007

Event-by-event simulation of quantum phenomena: Application to Einstein-Podolosky-Rosen-Bohm experiments

We review the data gathering and analysis procedure used in real Einstein-Podolsky-Rosen-Bohm experiments with photons and we illustrate the procedure by analyzing experimental data. Based on this analysis, we construct event-based computer simulation models in which every essential element in the experiment has a counterpart. The data is analyzed by counting single-particle events and two-particle coincidences, using the same procedure as in experiments. The simulation models strictly satisfy Einstein's criteria of local causality, do not rely on any concept of quantum theory or probability theory, and reproduce all results of quantum theory for a quantum system of two $S=1/2$ particles. We present a rigorous analytical treatment of these models and show that they may yield results that are in exact agreement with quantum theory. The apparent conflict with the folklore on Bell's theorem, stating that such models are not supposed to exist, is resolved. Finally, starting from the principles of probable inference, we derive the probability distributions of quantum theory of the Einstein-Podolsky-Rosen-Bohm experiment without invoking concepts of quantum theory.

quant-ph↗

arXiv2006

Massive Parallel Quantum Computer Simulator

We describe portable software to simulate universal quantum computers on massive parallel computers. We illustrate the use of the simulation software by running various quantum algorithms on different computer architectures, such as a IBM BlueGene/L, a IBM Regatta p690+, a Hitachi SR11000/J1, a Cray X1E, a SGI Altix 3700 and clusters of PCs running Windows XP. We study the performance of the software by simulating quantum computers containing up to 36 qubits, using up to 4096 processors and up to 1 TB of memory. Our 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.

quant-ph↗

arXiv2005

Efficient data processing and quantum phenomena: Single-particle systems

We study the relation between the acquisition and analysis of data and quantum theory using a probabilistic and deterministic model for photon polarizers. We introduce criteria for efficient processing of data and then use these criteria to demonstrate that efficient processing of the data contained in single events is equivalent to the observation that Malus' law holds. A strictly deterministic process that also yields Malus' law is analyzed in detail. We present a performance analysis of the probabilistic and deterministic model of the photon polarizer. The latter is an adaptive dynamical system that has primitive learning capabilities. This additional feature has recently been shown to be sufficient to perform event-by-event simulations of interference phenomena, without using concepts of wave mechanics. We illustrate this by presenting results for a system of two chained Mach-Zehnder interferometers, suggesting that systems that perform efficient data processing and have learning capability are able to exhibit behavior that is usually attributed to quantum systems only.

quant-ph↗

arXiv2005

Simulation of Quantum Computation: A deterministic event-based approach

We demonstrate that locally connected networks of machines that have primitive learning capabilities can be used to perform a deterministic, event-based simulation of quantum computation. We present simulation results for basic quantum operations such as the Hadamard and the controlled-NOT gate, and for seven-qubit quantum networks that implement Shor's numbering factoring algorithm.

quant-ph↗

arXiv2005

Event-based simulation of single-photon beam splitters and Mach-Zehnder interferometers

We demonstrate that networks of locally connected processing units with a primitive learning capability exhibit behavior that is usually only attributed to quantum systems. We describe networks that simulate single-photon beam-splitter and Mach-Zehnder interferometer experiments on a causal, event-by-event basis and demonstrate that the simulation results are in excellent agreement with quantum theory.

quant-ph↗

arXiv2005

New method to simulate quantum interference using deterministic processes and application to event-based simulation of quantum computation

quant-ph↗

arXiv2004

Deterministic event-based simulation of quantum interference

We propose and analyse simple deterministic algorithms that can be used to construct machines that have primitive learning capabilities. We demonstrate that locally connected networks of these machines can be used to perform blind classification on an event-by-event basis, without storing the information of the individual events. We also demonstrate that properly designed networks of these machines exhibit behavior that is usually only attributed to quantum systems. We present networks that simulate quantum interference on an event-by-event basis. In particular we show that by using simple geometry and the learning capabilities of the machines it becomes possible to simulate single-photon interference in a Mach-Zehnder interferometer. The interference pattern generated by the network of deterministic learning machines is in perfect agreement with the quantum theoretical result for the single-photon Mach-Zehnder interferometer. To illustrate that networks of these machines are indeed capable of simulating quantum interference we simulate, event-by-event, a setup involving two chained Mach-Zehnder interferometers. We show that also in this case the simulation results agree with quantum theory.

quant-ph↗

arXiv2001

Number Partitioning on a Quantum Computer

We present an algorithm to compute the number of solutions of the (constrained) number partitioning problem. A concrete implementation of the algorithm on an Ising-type quantum computer is given.

quant-ph↗