Related papers: Quantum Algorithm Uncertainty Principles
The uncertainty principle lies at the heart of quantum physics, and is widely thought of as a fundamental limit on the measurement precisions of incompatible observables. Here we show that the traditional uncertainty relation in fact…
The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…
Basic concepts of quantum theory of information, principles of quantum calculations and the possibility of creation on this basis unique on calculation power and functioning principle device, named quantum computer, are briefly reviewed.…
The quantum algorithms of Deutsch, Simon and Shor are described in a way which highlights their dependence on the Fourier transform. The general construction of the Fourier transform on an Abelian group is outlined and this provides a…
This paper deduces universal uncertainty principle in different quantum theories after about one century of proposing uncertainty principle by Heisenberg, i.e., new universal uncertainty principle of any orders of physical quantities in…
The so-called "threshold" theorem says that, once the error rate per qubit per gate is below a certain value, indefinitely long quantum computation becomes feasible, even if all of the qubits involved are subject to relaxation processes,…
Quantum computers are able to outperform classical algorithms. This was long recognized by the visionary Richard Feynman who pointed out in the 1980s that quantum mechanical problems were better solved with quantum machines. It was only in…
As various quantum computing technologies continue to compete for quantum supremacy, several parameters have emerged as benchmarks for the quality of qubits. These include fidelity, coherence times, connectivity, and a few others. In this…
The aim of this paper is to prove new uncertainty principles for an integral operator $\tt$ with a bounded kernel for which there is a Plancherel theorem. The first of these results is an extension of Faris's local uncertainty principle…
The quantum computer algorithm by Peter Shor for factorization of integers is studied. The quantum nature of a QC makes its outcome random. The output probability distribution is investigated and the chances of a successful operation is…
In this article we examine a Generalized Uncertainty Principle which differs from the Heisenberg Uncertainty Principle by terms linear and quadratic in particle momenta, as proposed by the authors in an earlier paper. We show that this…
Is there any hope for quantum computing to challenge the Turing barrier, i.e. to solve an undecidable problem, to compute an uncomputable function? According to Feynman's '82 argument, the answer is {\it negative}. This paper re-opens the…
The quantum multiparameter estimation is very different from the classical multiparameter estimation due to Heisenberg's uncertainty principle in quantum mechanics. When the optimal measurements for different parameters are incompatible,…
The Heisenberg uncertainty principle is one of the most famous features of quantum mechanics. However, the non-determinism implied by the Heisenberg uncertainty principle --- together with other prominent aspects of quantum mechanics such…
The construction of large, coherent quantum systems necessary for quantum computation remains an entreating but elusive goal, due to the ubiquitous nature of decoherence. Recent progress in quantum error correction schemes have given new…
Around the turn of the century, Shor formulated his well-known and still-open conjecture stating that the accessible information of any quantum dichotomy, that is the maximum amount of classical information that can be decoded from a binary…
Quantum coherence constitutes a fundamental physical mechanism essential to the study of quantum algorithms. We study the coherence and decoherence in generalized Shor's algorithm where the register $A$ is initialized in arbitrary pure…
Amongst the most remarkable successes of quantum computation are Shor's efficient quantum algorithms for the computational tasks of integer factorisation and the evaluation of discrete logarithms. In this article we review the essential…
To more flexibly balance between exploration and exploitation, a new meta-heuristic method based on Uncertainty Principle concepts is proposed in this paper. UP is is proved effective in multiple branches of science. In the branch of…
Heisenberg's uncertainty principle, exemplified by the gamma ray thought experiment, suggests that any finite precision measurement disturbs any observables noncommuting with the measured observable. Here, it is shown that this statement…