State-to-Hamiltonian conversion with a few copies

• URL: http://arxiv.org/abs/2509.14791v1
• Date: Thu, 18 Sep 2025 09:41:04 GMT
• Title: State-to-Hamiltonian conversion with a few copies
• Authors: Kaito Wada, Jumpei Kato, Hiroyuki Harada, Naoki Yamamoto,
• Abstract summary: Density matrix exponentiation (DME) is a procedure that converts an unknown quantum state into the Hamiltonian evolution.<n>We propose a procedure called the virtual DME that achieves $mathcalO(log(1/varepsilon)$ or $mathcalO(1)$ state copies, by using non-physical processes.<n>We numerically verify this small constant overhead together with the exponential reduction of copy count in the quantum principal component analysis task.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Density matrix exponentiation (DME) is a general procedure that converts an unknown quantum state into the Hamiltonian evolution. This enables state-dependent operations and can reveal nontrivial properties of the state, among other applications, without full tomography. However, it has been proven that for any physical process, the DME requires $\Theta(1/\varepsilon)$ state copies in error $\varepsilon$. In this work, we go beyond the lower bound and propose a procedure called the virtual DME that achieves $\mathcal{O}(\log(1/\varepsilon))$ or $\mathcal{O}(1)$ state copies, by using non-physical processes. Using the virtual DME in place of its conventional counterpart realizes a general-purpose quantum algorithm for property estimation, that achieves exponential circuit-depth reductions over existing protocols across tasks including quantum principal component analysis, quantum emulator, calculation of nonlinear functions such as entropy, and linear system solver with quantum precomputation. In such quantum algorithms, the non-physical process for virtual DME can be effectively simulated via simple classical post-processing while retaining a near-unity measurement overhead. We numerically verify this small constant overhead together with the exponential reduction of copy count in the quantum principal component analysis task. The number of state copies used in our algorithm essentially saturates the theoretical lower bound we proved.

Related papers

• Explicit Formulas for Estimating Trace of Reduced Density Matrix Powers via Single-Circuit Measurement Probabilities [10.43657724071918]
  We propose a universal framework to simultaneously estimate the traces of the $2$nd to the $n$th powers of a reduced density matrix.<n>We develop two algorithms: a purely quantum method and a hybrid quantum-classical approach combining Newton-Girard iteration.<n>We explore various applications including the estimation of nonlinear functions and the representation of entanglement measures.
  arXiv  Detail & Related papers  (2025-07-23T01:41:39Z)
• Digital quantum simulation of squeezed states via enhanced bosonic encoding in a superconducting quantum processor [33.56337116542515]
  We present a fully digital approach for simulating single-mode squeezed states on a superconducting quantum processor.<n>By mapping up to 2n photonic Fock states onto n qubits, our framework leverages Gray-code-based encodings to reduce gate overhead.<n>We further optimize resource usage by restricting the simulation on Fock states with even number of photons only.
  arXiv  Detail & Related papers  (2025-05-16T06:02:25Z)
• Hadamard Random Forest: Reconstructing real-valued quantum states with exponential reduction in measurement settings [1.857570444541311]
  We introduce a readout method for real-valued quantum states that reduces measurement settings required for state vector reconstruction to $O(N_mathrmq)$.<n>We experimentally validate our method up to 10 qubits on the latest available IBM quantum processor and demonstrate that it accurately extracts key properties such as entanglement and magic.
  arXiv  Detail & Related papers  (2025-05-09T22:12:54Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• 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)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Quantum state tomography with tensor train cross approximation [84.59270977313619]
  We show that full quantum state tomography can be performed for such a state with a minimal number of measurement settings. Our method requires exponentially fewer state copies than the best known tomography method for unstructured states and local measurements.
  arXiv  Detail & Related papers  (2022-07-13T17:56:28Z)
• 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)
• 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)
• Holographic quantum algorithms for simulating correlated spin systems [0.0]
  We present a suite of "holographic" quantum algorithms for efficient ground-state preparation and dynamical evolution of correlated spin-systems. The algorithms exploit the equivalence between matrix-product states (MPS) and quantum channels, along with partial measurement and qubit re-use. As a demonstration of the potential resource savings, we implement a holoVQE simulation of the antiferromagnetic Heisenberg chain on a trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2020-05-06T18:00:01Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.