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

arXiv:1610.01089

Quantum parallelism may be limited

Yu. I. Ozhigov

Published Sep 20, 2016• 0 citations
arXivHTMLPDF

Abstract

We consider quantum formalism limited by the classical simulating computer with the fixed memory. The memory is redistributed in the course of modeling by the variation of the set of classical states and the accuracy of the representation of amplitudes. This computational description completely preserves the conventional formalism and does not contradicts to experiments, but it makes impossible fast quantum algorithms. This description involves the slow down of quantum evolutions with the growth of the dimension of the minimal subspace containing entangled states, which arise in the evolution. This slow down is the single difference of the proposed formalism from the standard one; it is negligible for the systems from the usual experiments, including those in which many entangled particle participate, but grows rapidly in the attempt to realize the scalable quantum computations, which require the unlimited parallelism. The experimental verification of this version of quantum formalism is reduced to the fixation of this slow down. In all probability the memory of the abstract computer simulating quantum processes is limited by 10-20 qubits, so it iss possible to use the exiting computers for this aim.

DOI
10.48550/arxiv.1610.01089

Related papers

Algorithmic approach to quantum physics

Yuri Ozhigov

Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the analysis, and a simulation gives a "film" which visualizes many particle quantum dynamics and is demonstrated to a user of the model. Restrictions following from the algorithm theory are considered on a level of fundamental physical laws. Born rule for the calculation of quantum probability as well as the decoherence is derived from the existence of a nonzero minimal value of amplitude module - a grain of amplitude. The limitation on the classical computational resources gives the unified description of quantum dynamics that is not divided to the unitary dynamics and measurements and does not depend on the existence of observer. It is proposed the description of states based on the nesting of particles in each other that permits to account the effects of all levels in the same model. Algorithmic approach admits the possibility of refutation, because it forbids the creation of a scalable quantum computer that is allowed in the conventional quantum formalism.

arXiv:quant-ph/0412196•Dec 26, 2004•3 citations

Parallel Quantum Simulation with Hybrid Quantum-Classical Algorithms

Jincheng Zhang

Parallel Quantum Simulation is a rapidly evolving field within quantum computing, aiming to overcome the limitations of single-qubit or small-system simulations for complex quantum systems. This paper explores a novel hybrid quantum-classical algorithm designed to significantly enhance the computational efficiency of quantum simulations. The core mechanism centers around intelligently combining quantum algorithms for precise calculations with classical algorithms for data processing and control, optimizing the overall simulation process. We present a detailed algorithmic framework, outlining the key steps involved, and discuss the potential benefits, including increased accuracy, reduced computational cost, and improved scalability. This research addresses a critical bottleneck in quantum computing, offering a pathway towards more realistic simulations and accelerating the development of practical quantum applications.

•Sep 1, 2026•0 citations

On the physical limit of quantum computing

Yuri Ozhigov

Experimental attempts to implement quantum speedup of computations over the past 30 years have yielded a negative result, despite the absence of physical laws prohibiting such speedup. The article formulates the limitation of quantum formalism in the form of uncertainty "the complexity of the system - the accuracy of its description at the quantum level", and provides arguments in favor of its physical status. An experiment to determine this constant through Grover's algorithm is described. Rough estimates on the constant of this ratio are given, based on the possibility of applying the quantum theory to two processes: the emission of a photon by a Rubidium atom and the decay of an unstable isotope of Helium 6. This ratio explicitly prohibits the physical implementation of scalable fast quantum computations, but leaves the possibility of modeling the dynamics of real systems on a quantum computer, the only advantage of which is the use of quantum nonlocality.

arXiv:1902.05426•Feb 13, 2019•0 citations

Proposed Experiments to Test the Foundations of Quantum Computing

Alan M. Kadin, Steven B. Kaplan

Quantum computing promises computational performance that is exponentially faster than any conceivable classical computer. This is due to the theoretically expected scaling of N entangled qubits, with parallel evolution of 2^N quantum states. This is in sharp contrast to classical computing, where N bits may have 2^N classical states, but only one at a time. It is widely believed that quantum superposition and entanglement have been demonstrated in several experimental systems, and that practical quantum computing can be achieved once sufficiently long quantum relaxation times are obtained. On the contrary, we suggest that there may be serious problems with quantum computing on both the macroscopic and microscopic levels, and that the experiments thus far have not proven the existence of non-classical superposition states, which are necessary for the proper functioning of qubits. In order to investigate this further, we propose new experiments in three physical systems: electron spins, single photons, and superconducting loops. We further suggest that certain more limited classes of quantum computing, such as quantum annealing, do not require quantum entanglement, and can achieve significant performance enhancements even if universal quantum computing proves to be impossible.

•Jul 1, 2016•1 citation

Numerical characteristics of quantum computer simulation

Andrey Yu. Chernyavskiy, Kamil Khamitov, Alexey Teplov +2 more

The simulation of quantum circuits is significantly important for the implementation of quantum information technologies. The main difficulty of such modeling is the exponential growth of dimensionality, thus the usage of modern high-performance parallel computations is relevant. As it is well known, arbitrary quantum computation in circuit model can be done by only single- and two-qubit gates, and we analyze the computational structure and properties of the simulation of such gates. We investigate the fact that the unique properties of quantum nature lead to the computational properties of the considered algorithms: the quantum parallelism make the simulation of quantum gates highly parallel, and on the other hand, quantum entanglement leads to the problem of computational locality during simulation. We use the methodology of the AlgoWiki project (algowiki-project.org) to analyze the algorithm. This methodology consists of theoretical (sequential and parallel complexity, macro structure, and visual informational graph) and experimental (locality and memory access, scalability and more specific dynamic characteristics) parts. Experimental part was made by using the petascale Lomonosov supercomputer (Moscow State University, Russia). We show that the simulation of quantum gates is a good base for the research and testing of the development methods for data intense parallel software, and considered methodology of the analysis can be successfully used for the improvement of the algorithms in quantum information science.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Dec 30, 2016•0 citations

