Robust Lindbladian Tomography for Cyclic Quantum Gates

• URL: http://arxiv.org/abs/2503.12304v1
• Date: Sun, 16 Mar 2025 00:26:14 GMT
• Title: Robust Lindbladian Tomography for Cyclic Quantum Gates
• Authors: Takanori Sugiyama,
• Abstract summary: We develop new theoretical tools for analyzing effects of an EAC on Lindbladian error of cyclic gates in the EAC for arbitrary finite-dimensional system.<n>We also propose a tomographic protocol for the Lindbladian errors of cyclic gates based on the linear approximation, named Robust Lindbladian Tomography (RLT)
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Precise characterization of noisy quantum operations plays an important role for realizing further accurate operations. Quantum tomography is a popular class of characterization methods, and several advanced methods in the class use error amplification circuit (EAC), a repetition of a sequence of quantum gates, for increasing their estimation precision. Here, we develop new theoretical tools for analyzing effects of an EAC on Lindbladian error of cyclic gates in the EAC for arbitrary finite-dimensional system, which takes non-commutativity between different gates or between ideal and error parts of a gate, periodic properties of ideal gates, and repetition of gate sequence into consideration within a linear approximation. We also propose a tomographic protocol for the Lindbladian errors of cyclic gates based on the linear approximation, named Robust Lindbladian Tomography (RLT). The numerical optimization at data-processing of the proposed method reduces from nonlinear to linear (positive semi-definite) programming. Therefore, compared to the original optimization problem, the reduced one is solvable more efficiently and stably, although its numerical cost grows exponentially with respect to the number of qubits, which is the same as other tomographic methods.

Related papers

• Preparation Circuits for Matrix Product States by Classical Variational Disentanglement [0.0]
  We study the classical compilation of quantum circuits for the preparation of matrix product states (MPS) Our algorithm represents a near-term alternative to previous sequential approaches by reverse application of a disentangler. We show numerical results for ground states of one-dimensional, local Hamiltonians as well as artificially spread out entanglement among multiple qubits.
  arXiv  Detail & Related papers  (2025-04-30T04:13:01Z)
• 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)
• Characterizing Coherent Errors using Matrix-Element Amplification [0.27907340310431333]
  Matrix-Element Amplification using Dynamical Decoupling (MEADD)<n>We experimentally demonstrate that MEADD surpasses the accuracy and precision of existing characterization protocols for estimating systematic errors in single- and two-qubit gates.<n>We also use it to characterize coherent crosstalk in the processor which was previously too small to detect reliably.
  arXiv  Detail & Related papers  (2024-04-19T00:05:10Z)
• Optimal Algorithms for the Inhomogeneous Spiked Wigner Model [89.1371983413931]
  We derive an approximate message-passing algorithm (AMP) for the inhomogeneous problem. We identify in particular the existence of a statistical-to-computational gap where known algorithms require a signal-to-noise ratio bigger than the information-theoretic threshold to perform better than random.
  arXiv  Detail & Related papers  (2023-02-13T19:57:17Z)
• Witnessing entanglement in trapped-ion quantum error correction under realistic noise [41.94295877935867]
  Quantum Error Correction (QEC) exploits redundancy by encoding logical information into multiple physical qubits. We present a detailed microscopic error model to estimate the average gate infidelity of two-qubit light-shift gates used in trapped-ion platforms. We then apply this realistic error model to quantify the multipartite entanglement generated by circuits that act as QEC building blocks.
  arXiv  Detail & Related papers  (2022-12-14T20:00:36Z)
• An Accelerated Doubly Stochastic Gradient Method with Faster Explicit Model Identification [97.28167655721766]
  We propose a novel doubly accelerated gradient descent (ADSGD) method for sparsity regularized loss minimization problems. We first prove that ADSGD can achieve a linear convergence rate and lower overall computational complexity.
  arXiv  Detail & Related papers  (2022-08-11T22:27:22Z)
• Generating quantum feature maps for SVM classifier [0.0]
  We present and compare two methods of generating quantum feature maps for quantum-enhanced support vector machine. The first method is a genetic algorithm with multi-objective fitness function using penalty method, which incorporates maximizing the accuracy of classification. The second method uses variational quantum circuit, focusing on how to contruct the ansatz based on unitary matrix decomposition.
  arXiv  Detail & Related papers  (2022-07-23T07:28:23Z)
• Analytical and experimental study of center line miscalibrations in M\o lmer-S\o rensen gates [51.93099889384597]
  We study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate. We compute the gate evolution operator which allows us to obtain relevant key properties. We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2021-12-10T10:56:16Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Understanding Implicit Regularization in Over-Parameterized Single Index Model [55.41685740015095]
  We design regularization-free algorithms for the high-dimensional single index model. We provide theoretical guarantees for the induced implicit regularization phenomenon.
  arXiv  Detail & Related papers  (2020-07-16T13:27:47Z)

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.