Related papers: Likelihood Theory in a Quantum World: tests with Q…
This paper explores the problem of quantum measurement complexity. In computability theory, the complexity of a problem is determined by how long it takes an effective algorithm to solve it. This complexity may be compared to the difficulty…
Quantum machine learning models have the potential to offer speedups and better predictive accuracy compared to their classical counterparts. However, these quantum algorithms, like their classical counterparts, have been shown to also be…
We discuss counterintuitive aspects of probabilities for systems of identical particles obeying quantum statistics. Quantum coins and children (two level systems) and quantum dice (many level systems) are used as examples. It is emphasized…
In consistent history quantum theory, a description of the time development of a quantum system requires choosing a framework or consistent family, and then calculating probabilities for the different histories which it contains. It is…
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…
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…
We describe how one may go about performing quantum computation with arbitrary "quantum stuff", as long as it has some basic physical properties. Imagine a long strip of stuff, equipped with regularly spaced wires to provide input settings…
In quantum logic, i.e., within the structure of the Hilbert lattice imposed on all closed linear subspaces of a Hilbert space, the assignment of truth values to quantum propositions (i.e., experimentally verifiable propositions relating to…
We investigate sampling procedures that certify that an arbitrary quantum state on $n$ subsystems is close to an ideal mixed state $\varphi^{\otimes n}$ for a given reference state $\varphi$, up to errors on a few positions. This task makes…
The histories-based framework of Quantum Measure Theory assigns a generalized probability or measure $\mu(E)$ to every (suitably regular) set $E$ of histories. Even though $\mu(E)$ cannot in general be interpreted as the expectation value…
We investigate the internal logic of a quantum computer with two qubits, in the two particular cases of non-entanglement (separable states) and maximal entanglement (Bell's states). To this aim, we consider an internal (reversible)…
The task of testing whether quantum theory applies to all physical systems and all scales requires considering situations where a quantum probe interacts with another system that need not obey quantum theory in full. Important examples…
Quantum Computing and especially Quantum Machine Learning, in a short period of time, has gained a lot of interest through research groups around the world. This can be seen in the increasing number of proposed models for pattern…
Ultimately, any explanation of quantum measurement must be extendable to relativistic quantum mechanics (RQM), since many precisely confirmed experimental results follow from quantum field theory (QFT), which is based on RQM. Certainly, the…
It is first pointed out that there is a common mathematical model for the universe and the quantum computer. The former is called the histories approach to quantum mechanics and the latter is called measurement based quantum computation.…
A proof of quantumness is a protocol through which a classical machine can test whether a purportedly quantum device, with comparable time and memory resources, is performing a computation that is impossible for classical computers.…
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify the quantum advantage of an untrusted prover. That is, a quantum prover can correctly answer the verifier's challenges and…
Quantum computers are the promising candidates for simulation of large quantum systems, which is a daunting task to perform in a classical computer. Here, we report the experimental realization of quantum tunneling of a single particle…
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In…
Coherently manipulating multipartite quantum correlations leads to remarkable advantages in quantum information processing. A fundamental question is whether such quantum advantages persist only by exploiting multipartite correlations, such…