44 2033180199
All submissions of the EM system will be redirected to Online Manuscript Submission System. Authors are requested to submit articles directly to Online Manuscript Submission System of respective journal.
Journal of Modern and Applied Physics

Sign up for email alert when new content gets added: Sign up

Andrew Shaw*
 
University of Maryland, College Park, MD 20742, USA, Email: ashaw12@umdedu
 
*Correspondence: Andrew Shaw, University of Maryland, College Park, MD 20742, USA, Email: ashaw12@umdedu

Received: 20-Feb-2023, Manuscript No. puljmap-23-6151; Editor assigned: 22-Feb-2023, Pre QC No. puljmap-23-6151; Accepted Date: Mar 16, 2023; Reviewed: 27-Feb-2023 QC No. puljmap-23-6151; Revised: 07-Mar-2023, Manuscript No. puljmap-23-6151; Published: 23-Mar-2023, DOI: 10.37532.2022.6.1.1-20

Citation: Shaw A. Simulating ion trap quantum computers. J Mod Appl Phys. 2022; 6(2):1-20.

This open-access article is distributed under the terms of the Creative Commons Attribution Non-Commercial License (CC BY-NC) (http://creativecommons.org/licenses/by-nc/4.0/), which permits reuse, distribution and reproduction of the article, provided that the original work is properly cited and the reuse is restricted to noncommercial purposes. For commercial reuse, contact reprints@pulsus.com

Abstract

An ion trap quantum computer is simulated with an exponential speed-up using the Stroboscopic Exponentiation Algorithm (SEA). It leverages Hamiltonian periodicity for time-efficient quantum simulation.

Key Words

Quantum Simulation, Ion Trapping, Quantum, Error Correction

Introduction

Richard Feynman postulated the principle of quantum supremacy: quantum computers possess an innate computing advantage over classical computers [1].

Ion Trap Quantum Computing

Ion trap quantum computers (Figure 1) were proposed by Ignacio Cirac and Peter Zoller in May 1995 [2]. Ion trap quantum computers were experimentally demonstrated by Christopher Monroe et al. in December 1995 [3]. Ion trap quantum computers are the primary market competitors for transmon quantum computers [46].

Figure 1: An ion trap quantum computer is composed of ions (black) confined using electromagnetic fields (rainbow). The electronic states are manipulated using lasers (purple)

Ion Trapping

An ion trap confines charged atoms to a spatial region using timedependent electromagnetic fields [718].

Quantum operations

Atomic qubits are pairs of electronic states associated with each ion (Figure 2) [19]. Lasers can induce transitions between the electronic states [2029].

Figure 2: An atomic qubit is composed of a spin-down (left) and spin-up (right) electronic state

Ion trap quantum computers

The Hamiltonian for an ion trap quantum computer is derived from quantum theory [30,31].

Ion Trap Hamiltonian

Ionic Hamiltonia

The ion trap parameters are the following:

Atomic Number: Z                      (2.1)

Ion Charge: Qe                         (2.2)

Ion Mass: M                              (2.3)

Number of Ions: N                     (2.4)

a) Kinetic Interactions: The ionic kinetic energy operator is the following [32]:

equation

b) Ionic Interactions: The ionic electrostatic operator is the following [33]:

equation

c) Trapping potential: The trap electric field is the following [8]:

equation

The trap scalar potential is the following [34]:

equation

The trapping operator is the following:

equation

Over a timescaleequation the trapping operator can be approximated by a confining operator [3537]:

equation

d) Ion-laser interaction: The laser electric field is the following:

equation

The laser magnetic vector potential is given by the following [38]:

equation

The laser magnetic field is the following:

equation

The laser scalar potential is the following:

equation

The ionic laser operator is the following:

equation

e) Ionic Hamiltonian: The ionic Hamiltonian is the following:

equation

Electronic Hamiltonian

a) Electron number: The number of electrons in the trap is the following:

equation

b) Kinetic Term: The electronic kinetic energy operator is the following:

equation

c) Atomic well: The atomic well operator is the following:

equation

