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:quant-ph/0301161

An Algorithm of a Virtual Quantum Computer Model on a Classical Computer

T. F. Kamalov, Yu. P. Rybakov

Published Jan 29, 2003• 0 citations
arXivHTMLPDF

Abstract

Construction of virtual quantum states became possible due to the hypothesis on the nature of quantum states quant-ph/0212139. This study considers a stochastic geometrical background (stochastic gravitational background) generating correlation (or, coherency) of various quantum non-interacting objects. In the quantum state virtual model, a simple method of generating of two (or more) dichotomic signals with controlled mutual correlation factor from a single continuous stochastic process is implemented. Basing on the system random number generator of the computer, a model of the stationary random phase (with the nature of random geometrical background).

DOI
10.48550/arxiv.quant-ph/0301161

Related papers

Classical Stochasticity Using Quantum Computers

Diego Campos, Narasimha Reddy Gosala, Arundhati Dasgupta

We suggest that quantum algorithms can be used to model classical stochastic simulations as the measurement process is inherently random. To illustrate, we solve the classical Lorenz system with stochastic behavior using a Python random number generator. We compare the classical stochasticity of the Lorenz system with the measured output of the system obtained using quantum algorithms.

quant-pharXiv:2606.09384•Jun 9, 2026•0 citations

Models of Quantum Computers and Decoherence Problem

I. V. Volovich

Mathematical models of quantum computers such as a multidimensional quantum Turing machine and quantum circuits are described and its relations with lattice spin models are discussed. One of the main open problems one has to solve if one wants to build a quantum computer is the decoherence due to the coupling with the environment. We propose a possible solution of this problem by using a control of parameters of the system. This proposal is based on the analysis of the spin-boson Hamiltonian performed in the stochastic limit approximation.

arXiv:quant-ph/9902055•Feb 15, 1999•6 citations

Large fan-out single-flux-quantum stochastic number splitter utilizing frequency-synchronized superconductor random number generators

Kaito Asaka, Nobuyuki Yoshikawa, Yuki Yamanashi

Abstract Stochastic computing (SC) is a form of probabilistic computation that encodes information in the probability of a ‘1’ occurring within a finite-length binary sequence. SC has been investigated for applications in various fields that do not require deterministic and precise computation. A superconducting single-flux-quantum (SFQ) circuit is considered a promising candidate for implementing SC hardware due to its high-speed operation and probabilistic behavior. In this study, we propose a novel large fan-out signal splitter to enable large-scale SFQ-based stochastic arithmetic circuits, addressing the issue of computation accuracy degradation caused by correlations between binary sequences. The proposed signal splitter generates uncorrelated output binary sequences by utilizing superconductor random number generators frequency-synchronized to the input binary sequence. The fan-out can be easily increased by simply adding more superconductor random number generators. We implemented a four-output stochastic number signal splitter using the 10 kA cm−2 Nb four-layer superconducting circuit fabrication process. Its operation was successfully demonstrated by measuring the average voltage at the input and outputs under continuous high-speed binary sequence input. High-speed operation up to 33.2 GHz was confirmed. The proposed signal splitter uniquely leverages the properties of superconducting circuits, where flux quanta determined by fundamental physical constants serve as the information carrier. We believe this development will significantly advance the realization of practical SFQ-based SC systems.

Superconductor Science and Technology•Mar 10, 2025•4 citations

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

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.

•Jan 1, 2011•0 citations

Non-Abelian symmetries of stochastic processes: Derivation of correlation functions for random-vertex models and disordered-interacting-particle systems

Gunter Markus Schutz, Sven Sandow

We consider systems of particles hopping stochastically on d-dimensional lattices with space-dependent probabilities. We map the master equation onto an evolution equation in a Fock space where the dynamics are given by a quantum Hamiltonian (continuous time) or a transfer matrix (discrete time). Using non-Abelian symmetries of these operators we derive duality relations, expressing the time evolution of a given initial configuration in terms of correlation functions of simpler dual processes. Particularly simple results are obtained for the time evolution of the density profile. As a special case we show that for any SU(2) symmetric system the two-point and three-point density correlation functions in the N-particle steady state can be computed from the probability distribution of a single particle moving in the same environment. We apply our results to various models, among them partial exclusion, a simple diffusion-reaction system, and the two-dimensional six-vertex model with space-dependent vertex weights. For a random distribution of the vertex weights one obtains a version of the random-barrier model describing diffusion of particles in disordered media. We derive exact expressions for the averaged two-point density correlation functions in the presence of weak, correlated disorder.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Apr 1, 1994•149 citations

