Enhanced Compressive Threshold Quantum State Tomography for Qudit Systems

• URL: http://arxiv.org/abs/2502.10031v1
• Date: Fri, 14 Feb 2025 09:18:36 GMT
• Title: Enhanced Compressive Threshold Quantum State Tomography for Qudit Systems
• Authors: Giovanni Garberoglio, Maurizio Dapor, Diego Maragnano, Marco Liscidini, Daniele Binosi,
• Abstract summary: We propose an efficient quantum state tomography method inspired by compressed sensing and threshold quantum state tomography.<n>We validate our algorithm with simulations on IBMQ and demonstrate the efficient and accurate reconstruction of $Nleq7$ qubit systems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose an efficient quantum state tomography method inspired by compressed sensing and threshold quantum state tomography that can drastically reduce the number of measurement settings to reconstruct the density matrix of an $N$-qudit system. We validate our algorithm with simulations on IBMQ and demonstrate the efficient and accurate reconstruction of $N\leq7$ qubit systems, reproducing GHZ, $W$, and random states with $O(1)$, $O(N^2)$, and $O(N)$ settings.

Related papers

• Augmenting Simulated Noisy Quantum Data Collection by Orders of Magnitude Using Pre-Trajectory Sampling with Batched Execution [47.60253809426628]
  We present the Pre-Trajectory Sampling technique, increasing efficiency and utility of trajectory simulations by tailoring error types. We generate massive datasets of one trillion and one million shots, respectively.
  arXiv  Detail & Related papers  (2025-04-22T22:36:18Z)
• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  Conditional measurement is involved to avoid small success probability in ancilla measurement. The objective function for the algorithm can be obtained probabilistically via measurement of the state of a one-qubit subsystem.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• Low-depth quantum symmetrization [1.5566524830295307]
  We present the first quantum algorithm for the general symmetrization problem. Our algorithm, based on (quantum) sorting networks, uses $O(log n)$ depth and $O(nlog m)$ ancilla qubits. We also propose an $O(log2 n)$-depth quantum algorithm to transform second-quantized states to first-quantized states.
  arXiv  Detail & Related papers  (2024-11-06T16:00:46Z)
• Error-mitigated fermionic classical shadows on noisy quantum devices [0.3775283002059579]
  Classical shadow (CS) algorithms offer a solution by reducing the number of quantum state copies needed. We propose an error-mitigated CS algorithm assuming gate-independent, time-stationary, and Markovian (GTM) noise. Our algorithm efficiently estimates $k$-RDMs with $widetildemathcal O(knk)$ state copies and $widetildemathcal O(sqrtn)$ calibration measurements for GTM noise.
  arXiv  Detail & Related papers  (2023-10-19T13:27:19Z)
• Efficient Quantum Mixed-State Tomography with Unsupervised Tensor Network Machine Learning [13.02007068572165]
  We propose an efficient mixed-state quantum state scheme based on the locally purified state ansatz. We demonstrate the efficiency and robustness of our scheme on various randomly initiated states with different purities. Our work reveals the prospects of applying network state ansatz and the machine learning approaches for efficient QST of many-body states.
  arXiv  Detail & Related papers  (2023-08-14T02:35:23Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Efficient Quantum Simulation of Electron-Phonon Systems by Variational Basis State Encoder [12.497706003633391]
  Digital quantum simulation of electron-phonon systems requires truncating infinite phonon levels into $N$ basis states. We propose a variational basis state encoding algorithm that reduces the scaling of the number of qubits and quantum gates.
  arXiv  Detail & Related papers  (2023-01-04T04:23:53Z)
• 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)
• 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)
• A quantum algorithm for training wide and deep classical neural networks [72.2614468437919]
  We show that conditions amenable to classical trainability via gradient descent coincide with those necessary for efficiently solving quantum linear systems. We numerically demonstrate that the MNIST image dataset satisfies such conditions. We provide empirical evidence for $O(log n)$ training of a convolutional neural network with pooling.
  arXiv  Detail & Related papers  (2021-07-19T23:41:03Z)
• 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.