To appear in: Hemmo, Meir and Shenker, Orly (eds.) Quantum, Probability, Logic: Itamar Pitowsky's Work and Influence, Springer, Nature (2019), forthcoming
发表信息：
in: M. Hemmo, and O. Shenker,(eds.) Quantum, Probability, Logic: Itamar Pitowsky's Work and Influence, Springer(2020),pp. 399-422
We give a computational complexity argument against the feasibility of quantum computers. We identify a very low complexity class of probability distributions described by noisy intermediate-scale quantum computers, and explain why it will allow neither good-quality quantum error-correction nor a demonstration of "quantum supremacy." Some general principles governing the behavior of noisy quantum systems are derived. Our work supports the "physical Church thesis" studied by Pitowsky (1990) and follows his vision of using abstract ideas about computation to study the performance of actual physical computers.
My 2018 lecture at the ICA workshop in Singapore dealt with quantum computation as a meeting point of the laws of computation and the laws of quantum mechanics. We described a computational complexity argument against the feasibility of quantum computers: we identified a very low-level complexity class of probability distributions described by noisy intermediate-scale quantum computers, and explained why it would allow neither good-quality quantum error-correction nor a demonstration of "quantum supremacy," namely, the ability of quantum computers to make computations that are impossible or ex…
Testable predictions of quantum mechanics are invariant under time reversal. But the change of the quantum state in time is not so, neither in the collapse nor in the no-collapse interpretations of the theory. This fact challenges the realistic interpretation of the quantum state. On the other hand, this fact follows easily if we interpret the quantum state as a mere calculation device, bookkeeping past real quantum events. The same conclusion follows from the analysis of the meaning of the wave function in the semiclassical regime.
I identify a number of errors in Richard Gill's purported refutation (arXiv:1203.1504) of my disproof of Bell's theorem. In particular, I point out that his central argument is based, not only on a rather trivial misreading of my counterexample to Bell's theorem, but also on a simple oversight of a freedom of choice in the orientation of a Clifford algebra. What is innovative and original in my counterexample is thus mistaken for an error, at the expense of the professed universality and generality of Bell's theorem.
A thought experiment is described and the probability of a particular type of results is predicted according to the quantum formalism. Then, the assumption is made that there exists a particle that travels from the source to one of the detectors, along a continuous trajectory. A contradiction appears: for agreeing with the quantum prediction, the particle has to land at once on two space separated detectors. Therefore, the trajectory of the particle, if it exists, cannot be continuous.
In a couple of recent preprints Moldoveanu has suggested that there are errors in my disproof of Bell's theorem. Here I show that this claim is false. In particular, I show that my local-realistic framework is incorrectly and misleadingly presented in both of his preprints. In addition there are a number of serious mathematical and conceptual errors in his discussion of my framework. For example, contrary to his claim, my framework is manifestly non-contextual. In particular, quantum correlations are understood within it as purely topological effects, not contextual effects.
We use entropy-energy arguments to assess the limitations on the running time and on the system size, as measured in qubits, of noisy macroscopic circuit-based quantum computers.
A frequently given version of the argument of Einstein, Podolsky and Rosen against the completeness of the quantum mechanical description is criticized as a misrepresentation that lacks the cogency of the original EPR argument.
We reconsider a well known problem of quantum theory, i.e. the so called measurement (or macro-objectification) problem, and we rederive the fact that it gives rise to serious problems of interpretation. The novelty of our approach derives from the fact that the relevant conclusion is obtained in a completely general way, in particular, without resorting to any of the assumptions of ideality which are usually done for the measurement process. The generality and unescapability of our assumptions (we take into account possible malfunctionings of the apparatus, its unavoidable entanglement with t…
In [Sch05a], it is argued that Boltzmann's intuition, that the psychological arrow of time is necessarily aligned with the thermodynamic arrow, is correct. Schulman gives an explicit physical mechanism for this connection, based on the brain being representable as a computer, together with certain thermodynamic properties of computational processes. [Haw94] presents similar, if briefer, arguments. The purpose of this paper is to critically examine the support for the link between thermodynamics and an arrow of time for computers. The principal arguments put forward by Schulman and Hawking will…
This paper aims to invalidate the hypothesis that consciousness is necessary for the quantum measurement process. To achieve this target, I propose a considerable modification of the Schroedinger cat and the Dead-Alive Physicist thought experiments, called 'PIAR', short for Physicist Inside the Ambiguous Room. A specific strategy has enabled me to plan the experiment in such a way as to logically justify the inconsistency of the above hypothesis and to oblige its supporters to rely on an alternative interpretation of quantum mechanics in which the real-world phenomena exist independently of ou…
General key problems in relation to the application of self-organizing structures theory to the analysis of current cooperative phenomena are discussed. Particularly, we present the new results of the analysis of burning problem to form a qubit network. Recently [Proc. of the Inst. of Physics and Technol. of Russian Acad. of Sci. (Trudy FTIAN), vol. 25 (accepted for publication on Jan. 15, 2015)] we have proposed a new method for quantum computer implementation based on self-organizing structures. Here we consider in detail the essence of new proposals and theoretical argumentation. We have sh…
Matrix permanents arise naturally in the context of linear optical networks fed with nonclassical states of light. In this letter we tie the computational complexity of a class of multi-dimensional integrals to the permanents of large matrices using a simple quantum optics argument. In this way we prove that evaluating integrals in this class is \textbf{\#P}-hard. Our work provides a new approach for using methods from quantum physics to prove statements in computer science.
We show that every language in QMA admits a classical-verifier, quantum-prover zero-knowledge argument system which is sound against quantum polynomial-time provers and zero-knowledge for classical (and quantum) polynomial-time verifiers. The protocol builds upon two recent results: a computational zero-knowledge proof system for languages in QMA, with a quantum verifier, introduced by Broadbent et al. (FOCS 2016), and an argument system for languages in QMA, with a classical verifier, introduced by Mahadev (FOCS 2018).
The Greenberger-Horne-Zeilinger (GHZ) argument against noncontextual local hidden variables is recast in quantum logical terms of fundamental propositions, states and probabilities. Unlike Kochen-Specker- and Hardy-like configurations, this operator based argument proceeds within four nonintertwining contexts. The nonclassical performance of the GHZ argument is due to the choice or filtering of observables with respect to a particular state. We study the varieties of GHZ games one could play in these four contexts, depending on the chosen state of the GHZ basis.
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hypercube {0,1}^n, we show a lower bound of Omega(2^{n/4}/n) on the number of queries needed by a quantum computer to solve this problem. More surprisingly, our approach, based on Ambainis' quantum adversary method, also yields a lower bound of Omega(2^{n/2}/n^2) on the problem's classical randomized query complexity. This improves and simplifies a 1983 result of Aldous. Finally, in both the randomized and quantum cases, …
The key cryptographic protocols used to secure the internet and financial transactions of today are all susceptible to attack by the development of a sufficiently large quantum computer. One particular area at risk are cryptocurrencies, a market currently worth over 150 billion USD. We investigate the risk of Bitcoin, and other cryptocurrencies, to attacks by quantum computers. We find that the proof-of-work used by Bitcoin is relatively resistant to substantial speedup by quantum computers in the next 10 years, mainly because specialized ASIC miners are extremely fast compared to the estimate…
A quantum computer -- i.e., a computer capable of manipulating data in quantum superposition -- would find applications including factoring, quantum simulation and tests of basic quantum theory. Since quantum superpositions are fragile, the major hurdle in building such a computer is overcoming noise. Developed over the last couple of years, new schemes for achieving fault tolerance based on error detection, rather than error correction, appear to tolerate as much as 3-6% noise per gate -- an order of magnitude better than previous procedures. But proof techniques could not show that these pro…
A short foreword has been added for the archive version of this article, which otherwise appears as originally published in 1990, except for the updating of references. The original abstract follows. This is a critical review of the literature on many-worlds interpretations (MWI), with arguments drawn partly from earlier critiques by Bell and Stein. The essential postulates involved in various MWI are extracted, and their consistency with the evident physical world is examined. Arguments are presented against MWI proposed by Everett, Graham and DeWitt. The relevance of frequency operators to M…
In this article we describe a technique to transfer data from classical domain to quantum domain. We consider a set of $N (=2^n)$ classical data in the form of a column matrix and prepare a $n$-qubit quantum state, whose components correspond to the $N$ classical data. To prepare this $n$-qubit quantum vector we use Schmidt decomposition and singular value decomposition techniques respectively and construct the corresponding family of quantum circuits. To strengthen our argument we also give specific examples by considering a set of 4 and 16 classical data and constructing the corresponding 2 …
Ground-state quantum computers mimic quantum mechanical time evolution within the amplitudes of a time-independent quantum state. We explore the principles that constrain this mimicking. A no-cloning argument is found to impose strong restrictions. It is shown, however, that there is flexibility that can be exploited using quantum teleportation methods to improve ground-state quantum computer design.
The intriguing suggestion of Tegmark (1996) that the universe--contrary to all our experiences and expectations--contains only a small amount of information due to an extremely high degree of internal symmetry is critically examined. It is shown that there are several physical processes, notably Hawking evaporation of black holes and non-zero decoherence time effects described by Plaga, as well as thought experiments of Deutsch and Tegmark himself, which can be construed as arguments against the low-information universe hypothesis. In addition, an extreme form of physical reductionism is entai…
We initiate the study of non-interactive zero-knowledge (NIZK) arguments for languages in QMA. Our first main result is the following: if Learning With Errors (LWE) is hard for quantum computers, then any language in QMA has an NIZK argument with preprocessing. The preprocessing in our argument system consists of (i) the generation of a CRS and (ii) a single (instance-independent) quantum message from verifier to prover. The instance-dependent phase of our argument system involves only a single classical message from prover to verifier. Importantly, verification in our protocol is entirely cla…
Qubit realizations based on Majorana bound states have been considered promising candidates for quantum information processing which is inherently inert to decoherence. We put the underlying general arguments leading to this conjecture to the test from an open quantum system perspective. It turns out that, from a fundamental point of view, the Majorana qubit is as susceptible to decoherence as any local paradigm of a qubit.
A significant obstacle for practical quantum computation is the loss of physical qubits in quantum computers, a decoherence mechanism most notably in optical systems. Here we experimentally demonstrate, both in the quantum circuit model and in the one-way quantum computer model, the smallest non-trivial quantum codes to tackle this problem. In the experiment, we encode single-qubit input states into highly-entangled multiparticle codewords, and we test their ability to protect encoded quantum information from detected one-qubit loss error. Our results prove the in-principle feasibility of over…
Challenges at the quantum-classical interface are examined with the goal of architecting a scaled-up quantum computer comprising many thousands of qubits in the solid-state. Separating the distinct sub-systems of the interface that perform readout and control, general arguments are given for why distributing the components of these sub-systems over significant distances and across large temperature gradients presents a major challenge to scaling-up the technology. Largely addressing these issues, an architecture for the interface that leverages cryo-CMOS circuits proximal to the quantum plane …
Two aspects of the physical side of the Church-Turing thesis are discussed. The first issue is a variant of the Eleatic argument against motion, dealing with Zeno squeezed time cycles of computers. The second argument reviews the issue of one-to-one computation, that is, the bijective (unique and reversible) evolution of computations and its relation to the measurement process.
Macro-realism is the position that certain "macroscopic" observables must always possess definite values: e.g. the table is in some definite position, even if we don't know what that is precisely. The traditional understanding is that by assuming macro-realism one can derive the Leggett-Garg inequalities, which constrain the possible statistics from certain experiments. Since quantum experiments can violate the Leggett-Garg inequalities, this is taken to rule out the possibility of macro-realism in a quantum universe. However, recent analyses have exposed loopholes in the Leggett-Garg argument…
As far as we know, a useful quantum computer will require fault-tolerant gates, and existing schemes demand a prohibitively large space and time overhead. We argue that a first generation quantum computer will be very valuable to design, test, and optimize fault-tolerant protocols tailored to the noise processes of the hardware. Our argument is essentially a critical analysis of the current methods envisioned to optimize fault-tolerant schemes, which rely on hardware characterization, noise modelling, and numerical simulations. We show that, even within a very restricted set of noise models, e…
The problem of the quantitative degradation of the performance of a quantum computer due to noisy unitary gates (imperfect external control) is studied. It is shown that quite general conclusions on the evolution of the fidelity can be reached by using the conjecture that the set of states visited by a quantum algorithm can be replaced by the uniform (Haar) ensemble. These general results are tested numerically against quantum computer simulations of two particular periodically driven quantum systems.
The arguments of Cohen [Phys. Rev. A {\bf 60}, 80 (1999)] against the `ignorance interpretation' of mixed states are questioned. The physical arguments are shown to be inconsistent and the supporting example illustrates the opposite of the original statement. The operational difference between two possible definitions of mixed states is exposed and the inadequacy of one of them is stressed.
We construct a constant-round zero-knowledge classical argument for NP secure against quantum attacks. We assume the existence of Quantum Fully-Homomorphic Encryption and other standard primitives, known based on the Learning with Errors Assumption for quantum algorithms. As a corollary, we also obtain a constant-round zero-knowledge quantum argument for QMA. At the heart of our protocol is a new no-cloning non-black-box simulation technique.