Simulating quantum mechanics on a quantum computer

Bruce M. Boghosian, Washington Taylor

Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrödinger equation for interacting many-body systems are presented in some detail. These algorithms would make it possible to simulate nonrelativistic quantum systems on a quantum computer with an exponential speedup compared to simulations on classical computers. Issues involved in simulating relativistic systems of Dirac or gauge particles are discussed.

arXiv:quant-ph/9701019•Physica D Nonlinear Phenomena•Sep 1, 1998•171 citations
Construction of virtual quantum states became possible due to the hypothesis on the nature of quantum states quant-ph/0212139. This study considers a stochastic geometrical background (stochastic gravitational background) generating correlation (or, coherency) of various quantum non-interacting objects. In the quantum state virtual model, a simple method of generating of two (or more) dichotomic signals with controlled mutual correlation factor from a single continuous stochastic process is implemented. Basing on the system random number generator of the computer, a model of the stationary random phase (with the nature of random geometrical background).
Mathematical models of quantum computers such as a multidimensional quantum Turing machine and quantum circuits are described and its relations with lattice spin models are discussed. One of the main open problems one has to solve if one wants to build a quantum computer is the decoherence due to the coupling with the environment. We propose a possible solution of this problem by using a control of parameters of the system. This proposal is based on the analysis of the spin-boson Hamiltonian performed in the stochastic limit approximation.
Abstract Stochastic computing (SC) is a form of probabilistic computation that encodes information in the probability of a ‘1’ occurring within a finite-length binary sequence. SC has been investigated for applications in various fields that do not require deterministic and precise computation. A superconducting single-flux-quantum (SFQ) circuit is considered a promising candidate for implementing SC hardware due to its high-speed operation and probabilistic behavior. In this study, we propose a novel large fan-out signal splitter to enable large-scale SFQ-based stochastic arithmetic circuits, addressing the issue of computation accuracy degradation caused by correlations between binary sequences. The proposed signal splitter generates uncorrelated output binary sequences by utilizing superconductor random number generators frequency-synchronized to the input binary sequence. The fan-out can be easily increased by simply adding more superconductor random number generators. We implemented a four-output stochastic number signal splitter using the 10 kA cm−2 Nb four-layer superconducting circuit fabrication process. Its operation was successfully demonstrated by measuring the average voltage at the input and outputs under continuous high-speed binary sequence input. High-speed operation up to 33.2 GHz was confirmed. The proposed signal splitter uniquely leverages the properties of superconducting circuits, where flux quanta determined by fundamental physical constants serve as the information carrier. We believe this development will significantly advance the realization of practical SFQ-based SC systems.
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.
We consider systems of particles hopping stochastically on d-dimensional lattices with space-dependent probabilities. We map the master equation onto an evolution equation in a Fock space where the dynamics are given by a quantum Hamiltonian (continuous time) or a transfer matrix (discrete time). Using non-Abelian symmetries of these operators we derive duality relations, expressing the time evolution of a given initial configuration in terms of correlation functions of simpler dual processes. Particularly simple results are obtained for the time evolution of the density profile. As a special case we show that for any SU(2) symmetric system the two-point and three-point density correlation functions in the N-particle steady state can be computed from the probability distribution of a single particle moving in the same environment. We apply our results to various models, among them partial exclusion, a simple diffusion-reaction system, and the two-dimensional six-vertex model with space-dependent vertex weights. For a random distribution of the vertex weights one obtains a version of the random-barrier model describing diffusion of particles in disordered media. We derive exact expressions for the averaged two-point density correlation functions in the presence of weak, correlated disorder.
Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrödinger equation for interacting many-body systems are presented in some detail. These algorithms would make it possible to simulate nonrelativistic quantum systems on a quantum computer with an exponential speedup compared to simulations on classical computers. Issues involved in simulating relativistic systems of Dirac or gauge particles are discussed.