Lower Bounds for Unitary Property Testing with Proofs and Advice

Abstract

In unitary property testing a quantum algorithm, also known as a tester, is given query access to a black-box unitary and has to decide whether it satisfies some property. We propose a new technique for proving lower bounds on the quantum query complexity of unitary property testing and related problems, which utilises its connection to unitary channel discrimination. The main advantage of this technique is that all obtained lower bounds hold for any $\mathsf{C}$-tester with $\mathsf{C}\subseteq \mathsf{QMA}(2)/\mathsf{qpoly}$, showing that even having access to both (unentangled) quantum proofs and advice does not help for many unitary property testing problems. We apply our technique to prove lower bounds for problems like quantum phase estimation, the entanglement entropy problem, quantum Gibbs sampling and more, removing all logarithmic factors in the lower bounds obtained by the sample-to-query lifting theorem of Wang and Zhang (2023). As a direct corollary, we show that there exist quantum oracles relative to which $\mathsf{QMA}(2)\not\supset \mathsf{SBQP}$ and $\mathsf{QMA}/\mathsf{qpoly}\not\supset \mathsf{SBQP}$. The former shows that, at least in a black-box way, having unentangled quantum proofs does not help in solving problems that require high precision.

Journal version

References in corpus (22)

• Strengths and Weaknesses of Quantum Computing
• Quantum principal component analysis
• Quantum fingerprinting
• Hamiltonian Simulation by Qubitization
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Statistical distinguishability between unitary operations
• Using entanglement improves precision of quantum measurements
• Negative weights make adversaries stronger
• N-representability is QMA-complete
• Near-optimal ground state preparation
• On Arbitrary Phases in Quantum Amplitude Amplification
• Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations
• Learning many-body Hamiltonians with Heisenberg-limited scaling
• Rigorous RG algorithms and area laws for low energy eigenstates in 1D
• Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function
• Property testing of unitary operators
• Query-optimal estimation of unitary channels in diamond distance
• A Lower Bound for Quantum Phase Estimation
• Single-shot discrimination of quantum unitary processes
• Tight Bounds for Quantum Phase Estimation and Related Problems

Cited by in corpus (2)

• Time-Efficient Quantum Entropy Estimator via Samplizer
• Quantum Lower Bounds by Sample-to-Query Lifting