d) Electronic interactions: The electronic electrostatic operator is the following:

equation

e) Electron-laser interactions: The electronic laser operator is the following [39]:

equation

f) Electronic Hamiltonian: The electronic Hamiltonian is the following:

equation

Qubit Hamiltonian

a) Qubit States: The atomic orbital Hamiltonian for a single ion at equation is the following [40]:

equation

The atomic orbital Hamiltonian’s eigenstates form a complete basis centered at x :

equation

The qubit states are the following (Figure 2):

equation

b) Passenger-Qubit Hilbert Space: The passenger-qubit Hilbert space at x is spanned by two states:

equation

In the passenger-qubit construction, the qubit states co-move with the ion (Figure 3).

Figure 3: The spin-down (left panel) and spin-up (right panel) qubit states vary with the ion position

c) Passenger-Qubit Basis States: In the multi-ion case, the passengerqubit basis states are the following:

equation

d) Qubit Operators: Qubit operators are projections of the electronic Hamiltonian into the passenger-qubit Hilbert space) To avoid an adiabatic effective Hamiltonian description, a passenger-qudit Hilbert space is required for hyperfine qubits [41-43].

equation

e) Pauli Decomposition: The generalized Pauli operators are the following [44]:

equation

The qubit operators are decomposed in the generalized Pauli basis [45]:

equation

f) Qubit Hamiltonian: The qubit Hamiltonian is the following:

equation

Ion Trap Hamiltonian

equation

Vibrational Expansion

The vibrational expansion approximates the near equilibrium ion trap dynamics by collective oscillatory motion [46].

Vibrational Expansion

a) Total Ionic Potential Energy: In the absence of the laser, the ionic Hamiltonian is expressed using the total ionic potential energy operator:

equation

b) Ionic Component Vector: The ionic position components are thefollowing:

equation

They are used to form the ionic component vector:

equation

c) Component Gradient: The component gradient is the gradient with respect to the ionic component vector:

equation

d) Critical Point: A critical point of the total ionic potential energy occurs at c0:

equation

The vibrational expansion is made by expanding the total ionic potential energy around c0:

equation

e) Potential Hessian Matrix: The second-order contribution to the vibrational expansion is expressed as a matrix equation:

equation

equation

The potential Hessian matrix is the following [9]:

equation

f) Trap Frequencies: The potential Hessian matrix is diagonalized as follows:

equation

The eigenvalues of the potential Hessian matrix provide access to the trap frequencies:

equation

Ladder Hamiltonian

a) Vibrational Mode Vector: The vibrational mode vector is the following (Figure 4):

The ions oscillate collectively (red ←→ green) in the ion trap (blue). The center-of-mass mode (left) and the zig-zag mode (right) are shown [42].

equation

b) Harmonic Interactions: The second-order contribution to the vibrational expansion is written in harmonic form:

equation

c) Component Laplacian: The component Laplacian is the following:

equation

The first partial derivative is expressed in terms of the vibrational mode vector components (Equation 2.49):

equation

equation

The component Laplacian is the following:

equation

d) Kinetic Interactions: The ionic kinetic energy operator is the following:

equation

e) Ionic Hamiltonian: The ionic Hamiltonian is the following:

equation

f) Mode Ladder Operators: The mode ladder operators are the following [47]:

equation

g) Ladder Hamiltonian: The ionic Hamiltonian becomes the following, up to an overall constant:

equation

The ionic Hamiltonian can be expressed in terms of the physical trap frequencies [48]:

equation

Effective Ion Trap Hamiltonian

Effective approximations are used to tailor the ion trap Hamiltonian for quantum computing applications [49].

Strong−Confinement Approximation

The Strong-Confinement Approximation (SCA) is the following (Figure 5):

Figure 5: If the ion (gray) is strongly confined, the total potential energy (blue) can be approximated (red)

equation

The effective ionic Hamiltonian is as follows:

equation

Weak−Laser Approximation

The Weak-Laser Approximation (WLA) is as follows (Figure 6)

equation

The effective ion trap Hamiltonian is the following:

equation

