Related papers: Polynomial Simulations of Decohered Quantum Comput…
Using a numerical simulation of the evolution of a qubit interacting with the environment we show that quantum error detection and correction can work effectively even when the recovery procedure introduces errors.
We present an original model of paraconsistent Turing machines (PTMs), a generalization of the classical Turing machines model of computation using a paraconsistent logic. Next, we briefl y describe the standard models of quantum…
We consider whether quantum coherence in the form of mutual entanglement between a pair of qubits is susceptible to decay that may be more rapid than the decay of the coherence of either qubit individually. An instance of potential…
While it seems possible that quantum computers may allow for algorithms offering a computational speed-up over classical algorithms for some problems, the issue is poorly understood. We explore this computational speed-up by investigating…
Advancing quantum technologies necessitates an in-depth exploration of how operations generate quantum resources and respond to noise. Crucial are gates generating quantum coherence and the challenge of mitigating gate dephasing noise.…
The scaling of decoherence rates with the number of q-bits is studied for a simple quantum computer model. Two state q-bits are localised around well-separated positions via trapping potentials, but vibrational motion of q-bits centre of…
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…
Quantum computing has the potential to revolutionize multiple fields by solving complex problems that can not be solved in reasonable time with current classical computers. Nevertheless, the development of quantum computers is still in its…
Quantum noise or decoherence is a major factor impacting the performance of quantum technologies. On the qubit, an important quantum noise, often relevant in practice, is the thermal noise or generalized amplitude damping noise, describing…
Liquid-state NMR quantum computer has demonstrated the possibility of quantum computation and supported its development. Using NMR quantum computer techniques, we observed phase decoherence under two kinds of artificial noise fields; one a…
The simulation of large-scale classical systems in exponentially small space on quantum computers has gained attention. The prior work demonstrated that a quantum algorithm offers an exponential speedup over any classical algorithm in…
The Kernel Polynomial Method (KPM) is one of the fast diagonalization methods used for simulations of quantum systems in research fields of condensed matter physics and chemistry. The algorithm has a difficulty to be parallelized on a…
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…
Quantum computing's potential is immense, promising super-polynomial reductions in execution time, energy use, and memory requirements compared to classical computers. This technology has the power to revolutionize scientific applications…
The results of quantum process tomography on a three-qubit nuclear magnetic resonance quantum information processor are presented, and shown to be consistent with a detailed model of the system-plus-apparatus used for the experiments. The…
Richard Feynman's observation that quantum mechanical effects could not be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used quantum effects. This speculation…
Noisy, intermediate-scale quantum computers come with intrinsic limitations in terms of the number of qubits (circuit "width") and decoherence time (circuit "depth") they can have. Here, for the first time, we demonstrate a recently…
It is known that a quantum system with finite degrees of freedom can simulate a composite of a system and an environment if the state of the hypothetical environment is randomized by external manipulation. We show theoretically that any…
We show that the time evolution of the wave function of a quantum mechanical many particle system can be implemented very efficiently on a quantum computer. The computational cost of such a simulation is comparable to the cost of a…
Using the methods of quantum trajectories we investigate the effects of dissipative decoherence in a quantum computer algorithm simulating dynamics in various regimes of quantum chaos including dynamical localization, quantum ergodic regime…