Related papers: Redheffer: Trig to Quantum Error Bounds
Afshar et al. claim that their experiment shows a violation of the complementarity inequality. In this work, we study their claim using a modified Mach-Zehnder setup that represents a simpler version of the Afshar experiment. We find that…
Entanglement of a quantum system depends upon relative phase in complicated ways, which no single measurement can reflect. Because of this, entanglement witnesses are necessarily limited in applicability and/or utility. We propose here a…
We report a theoretical and experimental study on the role of indistinguishability in the estimation of an interferometric phase. In particular, we show that the quantum Fisher information, which limits the maximum precision achievable in…
Simulating quantum dynamics beyond the reach of classical computers is one of the main envisioned applications of quantum computers. The most promising quantum algorithms to this end in the near-term are the simplest, which use the Trotter…
Many current quantum error-correcting codes that achieve full fault tolerance suffer from having low ratios of logical to physical qubits and significant overhead. This makes them difficult to implement on current noisy intermediate-scale…
We discuss the Lieb-Thirring inequality for periodic systems, which has the same optimal constant as the original inequality for finite systems. This allows us to formulate a new conjecture about the value of its best constant. To…
In this article, we study a double-phase variable-exponent Kirchhoff problem and show the existence of at least three solutions. The proposed model, as a generalization of the Kirchhoff equation, is interesting since it is driven by a…
R. Redheffer described an $n\times n$ matrix of 0's and 1's the size of whose determinant is connected to the Riemann Hypothesis. We describe the permutations that contribute to its determinant and evaluate its permanent in terms of integer…
Quantum error correction allows for faulty quantum systems to behave in an effectively error free manner. One important class of techniques for quantum error correction is the class of quantum subsystem codes, which are relevant both to…
We introduce the Real Quantum Amplitude Estimation (RQAE) algorithm, an extension of Quantum Amplitude Estimation (QAE) which is sensitive to the sign of the amplitude. RQAE is an iterative algorithm which offers explicit control over the…
The quantum multiparameter estimation is very different from the classical multiparameter estimation due to Heisenberg's uncertainty principle in quantum mechanics. When the optimal measurements for different parameters are incompatible,…
We present a general and user-extensible equality checking algorithm that is applicable to a large class of type theories. The algorithm has a type-directed phase for applying extensionality rules and a normalization phase based on…
The study of new error correcting codes has raised attention in the last years, especially because of their use in cryptosystems that are resistant to attacks running on quantum computers. In 2006, while leaving a more in-depth analysis for…
Quantum phase estimation is an important component in diverse quantum algorithms. However, it suffers from spectral leakage, when the reciprocal of the record length is not an integer multiple of the unknown phase, which incurs an accuracy…
Quantum decoherence is the effect that bridges quantum physics to well-understood classical physics. As such, it plays a crucial role in understanding the mysterious nature of quantum physics. Quantum decoherence is also a source of quantum…
A set of quantum error correcting codes based on classical Reed-Muller codes is described. The codes have parameters [[n,k,d]] = [[2^r, 2^r - C(r,t) - 2 sum_{i=0}^{t-1} C(r,i), 2^t + 2^{t-1} ]].
Many quantum technologies are now reaching a high level of maturity and control, and it is likely that the first demonstrations of suppression of naturally occurring quantum noise using small topological error correcting codes will soon be…
The general-purpose interactive theorem-proving assistant called Prove-It was used to verify the Quantum Phase Estimation (QPE) algorithm, specifically claims about its outcome probabilities. Prove-It is unique in its ability to express…
Algorithms based on multiple decoding attempts of Reed-Solomon (RS) codes have recently attracted new attention. Choosing decoding candidates based on rate-distortion (R-D) theory, as proposed previously by the authors, currently provides…
We prove a quantitative Faber-Krahn inequality for the first eigenvalue of the Laplace operator with Robin boundary conditions. The asymmetry term involves the square power of the Fraenkel asymmetry, multiplied by a constant depending on…