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

Fault-tolerant schemes can use error correction to make a quantum computation arbitrarily ac- curate, provided that errors per physical component are smaller than a certain threshold and in- dependent of the computer size. However in…

The main distinction between classical mechanics and quantum mechanics is the lack in the latter of a full mechanical determinism: different final states can arise from the same physical state, after the measurement. No hidden variable is…

The search problem is to find a state satisfying certain properties out of a given set. Grover's algorithm drives a quantum computer from a prepared initial state to the target state and solves the problem quadratically faster than a…

Quantum metrology aims to exploit many-body quantum states to achieve parameter-estimation precision beyond the standard quantum limit. For unitary parameter encoding generated by local Hamiltonians, such enhancement is characterized by…

Recently, some attention has been paid to falsifying the Leggett model, in which global probabilities characterizing a quantum state are represented by a combination of factorisable distributions. This idea was even verified in experiments,…

Experimental progress with meso- and macroscopic quantum states (i.e., general Schrodinger-cat states) was recently accompanied by theoretical proposals on how to measure the merit of these efforts. So far, experiment and theory were…

We add non-linear and state-dependent terms to quantum field theory. We show that the resulting low-energy theory, non-linear quantum mechanics, is causal, preserves probability and permits a consistent description of the process of…

Quantum state smoothing is a technique for estimating the quantum state of a partially observed quantum system at time $\tau$, conditioned on an entire observed measurement record (both before and after $\tau$). However, this smoothing…

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…

In a recent paper ([quant-ph/9610040]), Shor and Laflamme define two ``weight enumerators'' for quantum error correcting codes, connected by a MacWilliams transform, and use them to give a linear-programming bound for quantum codes. We…

One of the most important problems in Physics is how to reconcile Quantum Mechanics with General Relativity. Some authors have suggested that this may be realized at the expense of having to drop the quantum formalism in favor of a more…

Stabiliser states play a central role in the theory of quantum computation. For example, they are used to encode computational basis states in the most common quantum error correction schemes. Arbitrary quantum states admit many stabiliser…

Motivated in part by John Wheeler's assertion that the continuum nature of Hilbert Space conceals the `it-from-bit' information-theoretic character of the quantum wavefunction, a theory of quantum physics (Rational Quantum Mechanics - RaQM)…

Significant advances in the development of computing devices based on quantum effects and the demonstration of their use to solve various problems have rekindled interest in the nature of the "quantum computational advantage." Although…

Shor's factoring algorithm (SFA), by its ability to efficiently factor large numbers, has the potential to undermine contemporary encryption. At its heart is a process called order finding, which quantum mechanics lets us perform…

The advent of quantum computing has challenged classical conceptions of which problems are efficiently solvable in our physical world. This motivates the general study of how physical principles bound computational power. In this paper we…

Recent breakthroughs in quantum query complexity have shown that any formula of size n can be evaluated with O(sqrt(n)log(n)/log log(n)) many quantum queries in the bounded-error setting [FGG08, ACRSZ07, RS08b, Rei09]. In particular, this…

Solving the discrete logarithm problem (DLP) with quantum computers is a fundamental task with important implications. Beyond Shor's algorithm, many researchers have proposed alternative solutions in recent years. However, due to current…

A quantum processor (QuP) can be used to exploit quantum mechanics to find the prime factors of composite numbers[1]. Compiled versions of Shor's algorithm have been demonstrated on ensemble quantum systems[2] and photonic systems[3-5],…

We settle the so-called degree conjecture for the separability of multipartite quantum states, which are normalized graph Laplacians, first given by Braunstein {\it et al.} [Phys. Rev. A \textbf{73}, 012320 (2006)]. The conjecture states…