Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A Simulation of a Virtual Qubits on a Classical Computer has Been Developed Recently

Yaremi M. García Zavala, Magally Martínez Reyes, Manuél Ávila

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

A simulation of virtual and randomly generated qubits in terms of an infinite number of analogical signals is performed. The quantum gates associated,with the random quantum computer are simulated through operational amplifiers. The present simulation satisfies the five Di Vincenzo requirements imposed to an operative quantum computer. Quantum measurement and entanglement are perfectly well accounted for. Within our approach, decoherence is not a problem since the time of execution of a gate is less than the calibration time of the operational amplifier. In short, the present simulation of a quantum computer in electronics signals and systems is complete and gives important information about the details on decoherence.

Related papers

Simulación de una computadora cuántica virtual sobre una computadora clásica operando con un número infinito de bits

Yaremi M. García Zavala, Magally Martínez Reyes, M. Ávila Aoki

A simulation of virtual and randomly generated qubits in terms of an infinite number of analogical signals is performed. The quantum gates associated,with the random quantum computer are simulated through operational amplifiers. The present simulation satisfies the five Di Vincenzo requirements imposed to an operative quantum computer. Quantum measurement and entanglement are perfectly well accounted for. Within our approach, decoherence is not a problem since the time of execution of a gate is less than the calibration time of the operational amplifier. In short, the present simulation of a quantum computer in electronics signals and systems is complete and gives important information about the details on decoherence.

CIENCIA ergo sum•Oct 13, 2017•0 citations

Signal-based classical emulation of a universal quantum computer

Brian R. La Cour, Granville E. Ott

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.

arXiv:2104.12027•New Journal of Physics•May 13, 2015•34 citations

What Limits the Simulation of Quantum Computers?

Yiqing Zhou, E. Miles Stoudenmire, Xavier Waintal

An ultimate goal of quantum computing is to perform calculations beyond the reach of any classical computer.It is therefore imperative that useful quantum computers be very difficult to simulate classically, otherwise classical computers could be used for the applications envisioned for the quantum ones.Perfect quantum computers are unarguably exponentially difficult to simulate: the classical resources required grow exponentially with the number of qubits N or the depth D of the circuit.This difficulty has triggered recent experiments on deep, random circuits that aim to demonstrate that quantum devices may already perform tasks beyond the reach of classical computing.These real quantum computing devices, however, suffer from many sources of decoherence and imprecision which limit the degree of entanglement that can actually be reached to a fraction of its theoretical maximum.They are characterized by an exponentially decaying fidelity F ∼ ð1 -ϵÞ ND with an error rate ϵ per operation as small as ≈1% for current devices with several dozen qubits or even smaller for smaller devices.In this work, we provide new insight on the computing capabilities of real quantum computers by demonstrating that they can be simulated at a tiny fraction of the cost that would be needed for a perfect quantum computer.Our algorithms compress the representations of quantum wave functions using matrix product states, which are able to capture states with low to moderate entanglement very accurately.This compression introduces a finite error rate ϵ so that the algorithms closely mimic the behavior of real quantum computing devices.The computing time of our algorithm increases only linearly with N and D in sharp contrast with exact simulation algorithms.We illustrate our algorithms with simulations of random circuits for qubits connected in both one-and twodimensional lattices.We find that ϵ can be decreased at a polynomial cost in computing power down to a minimum error ϵ ∞ .Getting below ϵ ∞ requires computing resources that increase exponentially with ϵ ∞ =ϵ.For a two-dimensional array of N ¼ 54 qubits and a circuit with control-Z gates, error rates better than state-of-the-art devices can be obtained on a laptop in a few hours.For more complex gates such as a SWAP gate followed by a controlled rotation, the error rate increases by a factor 3 for similar computing time.Our results suggest that, despite the high fidelity reached by quantum devices, only a tiny fraction ð∼10 -8 Þ of the system Hilbert space is actually being exploited.

arXiv:2002.07730•Physical Review X•Nov 23, 2020•301 citations

Classical analog circuit emulation of quantum Grover search algorithm

Samuel Feldman, Hassam Ghazali, Andrey Rogachev

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 $2^n$ 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.

arXiv:2506.06502•Jun 6, 2025•0 citations

Parallel Quantum Computing Emulation

Brian R. La Cour, S. Andrew Lanham, Corey I. Ostrove

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.

arXiv:1908.06445•IEEE International Conference on Rebooting Computing (ICRC)•Nov 1, 2018•5 citations

QUANTUM DIGITAL-ANALOGUE COMPUTING

A. Khakhanova, Svetlana V. Chumachenko, Дарія Рахліс +2 more

