This paper shows that, if we could examine the entire history of a hidden variable, then we could efficiently solve problems that are believed to be intractable even for quantum computers. In particular, under any hidden-variable theory satisfying a reasonable axiom called "indifference to the identity," we could solve the Graph Isomorphism and Approximate Shortest Vector problems in polynomial time, as well as an oracle problem that is known to require quantum exponential time. We could also search an N-item database using O(N^{1/3}) queries, as opposed to O(N^{1/2}) queries with Grover's search algorithm. On the other hand, the N^{1/3} bound is optimal, meaning that we could probably not solve NP-complete problems in polynomial time. We thus obtain the first good example of a model of computation that appears slightly more powerful than the quantum computing model.
A central principle of consistent histories quantum theory, the requirement that quantum descriptions be based upon a single framework (or family), is employed to show that there is no conflict between consistent histories and a no-hidden-variables theorem of Bell, and Kochen and Specker, contrary to a recent claim by Bassi and Ghirardi. The argument makes use of ``truth functionals'' defined on a Boolean algebra of classical or quantum properties.
The paper develops a version of modal logic that stays completely within the framework provided by quantum principles, and then proves, within the framework of quantum thinking, and in particular without invoking "hidden variables", a Bell-type nonlocality result.
Schur duality decomposes many copies of a quantum state into subspaces labeled by partitions, a decomposition with applications throughout quantum information theory. Here we consider applying Schur duality to the problem of distinguishing coset states in the standard approach to the hidden subgroup problem. We observe that simply measuring the partition (a procedure we call weak Schur sampling) provides very little information about the hidden subgroup. Furthermore, we show that under quite general assumptions, even a combination of weak Fourier sampling and weak Schur sampling fails to ident…
Quantum entanglement is a key resource, which grants quantum systems the ability to accomplish tasks that are classically impossible. Here, we apply Feynman's sum-over-histories formalism to interacting bipartite quantum systems and introduce entanglement measures for bipartite quantum histories. Based on the Schmidt decomposition of the matrix comprised of the Feynman propagator complex coefficients, we prove that bipartite quantum histories are entangled if and only if the Schmidt rank of this matrix is larger than 1. The proposed approach highlights the utility of using a separable basis fo…
Many quantum algorithms, including Shor's celebrated factoring and discrete log algorithms, proceed by reduction to a hidden subgroup problem, in which a subgroup H of a group G must be determined from a quantum state y uniformly supported on a left coset of H. These hidden subgroup problems are then solved by Fourier sampling: the quantum Fourier transform of y is computed and measured. When the underlying group is non-Abelian, two important variants of the Fourier sampling paradigm have been identified: the weak standard method, where only representation names are measured, and the strong st…
Many quantum algorithms, including Shor's celebrated factoring and discrete log algorithms, proceed by reduction to a Hidden Subgroup problem, in which an unknown subgroup H of a group G must be determined from a uniform superposition on a left coset of H. These hidden subgroup problems are typically solved by Fourier sampling. When G is nonabelian, two important variants of Fourier sampling have been identified: the weak standard method, where only representation names are measured, and the strong standard method, where full measurement (i.e., the row and column of the representation, in a su…
We present a negative result regarding the hidden subgroup problem on the powers $G^n$ of a fixed group $G$. Under a condition on the base group $G$, we prove that strong Fourier sampling cannot distinguish some subgroups of $G^n$. Since strong sampling is in fact the optimal measurement on a coset state, this shows that we have no hope of efficiently solving the hidden subgroup problem over these groups with separable measurements on coset states (that is, using any polynomial number of single-register coset state experiments). Base groups satisfying our condition include all nonabelian simpl…
A simple local hidden-variables model is exhibited which reproduces the results of all performed tests of Bell\'{}s inequalities involving optical photon pairs. For the old atomic-cascade experiments, like Aspect\'{}s, the model agrees with quantum mechanics even for ideal set-ups. For more recent experiments, using parametric down-converted photons, the agreement occurs only for actual experiments, involving low efficiency detectors. Arguments are given against the fair sampling assumption, currently combined with the results of the experiments in order to claim a contradiction with local rea…
We establish a general method for proving bounds on the information that can be extracted via arbitrary entangled measurements on tensor products of hidden subgroup coset states. When applied to the symmetric group, the method yields an Omega(n log n) lower bound on the number of coset states over which we must perform an entangled measurement in order to obtain non-negligible information about a hidden involution. These results are tight to within a multiplicative constant and apply, in particular, to the case relevant for the Graph Isomorphism problem. Part of our proof was obtained after le…
We show that measuring any two quantum states by a random POVM, under a suitable definition of randomness, gives probability distributions having total variation distance at least a universal constant times the Frobenius distance between the two states, with high probability. This result gives us the first sufficient condition and an information-theoretic solution for the following quantum state distinction problem: given an a priori known ensemble of quantum states, is there a single POVM that gives reasonably large total variation distance between every pair of states from the ensemble? Our …
We resolve the question of whether Fourier sampling can efficiently solve the hidden subgroup problem. Specifically, we show that the hidden subgroup problem over the symmetric group cannot be efficiently solved by strong Fourier sampling, even if one may perform an arbitrary POVM on the coset state. Our results apply to the special case relevant to the Graph Isomorphism problem.
Part I of this paper showed that the hidden subgroup problem over the symmetric group--including the special case relevant to Graph Isomorphism--cannot be efficiently solved by strong Fourier sampling, even if one may perform an arbitrary POVM on the coset state. In this paper, we extend these results to entangled measurements. Specifically, we show that the hidden subgroup problem on the symmetric group cannot be solved by any POVM applied to pairs of coset states. In particular, these hidden subgroups cannot be determined by any polynomial number of one- or two-register experiments on coset …
A family of local models containing two angles as hidden variables is defined for experiments measuring polarization correlation of optical photons. Searching for the best model of the family, that is giving predictions most close to quantum mechanics, allows deriving Bell-type inequalities which may be tested with relatively low detection efficiency.
An experiment has recently been performed to demonstrate quantum nonlocality by establishing contextuality in one of a pair of photons encoding four qubits; however, low detection efficiencies and use of the fair-sampling hypothesis leave these results open to possible criticism due to the detection loophole. In this Letter, a physically motivated local hidden-variable model is considered as a possible mechanism for explaining the experimentally observed results. The model, though not intrinsically contextual, acquires this quality upon post-selection of coincident detections.
We present two experiments testing the hypothesis of noncontextual hidden variables (NCHV's). The first one is based on observation of two-photon pseudo-Greenberger-Horne-Zeilinger correlations, with two of the originally three particles mimicked by the polarization degree of freedom and the spatial degree of freedom of a single photon. The second one, a single-photon experiment, utilizes the same trick to emulate two particle correlations, and is an "event ready" test of a Bell-like inequality, derived from the noncontextuality assumption. Modulo fair sampling, the data falsify NCHV's.
Although regarded today as an important resource in quantum information, nonlocality has yielded over the years many conceptual conundrums. Among the latter are nonlocal aspects of single particles which have been of major interest. In this paper, the nonlocality of single quanta is studied in a square nested Mach-Zehnder interferometer with spatially separated detectors using a delayed choice modification of quantum measurement outcomes that depend on the complex-valued weak values. We show that if spacelike separated Bob and Alice are allowed to freely control their quantum devices, the geom…
We give an overview of the Hidden Subgroup Problem (HSP) as of July 2010, including new results discovered since the survey of arXiv:quant-ph/0411037v1. We recall how the problem provides a framework for efficient quantum algorithms and present the standard methods based on coset sampling. We study the Dihedral and Symmetric HSPs and how they relate to hard problems on lattices and graphs. Finally, we conclude with the known solutions and techniques, describe connections with efficient algorithms as well as miscellaneous variants of HSP. We also bring various contributions to the topic. We sho…
The quantum hidden subgroup approach is an actively studied approach to solve combinatorial problems in quantum complexity theory. With the success of the Shor's algorithm, it was hoped that similar approach may be useful to solve the other combinatorial problems. One such problem is the graph isomorphism problem which has survived decades of efforts using the hidden subgroup approach. This paper provides a systematic approach to create arbitrarily large classes of classically efficiently solvable graph automorphism problems or easy graph automorphism problems for which hidden subgroup approac…
Most quantum algorithms that give an exponential speedup over classical algorithms exploit the Fourier transform in some way. In Shor's algorithm, sampling from the quantum Fourier spectrum is used to discover periodicity of the modular exponentiation function. In a generalization of this idea, quantum Fourier sampling can be used to discover hidden subgroup structures of some functions much more efficiently than it is possible classically. Another problem for which the Fourier transform has been recruited successfully on a quantum computer is the hidden shift problem. Quantum algorithms for h…
This paper initiates the study of hidden variables from the discrete, abstract perspective of quantum computing. For us, a hidden-variable theory is simply a way to convert a unitary matrix that maps one quantum state to another, into a stochastic matrix that maps the initial probability distribution to the final one in some fixed basis. We list seven axioms that we might want such a theory to satisfy, and then investigate which of the axioms can be satisfied simultaneously. Toward this end, we construct a new hidden-variable theory that is both robust to small perturbations and indifferent to…
The Greenberger-Horne-Zeilinger (GHZ) puzzle has been used to study quantum nonlocality and provide an all-or-nothing, no-go theorem for local hidden-variable models. Recent experiments using coincident-detected entangled photons prepared in a three-particle GHZ state have been used to test quantum nonlocality, but fail to rule out local realism due to a reliance on the fair-sampling hypothesis and insufficient detection efficiency. This paper describes a physically motivated local hidden-variable model based on amplitude-threshold detection that is capable of producing similar results. Detect…
Closed Quantum Boltzmann Bridges: Coherent Revivals, Hidden Microstates, and the Emergence of Classical Two-Time Entropy Conditioning
University of Western Ontario（韦仕敦大学）；National Research Council Canada（加拿大国家研究委员会）；Institut für Physik und Astronomie, Technische Universität Berlin（柏林工业大学物理与天文研究所）
We employ concepts and tools from the theory of finite permutation groups in order to analyse the Hidden Subgroup Problem via Quantum Fourier Sampling (QFS) for the symmetric group. We show that under very general conditions both the weak and the random-strong form (strong form with random choices of basis) of QFS fail to provide any advantage over classical exhaustive search. In particular we give a complete characterisation of polynomial size subgroups, and of primitive subgroups, that can be distinguished from the identity subgroup with the above methods. Furthermore, assuming a plausible g…
We generalize the hidden-fermion family of neural network quantum states to encompass both continuous and discrete degrees of freedom and solve the nuclear many-body Schrödinger equation in a systematically improvable fashion. We demonstrate that adding hidden nucleons to the original Hilbert space considerably augments the expressivity of the neural-network architecture compared to the Slater-Jastrow ansatz. The benefits of explicitly encoding in the wave function point symmetries such as parity and time-reversal are also discussed. Leveraging on improved optimization methods and sampling tec…
University of Waterloo（滑铁卢大学）；IBM TJ Watson Research Center（IBM TJ沃森研究中心）；NEC Laboratories America（NEC美国实验室）
We study the quantum query complexity of the Boolean hidden shift problem. Given oracle access to f(x+s) for a known Boolean function f, the task is to determine the n-bit string s. The quantum query complexity of this problem depends strongly on f. We demonstrate that the easiest instances of this problem correspond to bent functions, in the sense that an exact one-query algorithm exists if and only if the function is bent. We partially characterize the hardest instances, which include delta functions. Moreover, we show that the problem is easy for random functions, since two queries suffice.…
