Measuring the largest coefficients of a quantum state

• URL: http://arxiv.org/abs/2605.00341v1
• Date: Fri, 01 May 2026 01:49:53 GMT
• Title: Measuring the largest coefficients of a quantum state
• Abstract summary: We introduce a hierarchical algorithm for identifying the largest Pauli coefficients of an unknown $n$-qubit quantum state.<n>Our work addresses an open problem in Pauli sampling and provides a practical tool for the targeted characterization of structured quantum states.
• Score: 0.5872014229110214
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a hierarchical algorithm for identifying the largest Pauli coefficients of an unknown $n$-qubit quantum state. The algorithm traverses a prefix-based tree whose nodes represent partial sums of squared Pauli coefficients, always expanding branches with the largest estimated weight and discarding the rest. Node weights are estimated using Bell sampling on two copies of the state, or alternatively via SWAP tests on subsystems. We analyze the sample complexity of each node estimation and derive bounds on the total number of nodes expanded as a function of the desired number of coefficients and the state's purity. For states admitting a sparse representation in the Pauli basis, the algorithm achieves a good reconstruction of the dominant components without requiring full state tomography. We validate the method with numerical simulations on Pauli-singleton states and random stabilizer states, showing that the algorithm's performance is competitive with other methods for structured states. Our work addresses an open problem in Pauli sampling and provides a practical tool for the targeted characterization of structured quantum states.

Related papers

• Correlating noise floor with magic and entanglement in Pauli product states [37.69303106863453]
  We show the ability to recover resources specific to quantum computing from noisy states generated by Pauli product formulas.<n>The fidelity of purified states represents the noise floor of a given computation.<n>We experimentally validate these findings by collecting classical shadow data for a range of small circuits.
  arXiv  Detail & Related papers  (2025-05-07T19:24:00Z)
• Streaming quantum state purification for general mixed states [2.412198129884481]
  We show that the same algorithm applies much more broadly, enabling the purification of arbitrary mixed states with a nondegenerate principal eigenvalue.<n>In the first approach, we show that, given the largest two eigenvalues, the depolarized noise is the most difficult noise to purify.<n>In the second approach, we provide a new and direct analysis for the performance of purification.
  arXiv  Detail & Related papers  (2025-03-28T17:31:13Z)
• Reducing the sampling complexity of energy estimation in quantum many-body systems using empirical variance information [45.18582668677648]
  We consider the problem of estimating the energy of a quantum state preparation for a given Hamiltonian in Pauli decomposition.<n>We construct an adaptive estimator using the state's actual variance.
  arXiv  Detail & Related papers  (2025-02-03T19:00:01Z)
• Classically estimating observables of noiseless quantum circuits [36.688706661620905]
  We present a classical algorithm for estimating expectation values of arbitrary observables on random unstructured quantum circuits.<n>Our results show that estimating observables of quantum circuits exhibiting chaotic and locally scrambling behavior is classically tractable across all geometries.
  arXiv  Detail & Related papers  (2024-09-03T08:44:33Z)
• Reducing Depth and Measurement Weights in Pauli-based Computation [0.0]
  Pauli-based computation (PBC) is a universal measurement-based quantum computation model steered by an adaptive sequence of independent and compatible Pauli measurements on magic-state qubits. Here, we propose several new ways of decreasing the weight of the Pauli measurements and their associated textsccnot complexity. We also demonstrate how to reduce this model's computational depth.
  arXiv  Detail & Related papers  (2024-08-07T18:00:11Z)
• Quantum Search Approaches to Sampling-Based Motion Planning [0.0]
  We present a novel formulation of traditional sampling-based motion planners as database-oracle structures that can be solved via quantum search algorithms. We consider two complementary scenarios: for simpler sparse environments, we formulate the Quantum Full Path Search Algorithm (q-FPS), which creates a superposition of full random path solutions. For dense unstructured environments, we formulate the Quantum Rapidly Exploring Random Tree algorithm, q-RRT, that creates quantum superpositions of possible parent-child connections.
  arXiv  Detail & Related papers  (2023-04-10T19:12:25Z)
• 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)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Efficient Deterministic Preparation of Quantum States Using Decision Diagrams [4.782945936674342]
  In this paper, we consider quantum states that can be efficiently represented by (reduced) decision diagrams. We design an algorithm that utilises the structure of decision diagrams to prepare their associated quantum states.
  arXiv  Detail & Related papers  (2022-06-17T07:15:35Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Classical shadows with Pauli-invariant unitary ensembles [0.0]
  We consider the class of Pauli-invariant unitary ensembles that are invariant under multiplication by a Pauli operator. Our results pave the way for more efficient or robust protocols for predicting important properties of quantum states.
  arXiv  Detail & Related papers  (2022-02-07T15:06:30Z)

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.