相关论文: The Influence of Superpositional Wave Function Osc…
Entanglement has been termed a critical resource for quantum information processing and is thought to be the reason that certain quantum algorithms, such as Shor's factoring algorithm, can achieve exponentially better performance than their…
A parametrically modulated oscillator has two opposite-phase vibrational states at half the modulation frequency. An extra force at the vibration frequency breaks the symmetry of the states. The effect can be extremely strong due to the…
Shor's algorithm (SA) is a quantum algorithm for factoring integers. Since SA has polynomial complexity while the best classical factoring algorithms are sub-exponential, SA is cited as evidence that quantum computers are more powerful than…
Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for…
The method of noisy multiqubit quantum circuits modeling is proposed. The analytical formulas for the dependence of quantum algorithms accuracy on qubits count and noise level are obtained for Grover algorithm and quantum Fourier transform.…
Integer factorization has been one of the cornerstone applications of the field of quantum computing since the discovery of an efficient algorithm for factoring by Peter Shor. Unfortunately, factoring via Shor's algorithm is well beyond the…
This paper aims at developing new shape functions adapted to smooth vanishing coefficients for scalar wave equation. It proposes the numerical analysis of their interpolation properties. The interpolation is local but high order convergence…
We demonstrate that, in the case of Shor's algorithm for factoring, highly mixed states will allow efficient quantum computation, indeed factorization can be achieved efficiently with just one initial pure qubit and a supply of initally…
In a quantum computer any superposition of inputs evolves unitarily into the corresponding superposition of outputs. It has been recently demonstrated that such computers can dramatically speed up the task of finding factors of large…
We present a new interpretation of the terms superposition, entanglement, and measurement that appear in quantum mechanics. We hypothesize that the structure of the wave function for a quantum system at the sub-Planck scale has a…
Understanding the interplay between quantum mechanical systems and gravity is a crucial step towards unifying these two fundamental ideas. Recent theoretical developments have explored how global properties of spacetime would cause a…
We formulate and numerically simulate the single control qubit Shor algorithm for the case of static imperfections induced by residual couplings between qubits. This allows us to study the accuracy of Shor's algorithm with respect to these…
For many implementations of quantum computing, 1/f and other types of broad-spectrum noise are an important source of decoherence. An important step forward would be the ability to back out the characteristics of this noise from qubit…
An experiment is presented in which the alleged progression of a photon's wave function is ``measured'' by a row of superposed atoms. The photon's wave function affects only one out of the atoms, regardless of its position within the row,…
With the advancement of quantum technologies, there is a potential threat to traditional encryption systems based on integer factorization. Therefore, developing techniques for accurately measuring the performance of associated quantum…
Quantum experiments with nanomechanical oscillators are regarded as a testbed for hypothetical modifications of the Schr\"{o}dinger equation, which predict a breakdown of the superposition principle and induce classical behavior at the…
Quantum computers exhibit an inherent randomness, so it seems natural to consider them for procedural content generation. In this work, a quantum version of the famous (classical) wave function collapse algorithm is proposed. This quantum…
Super-oscillation is a counter-intuitive phenomenon describing localized fast variations of functions and fields that happen at frequencies higher than the highest Fourier component of their spectra. The physical implications of the effect…
In the variational approach to quantum statistics, a smearing formula describes efficiently the consequences of quantum fluctuations upon an interaction potential. The result is an effective classical potential from which the partition…
Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same…