Quantum Information and Measurement (QIM)

Continuous-Variable Instantaneous Quantum Computing is hard to sample

Tom Douce, Damian Markham, Elham Kashefi, Eleni Diamanti, T. Coudreau, P. Milman, Peter van Loock, Giulia Ferrini

Published Jan 1, 2017• 2 citations

Abstract

We study the translation of a recently introduced complexity class, Instantaneous Quantum Computing, to the regime of Continuous Variables (CV). Following the existing proof for the case of Discrete Variables (DV), we prove that CV IQP circuits are hard to classically simulate by exploring the properties of post-selected CV IQP circuits.

DOI: 10.1364/qim.2017.qt5b.1

Related papers

Continuous-Variable Instantaneous Quantum Computing is Hard to Sample

Tom Douce, Damian Markham, Elham Kashefi +5 more

Instantaneous quantum computing is a subuniversal quantum complexity class, whose circuits have proven to be hard to simulate classically in the discrete-variable realm. We extend this proof to the continuous-variable (CV) domain by using squeezed states and homodyne detection, and by exploring the properties of postselected circuits. In order to treat postselection in CVs, we consider finitely resolved homodyne detectors, corresponding to a realistic scheme based on discrete probability distributions of the measurement outcomes. The unavoidable errors stemming from the use of finitely squeezed states are suppressed through a qubit-into-oscillator Gottesman-Kitaev-Preskill encoding of quantum information, which was previously shown to enable fault-tolerant CV quantum computation. Finally, we show that, in order to render postselected computational classes in CVs meaningful, a logarithmic scaling of the squeezing parameter with the circuit size is necessary, translating into a polynomial scaling of the input energy.

arXiv:1607.07605Physical Review LettersFeb 17, 201764 citations

Quantum supremacy and high-dimensional integration

Juan Miguel Arrazola, Patrick Rebentrost, Christian Weedbrook

We establish a connection between continuous-variable quantum computing and high-dimensional integration by showing that the outcome probabilities of continuous-variable instantaneous quantum polynomial (CV-IQP) circuits are given by integrals of oscillating functions in large dimensions. We prove two results related to the classical hardness of evaluating these integrals: (i) we show that there exist circuits such that these integrals are approximations of a weighted sum of #P-hard problems and (ii) we prove that calculating these integrals is as hard as calculating integrals of arbitrary bounded functions. We then leverage these results to show that, given a plausible conjecture about the hardness of computing the integrals, approximate sampling from CV-IQP circuits cannot be done in polynomial time on a classical computer unless the polynomial hierarchy collapses to the third level. Our results hold even in the presence of finite squeezing and limited measurement precision, without an explicit need for fault-tolerance.

arXiv:1712.07288Dec 20, 20178 citations

Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth

Joel Rajakumar, James D. Watson, Yi-Kai Liu

Sampling from the output distributions of quantum computations comprising only commuting gates, known as instantaneous quantum polynomial (IQP) computations, is believed to be intractable for classical computers, and hence this task has become a leading candidate for testing the capabilities of quantum devices. Here we demonstrate that for an arbitrary IQP circuit undergoing dephasing or depolarizing noise, whose depth is greater than a critical O (1) threshold, the output distribution can be efficiently sampled by a classical computer. Unlike other simulation algorithms for quantum supremacy tasks, we do not require assumptions on the circuit’s architecture, on anti-concentration properties, nor do we require Ω(log (n )) circuit depth. We take advantage of the fact that IQP circuits have deep sections of diagonal gates, which allows the noise to build up predictably and induce a large-scale breakdown of entanglement within the circuit. Our results suggest that quantum supremacy experiments based on IQP circuits may be more susceptible to classical simulation than previously thought. Furthermore, we show that the critical depth threshold of our algorithm is tight, and below this threshold there are noisy IQP circuits which are hard to sample from. Thus we demonstrate that noisy IQP circuits exhibit a phase transition in the computational complexity of sampling, as circuit depth is increased.

arXiv:2403.14607Society for Industrial and Applied Mathematics eBooksJan 1, 20257 citations

Continuous-Variable Sampling

Ulysse Chabaud, Tom Douce, Damian Markham +3 more

We introduce a new family of quantum circuits in Continuous Variables and we show that, relying on the widely accepted conjecture that the polynomial hierarchy of complexity classes does not collapse, their output probability distribution cannot be efficiently simulated by a classical computer. These circuits are composed of input photon-subtracted (or photon-added) squeezed states, passive linear optics evolution, and eight-port homodyne detection. We address the proof of hardness for the exact probability distribution of these quantum circuits by exploiting mappings onto different architectures of sub-universal quantum computers. We obtain both a worst-case and an average-case hardness result. Hardness of Boson Sampling with eight-port homodyne detection is obtained as the zero squeezing limit of our model. We conclude with a discussion on the relevance and interest of the present model in connection to experimental applications and classical simulations.

Jul 28, 20171 citation

Nonlocality in instantaneous quantum circuits

Joel J. Wallman, Emily Adlam

We show that families of Instantaneous Quantum Polynomial (IQP) circuits corresponding to nontrivial Bell tests exhibit nonlocality. However, we also prove that this nonlocality can only be demonstrated using post-selection or nonlinear processing of the measurement outcomes. Therefore if the output of a computation is encoded in the parity of the measurement outcomes, then families of IQP circuits whose full output distributions are hard to sample still only provide a computational advantage relative to locally causal theories under post-selection. Consequently, post-selection is a crucial technique for obtaining a computational advantage for IQP circuits (with respect to decision problems) and for demonstrating nonlocality within IQP circuits, suggesting a strong link between these phenomena.

arXiv:1412.4131Dec 12, 20142 citations

Achieving quantum supremacy with sparse and noisy commuting quantum computations

Michael J. Bremner, Ashley Montanaro, Dan J. Shepherd

The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-time) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. Here we study the power of IQP circuits in the presence of physically motivated constraints. First, we show that there is a family of sparse IQP circuits that can be implemented on a square lattice of n qubits in depth O(sqrt(n) log n), and which is likely hard to simulate classically. Next, we show that, if an arbitrarily small constant amount of noise is applied to each qubit at the end of any IQP circuit whose output probability distribution is sufficiently anticoncentrated, there is a polynomial-time classical algorithm that simulates sampling from the resulting distribution, up to constant accuracy in total variation distance. However, we show that purely classical error-correction techniques can be used to design IQP circuits which remain hard to simulate classically, even in the presence of arbitrary amounts of noise of this form. These results demonstrate the challenges faced by experiments designed to demonstrate quantum supremacy over classical computation, and how these challenges can be overcome.

arXiv:1610.01808QuantumApr 25, 2017191 citations