Context. Nature is the relation among processes and phenomena. Nothing exists in the universe without relations. Computer is transactions of relations between data with the help of control and execution mechanisms. Quantum relations are a superposition of particles and their states. Superposition and entanglement are equivalent concepts. Entanglement is a non-local superposition of deterministic states. A quantum computer is unconditional transactions of relations between qubit data. Quantum computer is an analog device for parallel solution of combinatorial problems. Practically oriented definitions of the quantum computer concepts are the path to development of scalable quantum parallel algorithms for combinatorial problems solving. Any algorithm can be reduced to a sequence of operations without conditions, because any truth table is a collection of a complete system of conditions-states. Any sequence of actions can always be reduced to one parallel operation. Conditions and sequences arise only when the developer wants to use previously created primitive constructs to build an always non-optimal computing unit. The paradigm of quantum computer creation is determined through the use of photonic transactions on the electrons of an atom may exclude the use of quantum logic. The evolutionary path of a quantum computer from the classical one: “memory-address-transaction” (MAT) → “electron-addresstransaction” → “electron-address-quantaction” (EAQ) → state-superposition-logic. The meeting point of classical and quantum computers is photon transactions on the structure of electrons. Everything that is calculated on a quantum computer can be calculated in parallel on a classical one on account of memory redundancy. The given example is a memory-driven algorithm for modeling digital products based on qubit-vector forms of functionality description for significant performance boost of computing processes by parallel execution of logical operations. Objective. Simulation of the correct SoC-component behavior based on vector representation of the logic. Formation of the triggering development of a computing based on the superposition of the classical, quantum and analog computing process, which in its development should be based on technological qubit, tabular and vector data structures for the parallel solution of combinatorial problems. Method. MAT-computing implements any algorithms on account of transactions (read-write) in memory. Qubit-vector models for describing functionalities, which differ from known truth tables in compactness of description and manufacturability for the implementation of parallel algorithms of the synthesis and analysis of digital devices and SoC-components. Results. 1) The metric of the technological data structures, focused on parallel troubleshooting in digital systems based on the usage of two logical vector operations, was proposed for the first time. 2) The metric of relations between the individual components of QC, allowing organizing a quantum deterministic computer, has been further developed. 3) Quantum architectural solutions, that allow solving coverage problems in a quasi-parallel mode, were proposed for the first time. 4) Architectural solutions based on an analog-to-digital computing, which can be used to solve the problems of the digital systems parallel analysis, have been further developed. 5) Vector-qubit structures of the logic data, that allow a quasi-parallel simulation of digital circuits, were proposed. Conclusions. Qubit models, quantum methods and combinatorial algorithms for technical diagnostics of digital devices have been implemented, which can significantly (up to 25%) reduce the time of test synthesis, deductive modeling of faulty and correct behavior, search for defective states by introducing an innovative idea of using qubit-vector data structures for describing logical components. Comparative assessments of qubit models and methods usage show an increase in the efficiency of algorithms for modeling digital devices compared to tabular ones. The superposition of a classical, quantum and analog computer is integrally represented, which allows to find the best solutions for recognition and decision making.

