Quantum Lower Bounds by Sample-to-Query Lifting

• URL: http://arxiv.org/abs/2308.01794v2
• Date: Wed, 26 Jun 2024 13:11:04 GMT
• Title: Quantum Lower Bounds by Sample-to-Query Lifting
• Authors: Qisheng Wang, Zhicheng Zhang,
• Abstract summary: We propose an arguably new method for proving quantum query lower bounds by a quantum sample-to-query lifting theorem. We provide unified proof for some known lower bounds, including those for phase/amplitude estimation and Hamiltonian simulation.
• Score: 7.319050391449301
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The polynomial method by Beals, Buhrman, Cleve, Mosca, and de Wolf (FOCS 1998) and the adversary method by Ambainis (STOC 2000) have been shown to be powerful in proving quantum query lower bounds for a wide variety of problems. In this paper, we propose an arguably new method for proving quantum query lower bounds by a quantum sample-to-query lifting theorem, which is from an information theory perspective. Using this method, we obtain the following new results: 1. A quadratic relation between quantum sample and query complexities regarding quantum property testing, which is optimal and saturated by quantum state discrimination. 2. A matching lower bound $\widetilde \Omega(\beta)$ for quantum Gibbs sampling at inverse temperature $\beta$, showing that the quantum Gibbs sampler by Gily\'en, Su, Low, and Wiebe (STOC 2019) is optimal. 3. A new lower bound $\widetilde \Omega(1/\sqrt{\Delta})$ for the entanglement entropy problem with gap $\Delta$, which was recently studied by She and Yuen (ITCS 2023). 4. A series of quantum query lower bounds for matrix spectrum testing, based on the sample lower bounds for quantum state spectrum testing by O'Donnell and Wright (STOC 2015). In addition, we also provide unified proofs for some known lower bounds that have been proven previously via different techniques, including those for phase/amplitude estimation and Hamiltonian simulation.

Related papers

• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Hidden-State Proofs of Quantumness [1.0878040851638]
  An experimental cryptographic proof of quantumness will be a vital milestone in the progress of quantum information science. Error tolerance is a persistent challenge for implementing such tests. We present a proof of quantumness which maintains the same circuit structure as (Brakerski et al.)
  arXiv  Detail & Related papers  (2024-10-08T21:04:53Z)
• Spontaneous symmetry breaking in a $SO(3)$ non-Abelian lattice gauge theory in $2+1$D with quantum algorithms [0.0]
  We study the ability of quantum algorithms to prepare ground states in a matter-free non-Abelian $SO(3)$ lattice gauge theory in $2+1$D. To deal with the large Hilbert space of gauge fields, we demonstrate how the exact imposition of the non-Abelian Gauss Law in the rishon representation of the quantum link operator significantly reduces the degrees of freedom.
  arXiv  Detail & Related papers  (2024-09-11T08:55:59Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Lower Bounds for Unitary Property Testing with Proofs and Advice [0.0]
  We propose a new technique for proving lower bounds on the quantum query of unitary property testing. All obtained lower bounds hold for any $mathsfC$-tester with $mathsfC subseteq mathsfQMA(2)/mathsfqpoly$. We show that there exist quantum oracles relative to which $mathsfQMA(2) notsupset mathsfSBQP$ and $mathsfQMA/mathsfqpoly
  arXiv  Detail & Related papers  (2024-01-15T19:00:36Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Quantum Heavy-tailed Bandits [36.458771174473924]
  We study multi-armed bandits (MAB) and linear bandits (SLB) with heavy-tailed rewards and quantum reward. We first propose a new quantum mean estimator for heavy-tailed distributions, which is based on the Quantum Monte Carlo Estimator. Based on our quantum mean estimator, we focus on quantum heavy-tailed MAB and SLB and propose quantum algorithms based on the Upper Confidence Bound (UCB) framework.
  arXiv  Detail & Related papers  (2023-01-23T19:23:10Z)
• Optimal lower bounds for Quantum Learning via Information Theory [3.093890460224435]
  We derive optimal lower bounds for quantum sample complexity in both the PAC and models via an information-theoretic approach. We then turn to a quantum analogue of the Coupon Collector problem, a classic problem from probability theory. All the aspects of the Quantum Coupon Collector problem we study rest on properties of the spectrum of the associated Gram matrix.
  arXiv  Detail & Related papers  (2023-01-05T18:55:04Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.