Multipass Quantum Process Tomography: Precision and Accuracy Enhancement

• URL: http://arxiv.org/abs/2402.04128v1
• Date: Tue, 6 Feb 2024 16:26:18 GMT
• Title: Multipass Quantum Process Tomography: Precision and Accuracy Enhancement
• Authors: Stancho G. Stanchev and Nikolay V. Vitanov
• Abstract summary: We introduce a method to enhance the precision and accuracy of Quantum Process Tomography (QPT) Instead of performing QPT solely on a single gate, we propose performing QPT on a sequence of multiple applications of the same gate. We use the proposed method to experimentally determine the PTM and the fidelity of the CNOT gate on the quantum processor ibmq_manila (Falcon r5.11L)
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a method to enhance the precision and accuracy of Quantum Process Tomography (QPT) by mitigating the errors caused by state preparation and measurement (SPAM), readout and shot noise. Instead of performing QPT solely on a single gate, we propose performing QPT on a sequence of multiple applications of the same gate. The method involves the measurement of the Pauli transfer matrix (PTM) by standard QPT of the multipass process, and then deduce the single-process PTM by two alternative approaches: an iterative approach which in theory delivers the exact result for small errors, and a linearized approach based on solving the Sylvester equation. We examine the efficiency of these two approaches through simulations on IBM Quantum using ibmq_qasm_simulator. Compared to the Randomized Benchmarking type of methods, the proposed method delivers the entire PTM rather than a single number (fidelity). Compared to standard QPT, our method delivers PTM with much higher accuracy and precision because it greatly reduces the SPAM, readout and shot noise errors. We use the proposed method to experimentally determine the PTM and the fidelity of the CNOT gate on the quantum processor ibmq_manila (Falcon r5.11L).

Related papers

• Adaptive variational quantum dynamics simulations with compressed circuits and fewer measurements [4.2643127089535104]
  We show an improved version of the adaptive variational quantum dynamics simulation (AVQDS) method, which we call AVQDS(T) The algorithm adaptively adds layers of disjoint unitary gates to the ansatz circuit so as to keep the McLachlan distance, a measure of the accuracy of the variational dynamics, below a fixed threshold. We also show a method based on eigenvalue truncation to solve the linear equations of motion for the variational parameters with enhanced noise resilience.
  arXiv  Detail & Related papers  (2024-08-13T02:56:43Z)
• QuTracer: Mitigating Quantum Gate and Measurement Errors by Tracing Subsets of Qubits [8.54896613102673]
  Quantum error mitigation plays a crucial role in the current noisy-intermediate-scale-quantum (NISQ) era. We propose QuTracer, a framework designed to mitigate both gate and measurement errors in subsets of qubits.
  arXiv  Detail & Related papers  (2024-04-30T17:06:04Z)
• Designing optimal protocols in Bayesian quantum parameter estimation with higher-order operations [0.0]
  A major task in quantum sensing is to design the optimal protocol, i.e., the most precise one. Here, we focus on the single-shot Bayesian setting, where the goal is to find the optimal initial state of the probe. We leverage the formalism of higher-order operations to develop a method that finds a protocol that is close to the optimal one with arbitrary precision.
  arXiv  Detail & Related papers  (2023-11-02T18:00:36Z)
• Fermionic Adaptive Sampling Theory for Variational Quantum Eigensolvers [0.0]
  ADAPT-VQE suffers from a significant measurement overhead when estimating the importance of operators in the wave function. We proposeFAST-VQE, a method for selecting operators based on importance metrics solely derived from the populations of Slater determinants in the wave function.
  arXiv  Detail & Related papers  (2023-03-13T18:57:18Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Gradient-descent quantum process tomography by learning Kraus operators [63.69764116066747]
  We perform quantum process tomography (QPT) for both discrete- and continuous-variable quantum systems. We use a constrained gradient-descent (GD) approach on the so-called Stiefel manifold during optimization to obtain the Kraus operators. The GD-QPT matches the performance of both compressed-sensing (CS) and projected least-squares (PLS) QPT in benchmarks with two-qubit random processes.
  arXiv  Detail & Related papers  (2022-08-01T12:48:48Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Parameterized process characterization with reduced resource requirements [0.5735035463793008]
  This work proposes an alternative approach that requires significantly fewer resources for unitary process characterization without prior knowledge of the process. By measuring the quantum process as rotated through the X and Y axes on the Sphere Bloch, we can acquire enough information to reconstruct the quantum process matrix $chi$ and measure its fidelity. We demonstrate in numerical experiments that the method can improve gate fidelity via a noise reduction in the imaginary part of the process matrix, along with a stark decrease in the number of experiments needed to perform the characterization.
  arXiv  Detail & Related papers  (2021-09-22T17:41:32Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)

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.