Procrustes Tomography -- reconstructing noisy quantum channels made easy

• URL: http://arxiv.org/abs/2607.07988v1
• Date: Wed, 08 Jul 2026 23:33:47 GMT
• Title: Procrustes Tomography -- reconstructing noisy quantum channels made easy
• Abstract summary: A comprehensive understanding of the noisy quantum dynamics is essential in interpreting the computational output.<n>We introduce an efficient method -- Procrustes tomography -- that outperforms established methods in a number of aspects.<n>We demonstrate the utility of the method for representative examples of noisy quantum channels.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: What is the most expensive part of quantum device characterization? Clearly, the answer is quantum process tomography. However, especially for noisy intermediate-scale quantum (NISQ) computers, a comprehensive understanding of the noisy quantum dynamics is essential in interpreting the computational output. In this work, we introduce an efficient method -- Procrustes tomography -- that outperforms established methods in a number of aspects. After a pedagogical and constructive introduction, we demonstrate the utility of the method for representative examples of noisy quantum channels.

Related papers

• Efficient Learning Algorithms for Noisy Quantum State and Process Tomography [17.414887413731385]
  We introduce a provably efficient and structure-agnostic learning framework for noisy $n$-qubit quantum circuits.<n>Results provide a scalable and practically relevant route toward characterizing large-scale noisy quantum devices.
  arXiv  Detail & Related papers  (2026-03-02T06:50:59Z)
• Quantum process tomography of a compressed time evolution circuit on superconducting quantum processors [0.0]
  We employ state-of-the-art quantum process tomography (QPT) techniques to characterize the noise channels of IBM quantum processors.<n>We find that the compressed circuit systematically yields larger eigenvalue moduli, demonstrating better noise resilience.
  arXiv  Detail & Related papers  (2025-09-29T18:00:51Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Learning Orthogonal Random Unitary Channels with Contracted Quantum Approaches and Simplex Optimization [41.94295877935867]
  We present a procedure for learning a class of random unitary channels on a quantum computer.<n>Our approach involves a multi-objective, Pauli- and unitary-based minimization, and allows for learning locally equivalent channels.
  arXiv  Detail & Related papers  (2025-01-28T19:02:52Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Quantivine: A Visualization Approach for Large-scale Quantum Circuit Representation and Analysis [31.203764035373677]
  We develop Quantivine, an interactive system for exploring and understanding quantum circuits. A series of novel circuit visualizations are designed to uncover contextual details such as qubit provenance, parallelism, and entanglement. The effectiveness of Quantivine is demonstrated through two usage scenarios of quantum circuits with up to 100 qubits.
  arXiv  Detail & Related papers  (2023-07-18T04:51:28Z)
• Qafny: A Quantum-Program Verifier [39.47005122712576]
  We present Qafny, an automated proof system for verifying quantum programs. At its core, Qafny uses a type-guided quantum proof system that translates quantum operations to classical array operations. We show how Qafny can efficiently verify important quantum algorithms, including quantum-walk algorithms, Grover's algorithm, and Shor's algorithm.
  arXiv  Detail & Related papers  (2022-11-11T18:50:52Z)
• Noisy Quantum Kernel Machines [58.09028887465797]
  An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. We study how dissipation and decoherence affect their performance. We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
  arXiv  Detail & Related papers  (2022-04-26T09:52:02Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Shadow process tomography of quantum channels [0.6554326244334866]
  Quantum process tomography is a critical capability for building quantum computers, enabling quantum networks, and understanding quantum sensors. The recent field of shadow tomography, applied to quantum states, has demonstrated the ability to extract key information about a state with onlyly many measurements. We make use of Choi isomorphism to directly apply rigorous bounds from shadow state tomography to shadow process tomography, and we find additional bounds on the number of measurements that are unique to process tomography.
  arXiv  Detail & Related papers  (2021-10-07T17:16:41Z)
• Non-Markovian Quantum Process Tomography [0.0]
  We introduce a generalisation of quantum process tomography, which we call process tensor tomography. We detail the experimental requirements, construct the necessary post-processing algorithms for maximum-likelihood estimation. We show how its predictive control can be used to substantially improve multi-time circuit fidelities on superconducting quantum devices.
  arXiv  Detail & Related papers  (2021-06-22T12:44:54Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Machine learning of noise-resilient quantum circuits [0.8258451067861933]
  Noise mitigation and reduction will be crucial for obtaining useful answers from near-term quantum computers. We present a general framework based on machine learning for reducing the impact of quantum hardware noise on quantum circuits. Our method, called noise-aware circuit learning (NACL), applies to circuits designed to compute a unitary transformation, prepare a set of quantum states, or estimate an observable of a many-qubit state.
  arXiv  Detail & Related papers  (2020-07-02T15:43:32Z)

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.