Figure 6: If the laser (blue) is sufficiently weak, its effect on the ionic wavefunction (left) can be neglected (right)

Interaction Picture Hamiltonian

Interaction Picture

The interaction picture leverages the effective ionic Hamiltonian’s analytic evolution operator for faster computation [50].

a) Interaction Picture Hamiltonian: The effective interaction picture Hamiltonian is the following:

equation

Spin−Phonon Interactions

a) Phonon Passenger-Qubit Basis: The phonon passenger-qubit basis states are as follows:

equation

b) Spin-Phonon Operators: The spin-phonon operators are projections of the electronic Hamiltonian into the phonon passengerqubit Hilbert space:

equation

The effective interaction picture Hamiltonian is written explicitly:

equation

Classical quantum-simulation algorithms

An algorithm is proposed to efficiently simulate ion trap quantum computers.

Product-Formula Algorithms

Product-Formula Algorithms (PFAs) are a family of quantumsimulation algorithms [51, 52]. The PFA is an extremely versatile algorithmic framework, with mathematical, low-energy, and highenergy physics applications [53-82].

PFAs can be represented schematically in three stages:

PFAs can be represented schematically in three stages:

1. Discretization: Subdivide the simulation time into subregions.

2. Piece-wise Simulation: Approximate the subregion evolution operators.

3. Matrix Multiplication: Take the ordered product of the sub-region evolution operators.

Evolution Operator

a) Hamiltonian Operator: The Hamiltonian is the following:

equation

b) Time-Ordered Exponential

equation

Discretization

a) Sub-Regions: The simulation time τ is subdivided into Lsim sub regions:

equation

b) Sub-Region Evolution Operators: The sub-region evolution operators are the following:

equation

The evolution operator can be written as an orderedproduct of the sub-region evolution operators:

equation

c) Piece−Wise Simulation: An intermediate simulation algorithm is used to generate the approximate sub-region evolution operators:

equation

d) Matrix Multiplication: An ordered-product is used to generate the approximate evolution operator:

equation

Time-Integrated Product-Formula Algorithm

The Time-Integrated Product-Formula Algorithm (TI-PFA) coarsegrains the Hamiltonian to minimize the number of required subregions [8385].

Time−Integrated Product−Formula Algorithm

TI-PFA can be represented schematically in three stages:

1. Time-Averaging: Time-average the Hamiltonian over the sub-regions.

2. Matrix Exponentiation: Generate the approximate subregion evolution operators.

3. Matrix Multiplication: Take the ordered product of the approximate sub-region evolution operators.

a) Time-Averaging: The sub-region Hamiltonians are as follows (Figure 7):

equation

Figure 7: The simulation time is discretized (top) and for each sub-region (blue) the Hamiltonian is time-averaged)

b) Matrix Exponentiation: The approximate sub-region evolution operators are the following:

equation

c) Sub-Region Evolution Operator Error: The eigenvalue spread is as follows (Equation 3.1). The notation max τ indicates a maximum taken over time τ.

equation

The sub-region error coefficient is the following:

equation

The error in the sub-region evolution operators is given by the Baker Campbell-Hausdorff formula [86]:

equation

Quantum-Simulation Computational Cost

The computational cost of TI-PFA is determined by counting the number of elementary operations [87].

Matrix Exponentiation

The approximate sub-region evolution operators are computed using a Λ-truncated Taylor series [88]

equation

The number of matrix multiplications required for the computation is the following:

equation

Matrix Multiplication

Classical computers perform matrix multiplication by manipulating matrix elements:

equation

The number of elementary operations required in the textbook matrix multiplication algorithm is as follows [87]:

equation

The time-complexity is the length of time required for a computing algorithm to run to completion [87]:

equation

Computational Cost

a) Matrix Exponentiation Cost: The computational cost of approximating all of the sub-region evolution operators is the following:

equation

b) Matrix Multiplication Cost: The computational cost of generating the ordered product is the following:

equation

c) Algorithm Cost: The computational cost of TI-PFA is the following:

equation

Quantum−Simulation Error

