This paper describes a novel approach to emulate a universal quantum computer with a wholly classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any modality (e.g. acoustic, electromagnetic, etc.) but this paper will focus on electronic signals. Individual qubits are represented by in-phase and quadrature sinusoidal signals, while unitary gate operations are performed using simple analog electronic circuit devices. In this manner, the Hilbert space structure of a multi-qubit quantum state, as well as a universal set of gate operations, may be fully emulated classically. Results from a programmable prototype system are presented and discussed.
This paper describes a novel approach to emulate a universal quantum computer with a wholly classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any modality (e.g. acoustic, electromagnetic, etc.) but this paper will focus on electronic signals. Individual qubits are represented by in-phase and quadrature sinusoidal signals, while unitary gate operations are performed using simple analog electronic circuit devices. In this manner, the Hilbert space structure of a multi-qubit quantum state, as well as a universal set of gate operations, may be fully emulated classically. Results from a programmable prototype system are presented and discussed.
In this paper we present a novel approach to emulating a universal quantum computer with a classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any modality (e.g., acoustic, electromagnetic, etc), but we focus our discussion here on electronic signals. Unitary gate operations are performed using analog electronic circuit devices, such as four-quadrant multipliers, operational amplifiers, and analog filters, although non-unitary operations may be performed as well. In this manner, the Hilbert space structure of the quantum state, as well as a universal set of gate operations, may be fully emulated classically. The required bandwidth scales exponentially with the number of qubits, however, thereby limiting the scalability of the approach, but the intrinsic parallelism, ease of construction, and classical robustness to decoherence may nevertheless lead to capabilities and efficiencies rivaling that of current high performance computers.
Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical structures of gate-based quantum computing, such as unitary operations on a finite-dimensional Hilbert space, are not unique to quantum systems but may be found in certain classical systems as well. Previously, it has been shown that one can represent an arbitrary multi-qubit quantum state in terms of classical analog signals using nested quadrature amplitude modulated signals. Furthermore, using digitally controlled analog electronics one may manipulate these signals to perform quantum gate operations and thereby execute quantum algorithms. The computational capacity of a single signal is, however, limited by the required bandwidth, which scales exponentially with the number of qubits when represented using frequency-based encoding. To overcome this limitation, we introduce a method to extend this approach to multiple parallel signals. Doing so allows a larger quantum state to be emulated with the same gate time required for processing frequency-encoded signals. In the proposed representation, each doubling of the number of signals corresponds to an additional qubit in the spatial domain. Single quit gate operations are similarly extended so as to operate on qubits represented using either frequency-based or spatial encoding schemes. Furthermore, we describe a method to perform gate operations between pairs of qubits represented using frequency or spatial encoding or between frequency-based and spatially encoded qubits. Finally, we describe how this approach may be extended to represent qubits in the time domain as well.
We construct a completely analog framework that emulates universal quantum gates and quantum algorithms. It is based on electronic circuits made of operational amplifiers, resistors and capacitors. In these circuits, input and output lines represent the computational basis states (CBSs) and thus 2n lines are required to represent n qubits. An operation of the circuits is based on classical evolution and interference of complex amplitudes associated with each CBS. The framework can emulate entangled states and is free from decoherence, measurements are classical and do not collapse states. Similar to physical quantum computers, emulated quantum algorithms can be constructed as a sequence of the gates belonging to a universal set (phase shift, Hadamard, controlled-NOT), as a unitary matrix and as combinations of the two. Circuits representing the universal gates have been made and tested. We also have made a matrix-based emulator of a 3-qubit Grover search algorithm. We tested it by searching for one and two particular states with one and two iterations and found that its outputs accurately match predicted values. We anticipate that the emulators can work as sub-components of physical quantum computers. On their own, the emulators can be used for operations that require a few qubits or operations that can be split into independent (and perhaps weakly entangled) blocks of qubits.
Between the digital and quantum paradigms lies the emerging field of quantum-inspired analog computing, in which classical waves emulate quantum circuits. We introduce wavebits -- classical wave analogs of qubits whose amplitudes are carried by physical oscillatory signals -- and show that any nonseparable N-qubit state can be encoded in 2N narrowband signals that remain locally separable at every instant; the nonseparable correlations are recovered at readout by time-averaged demodulation over auxiliary carrier frequencies, the nonseparability channels. We prove that any two-qubit gate unravels into the time-averaged tensor product of two local time-varying operators, and that arbitrary circuits are emulated with a base-frequency count scaling linearly in the number of entangling two-qubit gates, independent of qubit number for a fixed gate count. The exponential cost of the 2^N-dimensional state reappears at readout and in the averaging time of circuits with many two-qubit gates, not in circuit execution, as quantified by an analytic error bound that doubles as a hardware design rule. A mixed-signal prototype emulates Bell state generation, controlled-NOT gates, phase kickback, and Bloch-sphere rotations at fidelities above 0.99, and numerical benchmarks against exact statevectors validate the scheme for up to six qubits. The architecture is directly implementable in acoustic, photonic, and mixed-signal platforms.
Abstract In this paper, a novel method for the emulation of qutrit and ququart based quantum computers is proposed. The Hilbert space and Bloch sphere representations of qutrits are initially discussed, preceding the emulation of a single qutrit using a classical system. The signal representing the state of the quantum system is defined as the sum of quadrature and in-phase 2-dimensional space-varying signals, which represent the basis states of the quantum system. Focus is mainly conferred on the frequency-domain representation of the signal, due to an innate bijective mapping found between the dimensions in the Hilbert space and the frequencies of the signal. An m -qutrit addressing scheme is then proposed which is used in the application of quantum ternary gates and measurement operations. The proposed theory is then used to simulate a ternary version of the Deutsch-Jozsa algorithm on MATLAB. This paper also includes a section on the extension of the theory to the case of ququarts. It concludes with a brief introduction to a potential system for emulation, and lists algorithms that can be implemented on the proposed system.
A circuit system consisting of LC-oscillators is mathematically shown to emulate quantum circuits. Here we develop a SPICE-based framework for emulating universal quantum gates (the phase-shift, the Hadamard, and the CNOT gates). To reconstruct each gate behavior, the inductors and capacitors are chosen and tuned precisely. Each quantum state is perfectly described by the phase and amplitude of each oscillator. In principle, our framework can simulate a quantum system with any arbitrary number of qubits since each gate process is perfectly achieved. Finally, we have simulated a quantum circuit with 3 qubits as input that consists of all the universal quantum gates. Our simulation result shows that our framework can classically emulate the result of any quantum circuit with an arbitrary number of qubits and quantum logic components.