We first point out the practical difficulties of universal quantum computing which may prohibit practical applications as universal computers. Then we show how to apply analog microelectronic circuits to realize the architecture, data processing and parallel computing abilities of quantum computing via Hilbert space computing with analog circuits. Such a Hilbert-space-analog (HSA) computer simulates the Hilbert space and its operators and it is able to use and test quantum algorithms developed for the real quantum computers. Such a computer would be free of most of the practical difficulties of realizing and running a real quantum computer. This computer can be made universal. It is remarkable that by using the same numbers of transistors as in today's PCs, such a HSA computer can manipulate ~107 analog numbers corresponding to ~23 qubits, simultaneously, by quantum-parallel processing.
We first point out the practical difficulties of universal quantum computing which may prohibit practical applications as universal computers. Then we show how to apply analog microelectronic circuits to realize the architecture, data processing and parallel computing abilities of quantum computing via Hilbert space computing with analog circuits. Such a Hilbert-space-analog (HSA) computer simulates the Hilbert space and its operators and it is able to use and test quantum algorithms developed for the real quantum computers. Such a computer would be free of most of the practical difficulties of realizing and running a real quantum computer. This computer can be made universal. It is remarkable that by using the same numbers of transistors as in today's PCs, such a HSA computer can manipulate ~107 analog numbers corresponding to ~23 qubits, simultaneously, by quantum-parallel processing.
We show that, if time comes when quantum algorithms can be used for universal parallel computation, the "quantum-parallel" computer hardware will most probably be a classical physical system corresponding to a Hilbert space and the actual realization may be the combination of analog and digital circuits. We first point out the practical difficulties of universal quantum computing which may prohibit practical applications as universal computers. Then we show how to apply analog microelectronic circuits to realize the architecture, data processing and parallel computing abilities of quantum computing via Hilbert space computing with analog circuits. Such a Hilbert-space-analog (HSA) computer simulates the Hilbert space and its operators, and it is able to use and test quantum algorithms developed for the real quantum computers. Such a computer would be free of most of the practical difficulties of realizing and running a real quantum computer. This computer can be made universal. It is remarkable that by using the same numbers of transistors as in today's PCs, such a HSA computer can manipulate ~107 analog numbers corresponding to ~22 qubits, simultaneously, by quantum-parallel processing.
This paper explores the feasibility of simulating universal computation using analog quantum circuits. We present a core claim that it is possible to design and implement analog quantum circuits capable of mimicking any universal computational model, such as a Turing machine. The proposed mechanism centers around the architecture of coupled qubits with dynamically tunable interactions, allowing for universal computation through precise manipulation of the circuit. This work emphasizes a practical approach to analog quantum simulation, moving beyond theoretical considerations to a design strategy suitable for experimental realization. The core concepts and theoretical underpinnings of this approach are detailed, outlining the potential for achieving universal computation through analog quantum circuits. The paper's focus is on the design considerations and the necessary conditions for realizing this simulation, rather than presenting experimental results. We explore the mathematical framework required for this simulation, including the representation of quantum states and the evolution operators.
Quantum computing is a process that incorporates interacting physical systems that represent quantum bits and quantum gates. We present the quantum bit (qubit), the quantum register and the quantum gates. The qubit is described as a vector in a two-dimensional Hilbert space and the quantum register, which comprises a number of qubits, as a vector in a multidimensional Hilbert space. Quantum gates are Hilbert space operators that rotate the qubit or the quantum register vectors. Quantum computations are modeled and described using a quantum circuit model. We also present a quantum computer simulator based on the circuit model of quantum computation. In this model quantum computations and quantum algorithms are represented by circuits, which comprise quantum gates and quantum registers. The well-known Deutsch's algorithm is described and the corresponding quantum circuit is presented. Possible applications of quantum computers are be presented and discussed.
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.
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.
Abstract A random walk is one of the widely adopted random processes for simulation and approximation in multiple areas of science and engineering. Quantum random walk is an analog version of the classical random walk. It was first introduced in 1993 by Y. Aharonov et al. They presented that, with the nature of quantum characteristic, the average length of the walking path on a line is possible to larger than a classical random walk can produce. Therefore, the quantum random walk can be used as a tool to construct many other quantum algorithms. Moreover, it can solve graph problems that many real-world problems can be formulated. However, quantum algorithms are only useful in practice if we can implement them efficiently on a quantum computer. In this study, we are then interested in designing and implementing a quantum circuit that can be run on a real quantum computing device. We firstly focus on the most straightforward, which is a one-dimension, quantum random walk algorithm. Then, the quantum circuits are developed and implemented on a real quantum computer and a quantum computing simulator using software development kits provided by IBM. Lastly, the performance and results of the quantum circuits tested on both computing platforms are presented.