Related papers: The ZX-calculus is incomplete for quantum mechanic…
Two additional reasons are suggested for the seeming lack of progress in producing quantum algorithms.
In a recent paper, Wang. et al. (2009) claim that Tsallis' nonadditivity of q-nonextensive statistical mechanics (Gell-Mann and Tsallis 2004, Tsallis 2009) is mathematically inconsistent and hence one should carefully review Tsallis' ideas…
The authors of the comment[Phys. Rev. A 97, 046101 (2018)] raise that the inconsistency in calculating some common quantum-speed-limit (QSL) bounds, which is presented in our paper [Phys. Rev. A 95, 052118 (2017)], does not exist in their…
We describe a new and consistent perturbation theory for solid-state quantum computation with many qubits. The errors in the implementation of simple quantum logic operations caused by non-resonant transitions are estimated. We verify our…
In 2008 Coecke and Duncan proposed the graphical ZX-calculus rewrite system which came to formalize reasoning with quantum circuits, measurements and quantum states. The ZX-calculus is sound for qubit quantum mechanics. Hence, equality of…
In this paper we show that several authors have derived wrong physical conclusions from a gross misunderstanding of the exact eigenvalues and eigenfunctions of a conditionally-solvable quantum-mechanical model. It consists of an eigenvalue…
We introduce a novel method for strong classical simulation of quantum circuits based on optimally k-partitioning ZX-diagrams, reducing each part individually, and then efficiently cross-referencing their results to conclude the overall…
Quantum information science currently poses a troubling contradiction. It can be summarized as: (1) To factor efficiently, quantum computers must perform exponentially precise energy estimation. (2) Exponentially precise energy estimation…
For translationally shape invariant potentials, the exact quantization rule proposed by Ma and Xu is a direct consequence of exactness of the modified WKB quantization condition proved by Barclay. We propose here a very direct alternative…
The ZX calculus and ZH calculus use diagrams to denote and compute properties of quantum operations, using `rewrite rules' to transform between diagrams which denote the same operator through a functorial semantic map. Different semantic…
I argue that the rules of unitary quantum mechanics imply that observers who will themselves be subject to measurements in a linear combination of macroscopic states (``cat" measurements) cannot make reliable predictions on the results of…
We show by explicit construction of an alternative theory for the strong interactions that it cannot be distinguished from QCD by any of the usual precision tests except on extending these theories to the full electroweak theory, by the Z-…
Complex numbers play a crucial role in quantum mechanics. However, their necessity remains debated: whether they are fundamental or merely convenient. Recently, it was claimed that quantum mechanics based on real numbers can be…
The ZX-calculus is a graphical language for suitably represented tensor networks, called ZX-diagrams. Calculations are performed by transforming ZX-diagrams with rewrite rules. The ZX-calculus has found applications in reasoning about…
Recently, it has been argued that quantum mechanics is complete, and that quantum states vectors are necessarily in one-to-one correspondence with the elements of reality, under the assumptions that quantum theory is correct and that…
In this paper, we investigate the Mill's ratio estimation problem and get two new inequalities. Compared to the well known results obtained by Gordon, they becomes tighter. Furthermore, we also discuss the inverse Q-function approximation…
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 give an overview of linear optics quantum computing, focusing on the results from the original KLM paper. First we give a brief summary of the advances made with optics for quantum computation prior to KLM. We next discuss the KLM linear…
Graphical languages, like quantum circuits or ZX-calculus, have been successfully designed to represent (memoryless) quantum computations acting on a finite number of qubits. Meanwhile, delayed traces have been used as a graphical way to…
We improve the recent method of Wang et. al to calculate exactly the one-way information deficit of any X-state. Analytical formulas of the one-way information deficit are given for several nontrivial regions of the parameters.