Efficiently verifiable quantum advantage on near-term analog quantum simulators

• URL: http://arxiv.org/abs/2403.08195v1
• Date: Wed, 13 Mar 2024 02:41:39 GMT
• Title: Efficiently verifiable quantum advantage on near-term analog quantum simulators
• Abstract summary: We propose a quantum advantage protocol based on single-step Feynman-Kitaev verification of an analog quantum simulation. We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations.
• Score: 1.6712896227173808
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimental implementation. Meanwhile, analog quantum simulators have been realized in many experiments to study novel physics. In this work, we propose a quantum advantage protocol based on single-step Feynman-Kitaev verification of an analog quantum simulation, in which the verifier need only run an $O(\lambda^2)$-time classical computation, and the prover need only prepare $O(1)$ samples of a history state and perform $O(\lambda^2)$ single-qubit measurements, for a security parameter $\lambda$. We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations.

Related papers

• Experimental preparation of W states through many-body physics on a quantum simulator [0.0]
  $W$ states are quantum correlated states possessing both bipartite and multipartite entanglement.<n>We propose a protocol to generate these states by exploiting it topological ring frustration'<n>We successfully generate many-body $W$ states of Rubidium atoms on a programmable Rydberg atom array up to 11 qubits.
  arXiv  Detail & Related papers  (2025-10-20T18:00:07Z)
• Near-Optimal Simultaneous Estimation of Quantum State Moments [7.1834855718325805]
  We introduce a framework for resource-efficient simultaneous estimation of quantum state moments via qubit reuse.<n>By leveraging qubit reset operations, our core circuit for simultaneous moment estimation requires only $2m+1$ physical qubits and $mathcalO(k)$ CSWAP gates.<n>We demonstrate this protocol's utility by showing that the estimated moments yield tight bounds on a state's maximum eigenvalue and present applications in quantum virtual cooling to access low-energy states of the Heisenberg model.
  arXiv  Detail & Related papers  (2025-09-29T14:23:26Z)
• Measuring Less to Learn More: Quadratic Speedup in learning Nonlinear Properties of Quantum Density Matrices [6.701793676773711]
  A fundamental task in quantum information science is to measure nonlinear functionals of quantum states, such as $mathrmTr(rhok O)$.<n>We present a quadratic quantum algorithm that achieves this bound, demonstrating a quadratic advantage over sample-based methods.<n>Our results unveil a fundamental distinction between sample and purified access to quantum states, with broad implications for estimating quantum entropies and quantum Fisher information.
  arXiv  Detail & Related papers  (2025-09-01T15:56:49Z)
• Nonlinear functions of quantum states [5.641998714611475]
  We introduce the quantum state function (QSF) framework by extending the SWAP test via linear combination of unitaries and parameterized quantum circuits. We develop quantum algorithms of fundamental tasks, achieving a sample complexity of $tildemathcalO (1/(varepsilon2kappa)$ for both von Neumann entropy estimation and quantum state fidelity calculations.
  arXiv  Detail & Related papers  (2024-12-02T16:40:17Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Predicting Arbitrary State Properties from Single Hamiltonian Quench Dynamics [0.8639941465436463]
  We introduce the Hamiltonian shadow protocol, which estimates arbitrary state properties on analog quantum simulators. The protocol does not require sophisticated control and can be applied to a wide range of analog quantum simulators.
  arXiv  Detail & Related papers  (2023-11-01T17:52:23Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Commutation simulator for open quantum dynamics [0.0]
  We propose an innovative method to investigate directly the properties of a time-dependent density operator $hatrho(t)$. We can directly compute the expectation value of the commutation relation and thus of the rate of change of $hatrho(t)$. A simple but important example is demonstrated in the single-qubit case and we discuss extension of the method for practical quantum simulation with many qubits.
  arXiv  Detail & Related papers  (2022-06-01T16:03:43Z)
• Propagation of errors and quantitative quantum simulation with quantum advantage [0.0]
  Many-body quench dynamics is one of the most promising candidates for early practical quantum advantage. We analyse the requirements for quantitatively reliable quantum simulation beyond the capabilities of existing classical methods. We conclude for models that are directly implementable that regimes of practical quantum advantage are attained in current experiments with analogue simulators.
  arXiv  Detail & Related papers  (2022-04-28T17:05:51Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Quantum algorithms for estimating quantum entropies [6.211541620389987]
  We propose quantum algorithms to estimate the von Neumann and quantum $alpha$-R'enyi entropies of an fundamental quantum state. We also show how to efficiently construct the quantum entropy circuits for quantum entropy estimation using single copies of the input state.
  arXiv  Detail & Related papers  (2022-03-04T15:44:24Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• Quantum advantage for computations with limited space [6.327095331866255]
  We consider space-restricted computations, where input is a read-only memory and only one (qu)bit can be computed on. We experimentally demonstrate computations of $3$-, $4$-, $5$-, and $6$- by quantum circuits, leveraging custom two-qubit gates.
  arXiv  Detail & Related papers  (2020-08-14T17:31:12Z)

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.