a) Algorithm Error: The error in TI-PFA is the following (Equation 3.13):

equation

equation

If the discretization condition holds, TI-PFA will achieve the target simulation error reliably:

equation

b) Minimum Algorithm Cost: The perturbative noise condition must hold for TI-PFA to converge (Equation 3.13):

equation

The perturbative noise condition sets the minimum step-number:

equation

The minimum step-number is used to lower-bound the computational cost of TI-PFA (Equation 3.21):

equation

Stroboscopic exponentiation algorithm

The Stroboscopic Exponentiation Algorithm (SEA) leverages Hamiltonian periodicity for time-efficient quantum-simulation.

Stroboscopic Simulation

1. Periodic Hamiltonians

A periodic Hamiltonian has discrete time-translational symmetry with period T:

equation

2. Stroboscopic Evolution Operator

The simulation time can be expressed as follows:

equation

The periodic evolution operator obeys the following [89]:

equation

3. Stroboscopic Simulation Algorithm

The stroboscopic simulation algorithm (SSA) can be represented schematically in two stages (Figure 8) [90]:

Figure 8: The periodic evolution operator is generated for one period (yellow). The base time-symmetry evolution operator (pink) and the time-symmetry evolution operator (green) are generated using matrix multiplication

1. Aliasing: Obtain the base time-symmetry evolution operator and the remainder evolution operator.

2. Matrix Multiplication: Generate the periodic evolution operator using ordered products.

a) Aliasing: The base time-symmetry evolution operator is the following:

equation

The remainder evolution operator is the following:

equation

b) Matrix Multiplication: The time-symmetry evolution operator is the following:

equation

The periodic evolution operator is the following:

equation

4. Computational Cost

a) Aliasing Cost: The base time-symmetry evolution operator and the remainder evolution operator are both approximated with TI-PFA (Equation 3.28):

equation

b) Matrix Multiplication Cost: The computational cost of generating the ordered product is the following:

equation

c) Minimum Algorithm Cost: The computational cost of SSA is lower-bounded by the following:

equation

d) Parametrized Minimum Algorithm Cost: The computational cost of SSA can be parametrized as follows (Equation 4.2):

equation

e) Quantum−Simulation Error: The error in SSA is the following (Equation III.23):

equation

Stroboscopic Exponentiation Algorithm

1. Stroboscopic Evolution Operator

The simulation time can be expressed as follows:

equation

The integer k is expressed using binary notation [91]

equation

The periodic evolution operator obeys the following:

equation

2. Stroboscopic Exponentiation Algorithm

SEA can be represented schematically in three stages (Figure 9):

Figure 9: The exponentiated time-symmetry evolution operators are generated recursively (left). The binary decomposition (right) is used to generate the timesymmetry evolution operator (bottom).

1. Aliasing: Obtain the base time-symmetry evolution operator and the remainder evolution operator.

2. Exponentiation: Perform recursive multiplication on the base time-symmetry evolution operator.

3. Matrix Multiplication: Generate the periodic evolution operator using ordered products.

a) Aliasing: The base time-symmetry evolution operator and remainder evolution operator are defined in Section 4 A 3 a.

b) Exponentiation: The exponentiated time-symmetry evolution operators are the following:

equation

The exponentiated time-symmetry evolution operators are generated recursively:

equation

c) Matrix Multiplication: The time-symmetry evolution operator is as follows:

equation

The periodic evolution operator is the following:

equation

3. Computational Cost

a) Aliasing Cost: The base time-symmetry evolution operator and the remainder evolution operator are generated as in Section 4 A 4 a)

b) Exponentiation Cost: The computational cost of generating the exponentiated time-symmetry operators is the following:

equation

c) Matrix Multiplication Cost: The computational cost of generating the ordered product is the following:

equation

d) Minimum Algorithm Cost: The computational cost of SEA is lower-bounded by the following:

equation

e) Binary Constraint: The binary decomposition constrains the number of exponentiated time-symmetry operators:

equation

f) Parametrized Minimum Algorithm Cost: The computational cost of SEA can be parametrized as follows:

equation

Quantum−Simulation Error

