相关论文: Multilinear Formulas and Skepticism of Quantum Com…

Quantum mechanics marks a radical departure from the classical understanding of Nature, fostering an inherent randomness which forbids a deterministic description; yet the most fundamental departure arises from something different. As shown…

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.…

Due to the inevitable existence of quantum effects, a classical description generically breaks down after a finite quantum break-time $t_q$. We aim to find criteria for determining $t_q$. To this end, we construct a new prototype model that…

We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm. Thus we extend famous Shor's results. Our method is based on a procedure for measuring an eigenvalue of a…

A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variables and the initial state is defined by a multivariate…

A large spectrum of problems in classical physics and engineering, such as turbulence, is governed by nonlinear differential equations, which typically require high-performance computing to be solved. Over the past decade, however, the…

The number of steps any classical computer requires in order to find the prime factors of an $l$-digit integer $N$ increases exponentially with $l$, at least using algorithms known at present. Factoring large integers is therefore…

Several arguments demonstrate the incompatibility between Quantum Mechanics and classical Physics. Bell's inequalities and Greenberger-Horne-Zeilinger (GHZ) arguments apply to specific non-classical states. The Kochen-Specker (KS) one,…

Modifications of quantum mechanics are considered, in which the state vector of any system, large or small, undergoes a stochastic evolution. The general class of theories is described, in which the probability distribution of the state…

A central problem in quantum information is to determine the minimal physical resources that are required for quantum computational speedup and, in particular, for fault-tolerant quantum computation. We establish a remarkable connection…

In standard quantum mechanics, complex numbers are used to describe the wavefunction. Although complex numbers have proven sufficient to predict the results of existing experiments, there is no apparent theoretical reason to choose them…

Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms…

Quantum computing comes with the potential to push computational boundaries in various domains including, e.g., cryptography, simulation, optimization, and machine learning. Exploiting the principles of quantum mechanics, new algorithms can…

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…

There are fundamental reasons as to why there should exist a reformulation of quantum mechanics which does not refer to a classical spacetime manifold. It follows as a consequence that quantum mechanics as we know it is a limiting case of a…

Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central problem solved by Shor's factoring algorithm. We suggest an…

Shor's factorisation algorithm is a combination of classical pre- and post-processing and a quantum period finding (QPF) subroutine which allows an exponential speed up over classical factoring algorithms. We consider the stability of this…

Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by being based on two…

Nonlinear modifications of quantum mechanics have a troubled history. They were initially studied for many promising reasons: resolving the measurement problem, testing the limits of standard quantum mechanics, and reconciling it with…

We review canonical experiments on systems that have pushed the boundary between the quantum and classical worlds towards much larger scales, and discuss their unique features that enable quantum coherence to survive. Because the types of…