Related papers: Conjecture C Still Stands
The quantum computer is supposed to process information by applying unitary transformations to the complex amplitudes defining the state of N qubits. A useful machine needing N=1000 or more, the number of continuous parameters describing…
Baumgratz, Cramer and Plenio established a rigorous framework (BCP framework) for quantifying the coherence of quantum states [\href{http://dx.doi.org/10.1103/PhysRevLett.113.140401}{Phys. Rev. Lett. 113, 140401 (2014)}]. In BCP framework,…
An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is…
The CQC conjecture by Schneeloch et al. (Physical Review A 90.6, 2014) asserts that the sum of classical mutual information between two parties obtained by measuring individual systems in two mutually unbiased bases cannot exceed their…
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,…
We provide two simple counterexamples to Kalai's Conjecture C and discuss our perspective on the implications for the prospect of large-scale fault-tolerant quantum computation.
A conjecture of Hopkins (2018) posits that for certain high-dimensional hypothesis testing problems, no polynomial-time algorithm can outperform so-called "simple statistics", which are low-degree polynomials in the data. This conjecture…
This is a brief review of the experimental and theoretical quantum computing. The hopes for eventually building a useful quantum computer rely entirely on the so-called "threshold theorem". In turn, this theorem is based on a number of…
Suppose N parties describe the state of a quantum system by N possibly different density operators. These N state assignments represent the beliefs of the parties about the system. We examine conditions for determining whether the N state…
We propose an extended quantum theory, in which the number K of parameters necessary to characterize a quantum state behaves as fourth power of the number N of distinguishable states. As the simplex of classical N-point probability…
As one of the most intriguing intrinsic properties of quantum world, quantum superposition provokes great interests in its own generation. Oszmaniec [Phys. Rev. Lett. 116, 110403 (2016)] have proven that though a universal quantum machine…
The superposition principle is fundamental to quantum theory. Yet a recent no-go theorem has proved that quantum theory forbids superposition of unknown quantum states, even with nonzero probability. The implications of this result,…
Suppose we have many copies of an unknown $n$-qubit state $\rho$. We measure some copies of $\rho$ using a known two-outcome measurement $E_{1}$, then other copies using a measurement $E_{2}$, and so on. At each stage $t$, we generate a…
General wisdom tells us that if two quantum states are ``macroscopically distinguishable'' then their superposition should be hard to observe. We make this intuition precise and general by quantifying the difficulty to observe the quantum…
The Quantum Computer Condition (QCC) provides a rigorous and completely general framework for carrying out analyses of questions pertaining to fault-tolerance in quantum computers. In this paper we apply the QCC to the problem of…
For any unitarily invariant convex function F on the states of a composite quantum system which isolates the trace there is a critical constant C such that F(w)<= C for a state w implies that w is not entangled; and for any possible D > C…
We extend quantum Stein's lemma in asymmetric quantum hypothesis testing to composite null and alternative hypotheses. As our main result, we show that the asymptotic error exponent for testing convex combinations of quantum states…
In this work, we reveal a new type of impossibility discovered in our recent research which forbids comparing the closeness of multiple unknown quantum states with any non-trivial threshold in a perfect or an unambiguous way. This…
The state $\rho$ of a quantum system can be represented by a vector $\mathbf{P}_{\mathcal{M}}(\rho)$ of outcome probabilities for a set of measurements $\mathcal{M}$. Such representations appear throughout physics, for example, in quantum…
Quantum probabilities differ from classical ones in many ways, e.g., by violating the well-known Bell and CHSH inequalities or another simple inequality due to R. Wright. The latter one has recently regained attention because of its…