The error in SEA is the following (Equation 4.15)

equation

Algorithm Comparison

Asymptotic Cost Analysis

The asymptotic computational costs of the quantum simulation algorithms are the following:

equation

Relative Algorithm Performance: SEA achieves an exponential speed-up over TI-PFA and SSA in simulating periodic Hamiltonians (Figure 10).

Figure 10: The computational cost required to apply TI-PFA (blue), SSA (green), and SEA (red) to a 10-qubit periodic Hamiltonian is empirically determined

Trap sim ii

Trap Sim II

Trap Sim II is a proprietary MATLAB code that performs timeefficient quantum-simulation of ion trap quantum computers.

A) Hamiltonian Periodicity

1. Schrodinger Picture Hamiltonian

The laser period is the following:

equation

The Schrodinger picture Hamiltonian is periodic:

equation

2. Interaction Picture Hamiltonian

The interaction picture Hamiltonian is not periodic in general (Equation 2.73).

B) Regularization Effects

1. Hamiltonian Regularization

A bosonic truncation is placed on the ladder operators [9294]:

equation

The regularized effective ion trap Hamiltonian is the following (Equation 2.68):

equation

2. Computer Memory

The dimension of the Hilbert space is the following:

equation

The memory required to perform quantum-simulation on a 64-bit processor is the following (Figure 11):

Figure 11: The threshold simulation memory (black) is compared with the random access memory of several classical computing platforms (colored) [96-98]

 

equation

3. Bosonic Saturation

The vibrational occupation operators are as follows [95]:

equation

The vibrational occupation uncertainties are as follows:

equation

If the bosonic truncation is saturated, an accumulation of regularization effects ensure that the simulation can no longer be compared to nature:

equation

C) Anisotropic Randomized Truncation

Anisotropic Randomized Truncation (ART) is used to estimate the size of regularization effects. It can be represented schematically in three stages:

1. Truncation: Regularize the Hamiltonian randomly.

2. Quantum-Simulation: Generate an evolution operator for the regularized Hamiltonians.

3. Error-Estimation: Estimate the regularization effects using quantum channel technology.

1. Truncation

The vibrational modes are regularized anisotropically (Figure 12):

Figure 12: The maximum number of vibrational excitations (colored) is set independently for each mode

equation

Regularized Hamiltonians are selected pseudorandomly to generate the ART Hamiltonian set:

equation

2. Quantum−Simulation

a) Regularized Evolution Operators: The regularized evolution operators are the following:b

equation

b) Haar Measure: The regularized Haar measure is a subset of the Haar measure composed of the regularized evolution operators (Figure 13) [96-100]:

Figure 13: ART generates unitary operators (red) from the regularized Haar measure (gray), which contains the ideal evolution operator (blue).

equation

The ART unitary set is the following:

equation

3. Error−Estimation

Simulated Expectation-Value Approximate Reconstruction (SEAR) is used to approximate the regularization effects [101].

a) Quantum Channel Technology: A superoperator on a Hilbert space H has the following form [102]:

equation

A quantum channel is a type of super operator. Its Kraus operators satisfy the following condition [103,104]:

equation

The action of a quantum channel on a state |ψ⟩ generates a density matrix [105, 106]:

equation

b) Quantum Channel Averaging: Applying a similarity transformation to a quantum channel yields the following [107]:

equation

Averaging a quantum channel over the Haar measure yields a depolarizing channel (Figure 14) [107, 108]:

Figure 14: The SEAR error channel (left) is defined using its kraus operators (blue). Averaging the SEAR error channel generates a depolarizing channel (right).

 

equation

The depolarizing channel has characteristic noise strength [109116]:

equation

c) Approximate Quantum Simulation: The ideal evolution operator has an arbitrarily large bosonic truncation (Figure 13):

equation

The ideal output state is the following:

equation

The regularized output states are the following:

equation

Averaging the regularized output states generated by the ART unitary set yields the ART output state:

equation

d) SEAR Error Channel: The SEAR error channel maps the ideal output state to the ART output state:

equation

