Efficient quantum state tomography with Chebyshev polynomials

• URL: http://arxiv.org/abs/2509.02112v2
• Date: Thu, 11 Sep 2025 15:35:31 GMT
• Title: Efficient quantum state tomography with Chebyshev polynomials
• Authors: Hao Su, Shiying Xiong, Yue Yang,
• Abstract summary: We introduce an approximate tomography method for pure quantum states encoding complex-valued functions.<n>By treating the truncation order of the Chebyshevs as a controllable parameter, the method provides a practical balance between efficiency and accuracy.
• Score: 25.72183861471451
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Quantum computing shows promise for addressing computationally intensive problems but is constrained by the exponential resource requirements of general quantum state tomography (QST), which fully characterizes quantum states through parameter estimation. We introduce the QST with Chebyshev polynomials, an approximate tomography method for pure quantum states encoding complex-valued functions. This method reformulates tomography as the estimation of Chebyshev expansion coefficients, expressed as inner products between the target quantum state and Chebyshev basis functions, measured using the Hadamard test circuit. By treating the truncation order of the Chebyshev polynomials as a controllable parameter, the method provides a practical balance between efficiency and accuracy. For quantum states encoding functions dominated by large-scale features, such as those representing fluid flow fields, appropriate truncation enables faithful reconstruction of the dominant components via quantum circuits with linear depth, while keeping both measurement repetitions and post-processing independent of qubit count, in contrast to the exponential scaling of full measurement-based QST methods. Validation on analytic functions and numerically generated flow-field data demonstrates accurate reconstruction and effective extraction of large-scale features, indicating the method's suitability for systems governed by macroscopic dynamics.

Related papers

• Qumode-Based Variational Quantum Eigensolver for Molecular Excited States [43.148034499498586]
  We introduce the Qumode Subspace Variational Quantum Eigensolver (QSS-VQE), a hybrid quantum-classical algorithm for computing molecular excited states.<n>We demonstrate the performance of QSS-VQE through simulations of molecular excited states, including dihydrogen and a conical intersection in cytosine.
  arXiv  Detail & Related papers  (2025-09-05T00:53:51Z)
• Grassmann Variational Monte Carlo with neural wave functions [45.935798913942904]
  We formalize the framework introduced by Pfau et al.citepfau2024accurate in terms of Grassmann geometry of the Hilbert space.<n>We validate our approach on the Heisenberg quantum spin model on the square lattice, achieving highly accurate energies and physical observables for a large number of excited states.
  arXiv  Detail & Related papers  (2025-07-14T13:53:13Z)
• Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
  We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
  arXiv  Detail & Related papers  (2025-07-09T15:22:17Z)
• Quantum State Readout via Overlap-Based Feature Extraction [0.0]
  The proposed method involves a quantum state readout for both the raw and absolute values of the amplitudes in the quantum state.<n>Preliminary numerical simulations were performed to reconstruct the grid-based wave function and X-ray absorption spectra from a quantum state.
  arXiv  Detail & Related papers  (2025-05-13T14:30:42Z)
• PolyQROM: Orthogonal-Polynomial-Based Quantum Reduced-Order Model for Flow Field Analysis [5.588958112139646]
  Quantum computing promises exponential acceleration for fluid flow simulations.<n> measurement overhead required to extract flow features from quantum-encoded flow field data undermines this advantage.
  arXiv  Detail & Related papers  (2025-04-30T12:14:08Z)
• Tensor Cross Interpolation of Purities in Quantum Many-Body Systems [0.0]
  In quantum many-body systems the exponential scaling of the Hilbert space with the number of degrees of freedom renders a complete state characterization.<n>Recently, a compact way of storing subregions' purities by encoding them as amplitudes of a fictitious quantum wave function, known as entanglement feature, was proposed.<n>In this work, we demonstrate that the entanglement feature can be efficiently defining using only a amount of samples in the number of degrees of freedom.
  arXiv  Detail & Related papers  (2025-03-21T15:33:00Z)
• Entanglement scaling in matrix product state representation of smooth functions and their shallow quantum circuit approximations [0.28917933888634956]
  matrix product state (MPS) methods emerged as the most promising approach for constructing shallow quantum circuits.<n>We derive rigorous expansions for the decay of entanglement across bonds in the MPS representation depending on the smoothness of the input function.<n>We construct an improved MPS-based algorithm yielding shallow and accurate encoding quantum circuits.
  arXiv  Detail & Related papers  (2024-12-06T17:31:35Z)
• 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)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response.<n>We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Potential and limitations of quantum extreme learning machines [55.41644538483948]
  We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements. Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
  arXiv  Detail & Related papers  (2022-10-03T09:32:28Z)

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.