Radio Electronics Computer Science Control•Dec 4, 2022•1 citation
A simulation of virtual and randomly generated qubits in terms of an infinite number of analogical signals is performed. The quantum gates associated,with the random quantum computer are simulated through operational amplifiers. The present simulation satisfies the five Di Vincenzo requirements imposed to an operative quantum computer. Quantum measurement and entanglement are perfectly well accounted for. Within our approach, decoherence is not a problem since the time of execution of a gate is less than the calibration time of the operational amplifier. In short, the present simulation of a quantum computer in electronics signals and systems is complete and gives important information about the details on decoherence.
A simulation of virtual and randomly generated qubits in terms of an infinite number of analogical signals is performed. The quantum gates associated,with the random quantum computer are simulated through operational amplifiers. The present simulation satisfies the five Di Vincenzo requirements imposed to an operative quantum computer. Quantum measurement and entanglement are perfectly well accounted for. Within our approach, decoherence is not a problem since the time of execution of a gate is less than the calibration time of the operational amplifier. In short, the present simulation of a quantum computer in electronics signals and systems is complete and gives important information about the details on decoherence.
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.
An ultimate goal of quantum computing is to perform calculations beyond the reach of any classical computer.It is therefore imperative that useful quantum computers be very difficult to simulate classically, otherwise classical computers could be used for the applications envisioned for the quantum ones.Perfect quantum computers are unarguably exponentially difficult to simulate: the classical resources required grow exponentially with the number of qubits N or the depth D of the circuit.This difficulty has triggered recent experiments on deep, random circuits that aim to demonstrate that quantum devices may already perform tasks beyond the reach of classical computing.These real quantum computing devices, however, suffer from many sources of decoherence and imprecision which limit the degree of entanglement that can actually be reached to a fraction of its theoretical maximum.They are characterized by an exponentially decaying fidelity F ∼ ð1 -ϵÞ ND with an error rate ϵ per operation as small as ≈1% for current devices with several dozen qubits or even smaller for smaller devices.In this work, we provide new insight on the computing capabilities of real quantum computers by demonstrating that they can be simulated at a tiny fraction of the cost that would be needed for a perfect quantum computer.Our algorithms compress the representations of quantum wave functions using matrix product states, which are able to capture states with low to moderate entanglement very accurately.This compression introduces a finite error rate ϵ so that the algorithms closely mimic the behavior of real quantum computing devices.The computing time of our algorithm increases only linearly with N and D in sharp contrast with exact simulation algorithms.We illustrate our algorithms with simulations of random circuits for qubits connected in both one-and twodimensional lattices.We find that ϵ can be decreased at a polynomial cost in computing power down to a minimum error ϵ ∞ .Getting below ϵ ∞ requires computing resources that increase exponentially with ϵ ∞ =ϵ.For a two-dimensional array of N ¼ 54 qubits and a circuit with control-Z gates, error rates better than state-of-the-art devices can be obtained on a laptop in a few hours.For more complex gates such as a SWAP gate followed by a controlled rotation, the error rate increases by a factor 3 for similar computing time.Our results suggest that, despite the high fidelity reached by quantum devices, only a tiny fraction ð∼10 -8 Þ of the system Hilbert space is actually being exploited.
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 2n2^n2n lines are required to represent nnn 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.
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.
Context. Nature is the relation among processes and phenomena. Nothing exists in the universe without relations. Computer is transactions of relations between data with the help of control and execution mechanisms. Quantum relations are a superposition of particles and their states. Superposition and entanglement are equivalent concepts. Entanglement is a non-local superposition of deterministic states. A quantum computer is unconditional transactions of relations between qubit data. Quantum computer is an analog device for parallel solution of combinatorial problems. Practically oriented definitions of the quantum computer concepts are the path to development of scalable quantum parallel algorithms for combinatorial problems solving. Any algorithm can be reduced to a sequence of operations without conditions, because any truth table is a collection of a complete system of conditions-states. Any sequence of actions can always be reduced to one parallel operation. Conditions and sequences arise only when the developer wants to use previously created primitive constructs to build an always non-optimal computing unit. The paradigm of quantum computer creation is determined through the use of photonic transactions on the electrons of an atom may exclude the use of quantum logic. The evolutionary path of a quantum computer from the classical one: “memory-address-transaction” (MAT) → “electron-addresstransaction” → “electron-address-quantaction” (EAQ) → state-superposition-logic. The meeting point of classical and quantum computers is photon transactions on the structure of electrons. Everything that is calculated on a quantum computer can be calculated in parallel on a classical one on account of memory redundancy. The given example is a memory-driven algorithm for modeling digital products based on qubit-vector forms of functionality description for significant performance boost of computing processes by parallel execution of logical operations. Objective. Simulation of the correct SoC-component behavior based on vector representation of the logic. Formation of the triggering development of a computing based on the superposition of the classical, quantum and analog computing process, which in its development should be based on technological qubit, tabular and vector data structures for the parallel solution of combinatorial problems. Method. MAT-computing implements any algorithms on account of transactions (read-write) in memory. Qubit-vector models for describing functionalities, which differ from known truth tables in compactness of description and manufacturability for the implementation of parallel algorithms of the synthesis and analysis of digital devices and SoC-components. Results. 1) The metric of the technological data structures, focused on parallel troubleshooting in digital systems based on the usage of two logical vector operations, was proposed for the first time. 2) The metric of relations between the individual components of QC, allowing organizing a quantum deterministic computer, has been further developed. 3) Quantum architectural solutions, that allow solving coverage problems in a quasi-parallel mode, were proposed for the first time. 4) Architectural solutions based on an analog-to-digital computing, which can be used to solve the problems of the digital systems parallel analysis, have been further developed. 5) Vector-qubit structures of the logic data, that allow a quasi-parallel simulation of digital circuits, were proposed. Conclusions. Qubit models, quantum methods and combinatorial algorithms for technical diagnostics of digital devices have been implemented, which can significantly (up to 25%) reduce the time of test synthesis, deductive modeling of faulty and correct behavior, search for defective states by introducing an innovative idea of using qubit-vector data structures for describing logical components. Comparative assessments of qubit models and methods usage show an increase in the efficiency of algorithms for modeling digital devices compared to tabular ones. The superposition of a classical, quantum and analog computer is integrally represented, which allows to find the best solutions for recognition and decision making.