Scaling of errors in digitized counterdiabatic driving

• URL: http://arxiv.org/abs/2303.04235v1
• Date: Tue, 7 Mar 2023 20:56:14 GMT
• Title: Scaling of errors in digitized counterdiabatic driving
• Authors: Takuya Hatomura
• Abstract summary: We study errors caused by digitization of shortcuts to adiabaticity by counterdiabatic driving. We find possibility of error scaling $mathcalO(M-2)$ with the number of time slices $M$, whereas worse error scaling $mathcalO(M-1)$ is predicted in the conventional theory of the first-order Suzuki-Trotter decomposition.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study errors caused by digitization of shortcuts to adiabaticity by counterdiabatic driving. We find possibility of error scaling $\mathcal{O}(M^{-2})$ with the number of time slices $M$, whereas worse error scaling $\mathcal{O}(M^{-1})$ is predicted in the conventional theory of the first-order Suzuki-Trotter decomposition. We point out this possibility by considering a state-dependent error bound and confirm emergence of this error scaling $\mathcal{O}(M^{-2})$ by numerical simulation. Moreover, we numerically show that intermediate error scaling can be observed in digitization of approximate counterdiabatic driving. These results reveal usefulness of digitized counterdiabatic driving from the viewpoints of both cost and performance.

Related papers

• Trotter error time scaling separation via commutant decomposition [6.418044102466421]
  Suppressing the Trotter error in dynamical quantum simulation typically requires running deeper circuits. We introduce a general framework of commutant decomposition that separates disjoint error components that have fundamentally different scaling with time. We show that this formalism not only straightforwardly reproduces previous results but also provides a better error estimate for higher-order product formulas.
  arXiv  Detail & Related papers  (2024-09-25T05:25:50Z)
• Scaling Laws in Linear Regression: Compute, Parameters, and Data [86.48154162485712]
  We study the theory of scaling laws in an infinite dimensional linear regression setup. We show that the reducible part of the test error is $Theta(-(a-1) + N-(a-1)/a)$. Our theory is consistent with the empirical neural scaling laws and verified by numerical simulation.
  arXiv  Detail & Related papers  (2024-06-12T17:53:29Z)
• Demonstrating a long-coherence dual-rail erasure qubit using tunable transmons [59.63080344946083]
  We show that a "dual-rail qubit" consisting of a pair of resonantly coupled transmons can form a highly coherent erasure qubit. We demonstrate mid-circuit detection of erasure errors while introducing $ 0.1%$ dephasing error per check. This work establishes transmon-based dual-rail qubits as an attractive building block for hardware-efficient quantum error correction.
  arXiv  Detail & Related papers  (2023-07-17T18:00:01Z)
• Coherent error threshold for surface codes from Majorana delocalization [0.0]
  Existing mappings assume incoherent noise, thus ignoring coherent errors due to spurious gate rotations. We map the surface code with coherent errors, taken as $X$- or $Z$-rotations (trivial bit or phase), to a two-dimensional (2D) Ising model with complex couplings, and further to a 2D Majorana scattering network. For both, the error-correcting phase maps explicitly show by linking 2D networks to 1D fermions, to a $mathbbZ$-trivial 2D insulator.
  arXiv  Detail & Related papers  (2022-11-01T18:00:01Z)
• Self-healing of Trotter error in digital adiabatic state preparation [52.77024349608834]
  We prove that the first-order Trotterization of a complete adiabatic evolution has a cumulative infidelity that scales as $mathcal O(T-2 delta t2)$ instead of $mathcal O(T2delta t2)$ expected from general Trotter error bounds. This result suggests a self-healing mechanism and explains why, despite increasing $T$, infidelities for fixed-$delta t$ digitized evolutions still decrease for a wide variety of Hamiltonians.
  arXiv  Detail & Related papers  (2022-09-13T18:05:07Z)
• Some Error Analysis for the Quantum Phase Estimation Algorithms [0.0]
  We characterize the probability of computing the phase values in terms of the consistency error. In the first two cases, we show that in order to obtain the phase value with error less or equal to $2-n$ and probability at least $1-epsilon$, the required number of qubits is $ t geq n + log big. For the third case, we found a similar estimate, but the number of random steps has to be sufficiently large.
  arXiv  Detail & Related papers  (2021-11-19T20:36:16Z)
• Hamiltonian simulation with random inputs [74.82351543483588]
  Theory of average-case performance of Hamiltonian simulation with random initial states. Numerical evidence suggests that this theory accurately characterizes the average error for concrete models.
  arXiv  Detail & Related papers  (2021-11-08T19:08:42Z)
• Perturbative readout error mitigation for near term quantum computers [0.5156484100374058]
  Readout errors on near-term quantum computers can introduce significant error to the empirical probability distribution sampled from the output of a quantum circuit. We modify standard matrix techniques using two perturbative approximations with significantly reduced complexity and bounded error. These approximate techniques for readout error correction may greatly accelerate near term quantum computing applications.
  arXiv  Detail & Related papers  (2021-05-17T21:01:31Z)
• Exponential suppression of bit or phase flip errors with repetitive error correction [56.362599585843085]
  State-of-the-art quantum platforms typically have physical error rates near $10-3$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits. We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
  arXiv  Detail & Related papers  (2021-02-11T17:11:20Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.