Physics of Computation

Wojciech H. Zurek

Results of Feynman and others have shown that the quantum formalism permits a closed, microscopic, and locally interacting system to perform deterministic serial computation. In this paper we show that this formalism can also describe deterministic parallel computation. Achieving full parallelism in more than one dimension remains an open problem.

CRC Press eBooks•Mar 8, 2018•0 citations
We consider quantum formalism limited by the classical simulating computer with the fixed memory. The memory is redistributed in the course of modeling by the variation of the set of classical states and the accuracy of the representation of amplitudes. This computational description completely preserves the conventional formalism and does not contradicts to experiments, but it makes impossible fast quantum algorithms. This description involves the slow down of quantum evolutions with the growth of the dimension of the minimal subspace containing entangled states, which arise in the evolution. This slow down is the single difference of the proposed formalism from the standard one; it is negligible for the systems from the usual experiments, including those in which many entangled particle participate, but grows rapidly in the attempt to realize the scalable quantum computations, which require the unlimited parallelism. The experimental verification of this version of quantum formalism is reduced to the fixation of this slow down. In all probability the memory of the abstract computer simulating quantum processes is limited by 10-20 qubits, so it iss possible to use the exiting computers for this aim.
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the analysis, and a simulation gives a "film" which visualizes many particle quantum dynamics and is demonstrated to a user of the model. Restrictions following from the algorithm theory are considered on a level of fundamental physical laws. Born rule for the calculation of quantum probability as well as the decoherence is derived from the existence of a nonzero minimal value of amplitude module - a grain of amplitude. The limitation on the classical computational resources gives the unified description of quantum dynamics that is not divided to the unitary dynamics and measurements and does not depend on the existence of observer. It is proposed the description of states based on the nesting of particles in each other that permits to account the effects of all levels in the same model. Algorithmic approach admits the possibility of refutation, because it forbids the creation of a scalable quantum computer that is allowed in the conventional quantum formalism.
Parallel Quantum Simulation is a rapidly evolving field within quantum computing, aiming to overcome the limitations of single-qubit or small-system simulations for complex quantum systems. This paper explores a novel hybrid quantum-classical algorithm designed to significantly enhance the computational efficiency of quantum simulations. The core mechanism centers around intelligently combining quantum algorithms for precise calculations with classical algorithms for data processing and control, optimizing the overall simulation process. We present a detailed algorithmic framework, outlining the key steps involved, and discuss the potential benefits, including increased accuracy, reduced computational cost, and improved scalability. This research addresses a critical bottleneck in quantum computing, offering a pathway towards more realistic simulations and accelerating the development of practical quantum applications.
Experimental attempts to implement quantum speedup of computations over the past 30 years have yielded a negative result, despite the absence of physical laws prohibiting such speedup. The article formulates the limitation of quantum formalism in the form of uncertainty "the complexity of the system - the accuracy of its description at the quantum level", and provides arguments in favor of its physical status. An experiment to determine this constant through Grover's algorithm is described. Rough estimates on the constant of this ratio are given, based on the possibility of applying the quantum theory to two processes: the emission of a photon by a Rubidium atom and the decay of an unstable isotope of Helium 6. This ratio explicitly prohibits the physical implementation of scalable fast quantum computations, but leaves the possibility of modeling the dynamics of real systems on a quantum computer, the only advantage of which is the use of quantum nonlocality.
Quantum computing promises computational performance that is exponentially faster than any conceivable classical computer. This is due to the theoretically expected scaling of N entangled qubits, with parallel evolution of 2^N quantum states. This is in sharp contrast to classical computing, where N bits may have 2^N classical states, but only one at a time. It is widely believed that quantum superposition and entanglement have been demonstrated in several experimental systems, and that practical quantum computing can be achieved once sufficiently long quantum relaxation times are obtained. On the contrary, we suggest that there may be serious problems with quantum computing on both the macroscopic and microscopic levels, and that the experiments thus far have not proven the existence of non-classical superposition states, which are necessary for the proper functioning of qubits. In order to investigate this further, we propose new experiments in three physical systems: electron spins, single photons, and superconducting loops. We further suggest that certain more limited classes of quantum computing, such as quantum annealing, do not require quantum entanglement, and can achieve significant performance enhancements even if universal quantum computing proves to be impossible.
The simulation of quantum circuits is significantly important for the implementation of quantum information technologies. The main difficulty of such modeling is the exponential growth of dimensionality, thus the usage of modern high-performance parallel computations is relevant. As it is well known, arbitrary quantum computation in circuit model can be done by only single- and two-qubit gates, and we analyze the computational structure and properties of the simulation of such gates. We investigate the fact that the unique properties of quantum nature lead to the computational properties of the considered algorithms: the quantum parallelism make the simulation of quantum gates highly parallel, and on the other hand, quantum entanglement leads to the problem of computational locality during simulation. We use the methodology of the AlgoWiki project (algowiki-project.org) to analyze the algorithm. This methodology consists of theoretical (sequential and parallel complexity, macro structure, and visual informational graph) and experimental (locality and memory access, scalability and more specific dynamic characteristics) parts. Experimental part was made by using the petascale Lomonosov supercomputer (Moscow State University, Russia). We show that the simulation of quantum gates is a good base for the research and testing of the development methods for data intense parallel software, and considered methodology of the analysis can be successfully used for the improvement of the algorithms in quantum information science.