Related papers: The ZX-calculus is incomplete for quantum mechanic…
This work describes an error in the uncertainty assessment of uncertainties of the Total-Reflection X-ray Fluorescence technique Ref [1]. A confusion, between the precision and accuracy of a measurement produced an incomplete evaluation of…
Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with one-sided error, has been an open problem for years. This note helps to explain why the problem is difficult, by using ideas from real analysis to give a "quantum…
The concept of QCD sum rules is extended to bound states composed of particles with finite mass such as scalar quarks or strange quarks. It turns out that mass corrections become important in this context. The number of relevant corrections…
Several researchers, including Leonid Levin, Gerard 't Hooft, and Stephen Wolfram, have argued that quantum mechanics will break down before the factoring of large numbers becomes possible. If this is true, then there should be a natural…
Relational Quantum Mechanics (RQM) claims to be an interpretation of quantum theory [see arXiv:2109.09170, which appears in the Oxford Handbook of the History of Interpretation of Quantum Physics]. However, there are significant departures…
Wave--particle duality is a cornerstone of quantum mechanics, traditionally formulated under definite causal order. We investigate how complementarity is modified when the temporal order of operations is coherently superposed, as in the…
Chromatic quantum contextuality is a criterion of quantum nonclassicality based on (hyper)graph coloring constraints. If a quantum hypergraph requires more colors than the number of outcomes per maximal observable (context), it lacks a…
In this contribution, I'll discuss two classes of effects--additional sources of CP violation and PQ breaking--that offer a slightly different take on axion physics. Both are tied to the idea that the axion solution to the strong CP problem…
The Einstein-Podolsky-Rosen argument on quantum mechanics incompleteness is formulated in terms of elements of reality inferred from joint (as opposed to alternative) measurements, in two examples involving entangled states of three…
Quantum mechanics led to spectacular technological developments, discovery of new constituents of matter and new materials. However there is still no consensus on its interpretation and limitations. Some scientists and scientific writers…
There are inherent limits in classical computation for it to serve as an adequate model of human cognition. In particular, non-commutativity, while ubiquitous in physics and psychology, cannot be sufficiently handled. We propose that we…
"Ever since the advent of modern quantum mechanics in the late 1920's, the idea has been prevalent that the classical laws of probability cease, in some sense, to be valid in the new theory. [...] The primary object of this presentation is…
We present an alternative proof of the NEXP-hardness of the satisfiability of {\em Dependency Quantified Boolean Formulas} (DQBF). Besides being simple, our proof also gives us a general method to reduce NEXP-complete problems to DQBF. We…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…
Continuous-variable (CV) quantum information processing is a promising candidate for large-scale fault-tolerant quantum computation. However, analysis of CV quantum process relies mostly on direct computation of the evolution of operators…
The treatment proposed by Sacchi quant-ph/0009104 does not represent correct solution, since the necessary conditions on CP maps are not guaranteed.
This comment on the recently published article "Why Einstein, Podolsky and Rosen did not prove that quantum mechanics is 'incomplete'" (arXiv:0805.0217) by J.H.Field shows that some conclusions, made in the referred-to article, result from…
We introduce a ZX-like diagrammatic language devoted to manipulating real matrices - and rebits -, with its own set of axioms. We prove the necessity of some non trivial axioms of these. We show that some restriction of the language is…
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…
Quantum Computing has been presenting major developments in the last few years, unveiling systems with a increasing number of qubits. However, unreliable quantum processes in universal quantum computers still represent one of the the…