Symmetry-assisted adversaries for quantum state generation

Abstract

We introduce a new quantum adversary method to prove lower bounds on the query complexity of the quantum state generation problem. This problem encompasses both, the computation of partial or total functions and the preparation of target quantum states. There has been hope for quite some time that quantum state generation might be a route to tackle the {\sc Graph Isomorphism} problem. We show that for the related problem of {\sc Index Erasure} our method leads to a lower bound of $\Omega (\sqrt{N})$ which matches an upper bound obtained via reduction to quantum search on $N$ elements. This closes an open problem first raised by Shi [FOCS'02]. Our approach is based on two ideas: (i) on the one hand we generalize the known additive and multiplicative adversary methods to the case of quantum state generation, (ii) on the other hand we show how the symmetries of the underlying problem can be leveraged for the design of optimal adversary matrices and dramatically simplify the computation of adversary bounds. Taken together, these two ideas give the new result for {\sc Index Erasure} by using the representation theory of the symmetric group. Also, the method can lead to lower bounds even for small success probability, contrary to the standard adversary method. Furthermore, we answer an open question due to Špalek [CCC'08] by showing that the multiplicative version of the adversary method is stronger than the additive one for any problem. Finally, we prove that the multiplicative bound satisfies a strong direct product theorem, extending a result by Špalek to quantum state generation problems.

35 pages, 5 figures

References in corpus (7)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Strengths and Weaknesses of Quantum Computing
• Negative weights make adversaries stronger
• Quantum lower bounds for the collision and the element distinctness problems
• Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function
• Quantum complexities of ordered searching, sorting, and element distinctness
• A new quantum lower bound method, with an application to strong direct product theorem for quantum search

Cited by in corpus (14)

• Hamiltonian simulation with nearly optimal dependence on all parameters
• Exponential improvement in precision for simulating sparse Hamiltonians
• Quantum query complexity of state conversion
• Quantum rejection sampling
• Quantum Counterfeit Coin Problems
• Quantum Speedup Based on Classical Decision Trees
• Quantum Coupon Collector
• Applications of the Adversary Method in Quantum Query Algorithms
• Quantum Adversary (Upper) Bound
• The Quantum Supremacy Tsirelson Inequality
• Quantum Attacks on Classical Proof Systems - The Hardness of Quantum Rewinding
• Adversary Lower Bound for Element Distinctness with Small Range
• A strong direct product theorem for quantum query complexity
• Sealed States And Quantum Blackmail