The SEAR error channel is written explicitly:

equation

equation

The SEAR noise strength is the following:

equation

e) Regularization Effects: The SEAR error channel forces observables to stray from their ideal values, causing truncation fluctuations:

equation

The average truncation fluctuation can be bounded using the SEAR noise strength [101]:

equation

f) Noise Spectroscopy: The complementary SEAR error channels are generated by substituting the ideal evolution operator with the regularized evolution operators (Equation 5.33). The SEAR error channel cannot be studied directly due to the inaccessibility of the ideal evolution operator:

equation

The complementary SEAR noise strength can be estimated using measurement protocols [101, 108].

D) Numerical Results

Trap Sim II is used to simulate an ion trap quantum computer.

a) Simulation Goals: The simulation is performed to examine the following

1. Bosonic Saturation

2. Regularization Effects

3. Entanglement Growth

4. Weak-Laser Approximation (WLA)

b) Simulation Parameters: The simulation parameters are the following [42, 43]:

Number of Ions: N = 1                                      (5.39)

Ion Charge: Q = +e                                           (5.40)

Ion Mass: M ∼ 200 GeV                                    (5.41)

Physical Trap Frequency:equation                                (5.42)

Laser Wavelength: λ ∼ 400 nm                         (5.43)

Laser Power: Plaser ∼ 1 W                             (5.44)

Bosonic Truncation: ζ ∼ 6                                 (5.45)

Trap Potential: XY-Symmetric & Harmonic           (5.46)

c) Numerical Results

Bosonic Saturation: The vibrational occupation is computed throughout the simulation (Figure 15-16).

Figure 15: On the laser timescale, the vibrational occupation of the X-mode (magenta), the Y-mode (yellow), and the Z-mode (cyan), fluctuates nontrivially around zero.( The uncertainty is amplified by a factor of 104. The observable is sampled 7.5 times faster than displayed))

Figure 16: The vibrational occupation of the modes grows until the bosonic truncation (red) is approached) The onset of bosonic saturation (yellow backdrop) results in unphysical oscillations of the vibrational occupation. (The uncertainty is suppressed by a factor of 3. The observable is sampled 7.5 times faster than displayed).

Computational Details:

The ion trap is initialized in the motional groundstate [117134]

Regularization Effects: The SEAR noise strength is approximated using ART (Figure 17-18).

Figure 17: On the laser timescale, the SEAR noise strength (green) is perturbative small, indicating the initial accuracy of the quantum-simulation protocol. (The uncertainty is amplified by a factor of 8 × 104 . The observable is sampled 3 times faster than displayed).

Figure 18: The SEAR noise strength (green) approaches unity after the onset of bosonic saturation (yellow backdrop), indicating the ultimate failure of the quantum-simulation protocol. (The uncertainty is amplified by a factor of 5 × 102 . The observable is sampled 3 times faster than displayed).

Computational Details:

• Eight anisotropic bosonic truncations are chosen.

• The SEAR noise strength is estimated repeatedly.

• A bootstrap algorithm is used to generate uncertainty in the average SEAR noise strength estimate [135, 136].

c) Entanglement Growth: The von Neumann entanglement entropy of the qubit is computed throughout the simulation (Figure 19-20). Entanglement entropy is a wildly important quantity, with applications to many areas of physics [137193].

Figure 19: On the laser timescale, the entanglement entropy (blue) fluctuates non-trivially as the qubit interacts with the vibrational modes. (The uncertainty is amplified by a factor of 2. The observable is sampled 6 times faster than displayed)

Figure 20: The entanglement entropy (blue) ceases to grow after the onset of bosonic saturation (yellow backdrop), and the decoherence of the qubit is halted) (The observable is sampled 6 times faster than displayed).

equation

Computational Details:

• The qubit is initialized in 102 pseudo-randomly generated pure states [104].

• A bootstrap algorithm is used to generate an uncertainty in the average entanglement entropy.

d) Effective Hamiltonian Validity: The WLA error is computed (Figure 21-22).

Figure 21: Over the laser timescale, the WLA error (golden) increases by several orders of magnitude) (The observable is sampled 6 times faster than displayed).

