Near-Optimal Simultaneous Estimation of Quantum State Moments

• URL: http://arxiv.org/abs/2509.24842v1
• Date: Mon, 29 Sep 2025 14:23:26 GMT
• Title: Near-Optimal Simultaneous Estimation of Quantum State Moments
• Authors: Xiao Shi, Jiyu Jiang, Xian Wu, Jingu Xie, Hongshun Yao, Xin Wang,
• Abstract summary: 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.
• Score: 7.1834855718325805
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Estimating nonlinear properties such as R\'enyi entropies and observable-weighted moments serves as a central strategy for spectrum spectroscopy, which is fundamental to property prediction and analysis in quantum information science, statistical mechanics, and many-body physics. However, existing approaches are susceptible to noise and require significant resources, making them challenging for near-term quantum hardware. In this work, we introduce a framework for resource-efficient simultaneous estimation of quantum state moments via qubit reuse. For an $m$-qubit quantum state $\rho$, our method achieves the simultaneous estimation of the full hierarchy of moments $\text{Tr}(\rho^2), \dots, \text{Tr}(\rho^k)$, as well as arbitrary polynomial functionals and their observable-weighted counterparts. By leveraging qubit reset operations, our core circuit for simultaneous moment estimation requires only $2m+1$ physical qubits and $\mathcal{O}(k)$ CSWAP gates, achieving a near-optimal sample complexity of $\mathcal{O}(k \log k / \varepsilon^2)$. 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. Furthermore, we show the protocol's viability on near-term quantum hardware by experimentally measuring higher-order R\'enyi entropy on a superconducting quantum processor. Our method provides a scalable and resource-efficient route to quantum system characterization and spectroscopy on near-term quantum hardware.

Related papers

• Identifying quantum coherence in quantum annealers [37.067444579637076]
  We use many-body coherent oscillations (MBCO) as a diagnostic for the identification of system-wide coherence in analog quantum simulators.<n>This work gives a general roadmap for the search for quantum coherence in noisy, large-scale quantum platforms.
  arXiv  Detail & Related papers  (2026-02-24T20:39:41Z)
• 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)
• Provably Efficient Quantum Thermal State Preparation via Local Driving [0.0]
  The thermal density matrix $rho_betapropto e-beta H$ corresponding to a given Hamiltonian $H$ is a task of central interest across quantum many-body physics.<n>Here, we propose a scheme for approximately preparing quantum thermal states that only requires the [repeated] implementation of three readily available ingredients.
  arXiv  Detail & Related papers  (2025-05-28T19:48:07Z)
• Adaptive-depth randomized measurement for fermionic observables [0.3775283002059579]
  We introduce an adaptive-depth fermionic classical shadow (ADFCS) protocol designed to reduce circuit depth while maintaining the estimation accuracy.<n>Our findings suggest that ADFCS can enable more efficient quantum simulations, reducing circuit depth while preserving the fidelity of quantum state estimations.
  arXiv  Detail & Related papers  (2025-01-16T14:47:10Z)
• Quantum Homogenization as a Quantum Steady State Protocol on NISQ Hardware [42.52549987351643]
  Quantum homogenization is a reservoir-based quantum state approximation protocol.<n>We extend the standard quantum homogenization protocol to the dynamically-equivalent ($mathttSWAP$)$alpha$ formulation.<n>We show that our proposed protocol yields a completely positive, trace preserving (CPTP) map under which the code subspace is correctable.
  arXiv  Detail & Related papers  (2024-12-19T05:50:54Z)
• Sample-Efficient Estimation of Nonlinear Quantum State Functions [5.641998714611475]
  We introduce the quantum state function (QSF) framework by extending the SWAP test via linear combination of unitaries and parameterized quantum circuits.<n>Our framework enables the implementation of arbitrarily normalized degree-$n$ functions of quantum states with precision.<n>We apply QSF for developing quantum algorithms for fundamental tasks, including entropy, fidelity, and eigenvalue estimations.
  arXiv  Detail & Related papers  (2024-12-02T16:40:17Z)
• Sequency Hierarchy Truncation (SeqHT) for Adiabatic State Preparation and Time Evolution in Quantum Simulations [1.1706754930853664]
  We introduce the Sequency Hierarchy Truncation (SeqHT) scheme for reducing the resources required for state preparation and time evolution in quantum simulations.<n>For the systems we have examined, observables computed in sequency-truncated wavefunctions are found to step-wise converge to their exact values with increasing cutoff sequency.
  arXiv  Detail & Related papers  (2024-07-18T18:08:40Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Quantum State Tomography for Matrix Product Density Operators [28.799576051288888]
  Reconstruction of quantum states from experimental measurements is crucial for the verification and benchmarking of quantum devices. Many physical quantum states, such as states generated by noisy, intermediate-scale quantum computers, are usually structured. We establish theoretical guarantees for the stable recovery of MPOs using tools from compressive sensing and the theory of empirical processes.
  arXiv  Detail & Related papers  (2023-06-15T18:23:55Z)
• Quantum Thermal State Preparation [39.91303506884272]
  We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations. We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states. Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
  arXiv  Detail & Related papers  (2023-03-31T17:29:56Z)
• 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)

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.