Figure 22:The WLA error (golden) fluctuates non-trivially after the onset of bosonic saturation (yellow backdrop). (The observable is sampled 6 times faster than displayed)

Computational Details:

• The qubit is initialized in 102 pseudo-randomly generated pure states.

• The Pauli operator equation is measured)

• A bootstrap algorithm is used to generate an uncertainty in the average WLA error.

4. Empirical Observations

a) Bosonic Saturation: After the onset of bosonic saturation, the vibrational occupation exhibits unphysical behavior (Figure 16). Commentary:

• Bosonic saturation places a temporal limit on the amount of ion trap dynamics that can be probed numerically.

• This suggests that ion trap quantum-simulation be used as a performance heuristic for quantumsimulation protocols [194].

• The (N, , ) ζ ∈ ion-trap performance heuristic is the following:

A quantum-simulation protocol passes the (N, , ) ζ ∈ ion-trap performance heuristic by performing quantum-simulation of the Nion, ζ-cutoff ion trap Hamiltonian until bosonic saturation is observed, with total error bounded by∈.

b) Regularization Effects: The noise strength increases with simulation time, and experiences a sharp growth during the onset of bosonic saturation (Figure 18).

Commentary

• Each ART Hamiltonian generates a different set of regularization effects due to the anisotropic bosonic truncation

• The SEAR noise strength provides a measure of the disparity between the ART unitary operators

(Equation 5.33).

• The ART unitary operators diverge during bosonic saturation, and the average error grows to ≥60%.

c) Entanglement Growth: The entanglement entropy of the qubit increases with simulation time until the onset of bosonic saturation. The entanglement entropy then fluctuates non-trivially (Figure 20).

Commentary:

• The entanglement entropy is expected to increase as the purity of the qubit is lost to the environment [195201].

• Bosonic saturation restricts the decoherence times that can be probed numerically [202-236]:

Decoherence cannot be observed numerically unless the qubits are sufficiently noisy.

d) Effective Hamiltonian Validity: WLA accumulatesequation1% error after the onset of bosonic saturation (Figure 22).

Commentary:

• The stability of approximations such as the rotating-wave approximation, the Lamb-Dicke limit, and the Magnus Expansion may be uncertain in the parameter regimes required for the most ambitious ion trap quantum computing proposals [237246]. Much of the pressing uncertainty is rooted in the intractability of the Magnus Expansion [247].

• To conserve the limited and transient resources available to the scientific community at large, it is necessary to verify that perturbative protocols will succeed when implemented on real ion trap quantum computers, which are inherently nonperturbative) For a successful instance of this paradigm, see [248, 249].

•Trap Sim II is a rigorous algorithm test-bed for up to six ions (Figure 11). The sole approximation made by Trap Sim II is that of finite bosonic truncation

Appendix

TI-PFA vs. Sampling PFA

The sampling product-formula algorithm (S-PFA) [50, 90] can be expressed schematically in two stages:

1. Sampling: Sample the Hamiltonian at set times and approximates the sub-region evolution operators.

2. Matrix Multiplication: Take the ordered product of the approximate sub-region evolution operators.

a) Sampling

The sub-region Hamiltonians are as follows (Equation 3.9):

equation

The approximate sub-region evolution operators are the following:

equation

b) Sub-Region Evolution Operator Error

The maximum eigenvalue derivative of the Hamiltonian is the following:

equation

The error in the sub-region evolution operator is the following:

equation

c) Relative Algorithm Performance

S-PFA struggles to resolve the true dynamics of the Hamiltonian due to sampling errors , which are not present in TI-PFA [83-85].

Regularization Effects

If the length-scale of the laser is sufficiently long, the severity of the regularization effects can be determined rigorously via an efficient classical computation [250].

Acknowledgement

Unjustly condemned, he was led away.

No one cared that he died without descendants, that his life was cut short in midstream. But he was struck down for the rebellion of my people.

References

 
Journal of Modern and Applied Physics peer review process verified at publons
pulsus-health-tech
Top