ERROR LIMITING PROTOCOL FOR THE CONSTRUCTION OF TWO-QUBIT GATES IN AN ION-TRAP QUANTUM COMPUTING SYSTEM

Information

  • Patent Application
  • 20250165845
  • Publication Number
    20250165845
  • Date Filed
    November 18, 2024
    a year ago
  • Date Published
    May 22, 2025
    7 months ago
  • CPC
    • G06N10/70
    • G06N10/60
  • International Classifications
    • G06N10/70
    • G06N10/60
Abstract
A method of performing a two-qubit gate operation includes computing, by a classical computer, a control pulse to be applied to a pair of trapped ions in a plurality of trapped ions in a quantum processor, each of the plurality of trapped ions having two frequency-separated states defining a qubit, wherein computing the control pulse comprises: computing a pulse function of the control pulse based on a phase-space closure condition and an auxiliary condition, and computing the pulse function of the control pulse further based on a gate angle condition, and applying, by a system controller, the control pulse, having the computed pulse function, to the pair of trapped ions.
Description
BACKGROUND
Field

The present disclosure generally relates to a method of performing computations in a quantum computing system, and more specifically, to a method of constructing two-qubit gate operations in a quantum computing system that includes a chain of trapped ions.


Description of the Related Art

Among physical systems upon which it is proposed to build large-scale quantum computers, is a chain of ions (i.e., charged atoms), which are trapped and suspended in vacuum by electromagnetic fields. The ions have internal hyperfine states which are separated by frequencies in the several GHz range and can be used as the computational states of a qubit (referred to as “qubit states”). These hyperfine states can be controlled using radiation provided from a laser, or sometimes referred to herein as the interaction with laser beams. The ions can be cooled to near their motional ground states using such laser interactions. The ions can also be optically pumped to one of the two hyperfine states with high accuracy (preparation of qubits), manipulated between the two hyperfine states (single-qubit gate operations) by laser beams, and their internal hyperfine states detected by fluorescence upon application of a resonant laser beam (read-out of qubits). A pair of ions can be controllably entangled (two-qubit gate operations) by a qubit-state dependent force using laser pulses that couple the ions to the collective motional modes of a chain of trapped ions, which arise from the Coulombic interaction between the ions. In general, entanglement occurs when pairs or chains of ions (or particles) are generated, interact, or share spatial proximity in ways such that the quantum state of each ion cannot be described independently of the quantum state of the others, even when the ions are separated by a large distance.


Realistic fault-tolerant quantum computing at reasonable overhead requires two-qubit gates with the highest possible fidelity, typically an infidelity of ≤10−4. However, in a commonly used phase-sensitive architecture, even under noise-free ideal conditions, control pulses constructed by conventional methods do not provide Mølmer-Sørensen XX gates based on the Raman scheme with an infidelity of ≤10−4.


Therefore, there is a need for a method of constructing gate operations with respect to the parameter drifts or fluctuations within an acceptable error in quantum computation.


SUMMARY

Embodiments of the present disclosure provide a method of performing a two-qubit gate operation. The method includes computing, by a classical computer, a control pulse to be applied to a pair of trapped ions in a plurality of trapped ions in a quantum processor, each of the plurality of trapped ions having two frequency-separated states defining a qubit, wherein computing the control pulse comprises computing a pulse function of the control pulse based on a phase-space closure condition and an auxiliary condition, and computing the pulse function of the control pulse further based on a gate angle condition, and applying, by a system controller, the control pulse, having the computed pulse function, to the pair of trapped ions.


Embodiments of the present disclosure also provide a quantum computing system. The quantum computing system includes a quantum processor comprising a plurality of trapped ions, wherein each of the trapped ions having two frequency-separated states defining a qubit, a classical computer configured to compute a control pulse to be applied to a pair of trapped ions in the quantum processor, wherein computing the control pulse comprises computing a pulse function of the control pulse based on a phase-space closure condition and an auxiliary condition, and computing the pulse function of the control pulse further based on a gate angle condition, and a system controller configured to apply the control pulse, having the computed pulse function, to the pair of trapped ions.


Embodiments of the present disclosure further provide a quantum computing system. The quantum computing system includes non-volatile memory having a number of instructions stored therein which, when executed by one or more processors, causes the quantum computing system to perform operations comprising computing, by a classical computer, a control pulse to be applied to a pair of trapped ions in a plurality of trapped ions in a quantum processor, each of the plurality of trapped ions having two frequency-separated states defining a qubit, wherein computing the control pulse comprises computing a pulse function of the control pulse based on a phase-space closure condition and an auxiliary condition, and computing the pulse function of the control pulse further based on a gate angle condition, and applying, by a system controller, the control pulse, having the computed pulse function, to the pair of trapped ions.





BRIEF DESCRIPTION OF THE DRAWINGS

So that the manner in which the above-recited features of the present disclosure can be understood in detail, a more particular description of the disclosure, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrate only typical embodiments of this disclosure and are therefore not to be considered limiting of its scope, for the disclosure may admit to other equally effective embodiments.



FIG. 1 is a schematic partial view of an ion trap quantum computing system according to aspects of this disclosure.



FIG. 2 depicts a schematic view of an ion trap for confining ions in a chain according to aspects of this disclosure.



FIG. 3 depicts a schematic energy diagram of each ion in a chain of trapped ions according to aspects of this disclosure.



FIG. 4 depicts a qubit state of an ion represented as a point on the surface of the Bloch sphere.



FIGS. 5A, 5B, and 5C depict a few schematic collective transverse motional mode structures of a chain of five trapped ions.



FIGS. 6A and 6B depict schematic views of a motional sideband spectrum of each ion and a motional mode according to aspects of this disclosure.



FIG. 7 depicts the relationship between a hardware-implemented quantum computer (REALITY, governed by the Hamiltonian ĤR), the corresponding model quantum computer (MODEL, governed by the model Hamiltonian ĤM) and the control pulses (CONTROL, constructed on the basis of the control Hamiltonian ĤC) that control both the actual hardware-implemented quantum computer (REALITY) and the model quantum computer (MODEL).



FIG. 8 depicts a number of gates vs. Φ-infidelity for N=36 ions, uncalibrated, τ=300 μs AMFM pulses, not requiring the Φ condition. The infidelities are in units of 10−1.





To facilitate understanding, identical reference numerals have been used, where possible, to designate identical elements that are common to the figures. In the figures and the following description, an orthogonal coordinate system including an X-axis, a Y-axis, and a Z-axis is used. The directions represented by the arrows in the drawing are assumed to be positive directions for convenience. It is contemplated that elements disclosed in some embodiments may be beneficially utilized on other implementations without specific recitation.


DETAILED DESCRIPTION

Embodiments described herein are generally related to a method of performing a computation in a quantum computing system, and more specifically, to a method of constructing control pulses that implement entangling gates in a quantum computing system that includes a chain of trapped ions. The method can include a process of constructing the control pulses that implement stabilized entangling gate operations used in the computational process performed by a quantum computing system.


Embodiments of the disclosure include a quantum computing system that is able to perform a quantum computation process by use of a classical computer, a system controller, and a quantum processor. The classical computer performs supporting tasks including selecting a quantum algorithm to be used, computing quantum circuits to run the quantum algorithm, and outputting results of the execution of the quantum circuits by use of a user interface. A software program for performing the tasks is stored in a non-volatile memory within the classical computer. The quantum processor includes trapped ions that are coupled with various hardware, including lasers to manipulate internal hyperfine states (qubit states) of the trapped ions and photomultiplier tubes (PMTs) to read-out the internal hyperfine states (qubit states) of the trapped ions. The system controller receives from the classical computer instructions for controlling the quantum processor, and controls various hardware associated with controlling any and all aspects used to run the instructions for controlling the quantum processor, and transmits a read-out of the quantum processor and thus output of results of the read-out to the classical computer. In some embodiments, the classical computer will then utilize the computational results based on the output of results of the read-out to form a results-set that is then provided to a user in the form of results displayed on a user interface, stored in a memory and/or transferred to another computational device for solving technical problems.


In Section III, various Hamiltonians used in gate construction and error analysis are shown. In Section IV, construction methods, focusing on the AMFM pulse-construction method that are used for generating test pulses are discussed. In Section V, a gate-simulation method is shown, which propagates an initial state |ψ(t=0)> into a final state |ψ(τ)>, where τ is the gate time, including the 2-qubit computational space and a portion of the phonon space large enough to obtain converged results. In Section VI, various fidelity measures are defined that are used to assess the quality of various Hamiltonians used to construct XX gates. In Section VII, numerical simulation results are shown. In Section VIII, a simple pulse-scaling method (calibration) is shown that may be used to eliminate coherent errors that result in XX gates that deviate from the target degree of entanglement. In Section IX, sources of errors that are incurred by a general pulse function g(t) are analyzed. This Method may be used in particular for a pulse function g(t) constructed on the basis of the standard Hamiltonian to control a quantum computer assumed to be governed by the full Mølmer-Sørensen Hamiltonian. The analysis is conducted analytically, and error integrals are evaluated numerically to assess error magnitudes. In Section X, a linear method of eliminating an important class of coherent errors are presented. It is this method, together with pulse calibration that allows us to suppress coherent XX gate errors to the level of ≤10−1. In Section XI, the scaling of the results to the case of chains consisting of 32 ions is discussed.


I. General Hardware Configurations


FIG. 1 is a schematic partial view of an ion trap quantum computing system according to one embodiment. The ion trap quantum computing system 100 includes a classical (digital) computer 102, a system controller 104 and a quantum processor that is a chain 106 of trapped ions (i.e., five shown) that extend along the Z-axis. Each ion in the chain 106 of trapped ions is an ion having a nuclear spin I and an electron spin S such that a difference between the nuclear spin I and the electron spin S is zero, such as a positive ytterbium ion, 171Yb+, a positive barium ion 133Ba+, a positive cadmium ion 111Cd+ or 113Cd+, which all have a nuclear spin






I
=

1
2





and the 2S1/2 hyperfine states. In some embodiments, all ions in the chain 106 of trapped ions are the same species and isotope (e.g., 171Yb+). In some other embodiments, the chain 106 of trapped ions includes one or more species or isotopes (e.g., some ions are 171Yb+ and some other ions are 133Ba+). In yet additional embodiments, the chain 106 of trapped ions may include various isotopes of the same species (e.g., different isotopes of Yb, different isotopes of Ba). The ions in the chain 106 of trapped ions are individually addressed with separate laser beams. The classical computer 102 includes a central processing unit (CPU), memory, and support circuits (or I/O). The memory is connected to the CPU, and may be one or more of a readily available memory, such as a read-only memory (ROM), a random-access memory (RAM), floppy disk, hard disk, or any other form of digital storage, local or remote. Software instructions, algorithms and data can be coded and stored within the memory for instructing the CPU. The support circuits (not shown) are also connected to the CPU for supporting the processor in a conventional manner. The support circuits may include conventional cache, power supplies, clock circuits, input/output circuitry, subsystems, and the like.


An imaging objective 108, such as an objective lens with a numerical aperture (NA), for example, of 0.37, collects fluorescence along the Y-axis from the ions and maps each ion onto a multi-channel photo-multiplier tube (PMT) 110 for measurement of individual ions. Non-copropagating Raman laser beams from a laser 112, which are provided along the X-axis, perform operations on the ions. A diffractive beam splitter 114 creates an array of static Raman beams 116 that are individually switched using a multi-channel acousto-optic modulator (AOM) 118 and is configured to selectively act on individual ions. A global Raman laser beam 120 is configured to illuminate all ions simultaneously. In some embodiments, individual Raman laser beams (not shown) each illuminate individual ions. The system controller (also referred to as a “RF controller”) 104 controls the AOM 118 and thus controls laser pulses to be applied to trapped ions in the chain 106 of trapped ions. The system controller 104 includes a central processing unit (CPU) 122, a read-only memory (ROM) 124, a random-access memory (RAM) 126, a storage unit 128, and the like. The CPU 122 is a processor of the system controller 104. The ROM 124 stores various programs and the RAM 126 is the working memory for various programs and data. The storage unit 128 includes a nonvolatile memory, such as a hard disk drive (HDD) or a flash memory, and stores various programs even if power is turned off. The CPU 122, the ROM 124, the RAM 126, and the storage unit 128 are interconnected via a bus 130. The system controller 104 executes a control program which is stored in the ROM 124 or the storage unit 128 and uses the RAM 126 as a working area. The control program will include software applications that include program code that may be executed by a processor in order to perform various functionalities associated with receiving and analyzing data and controlling any and all aspects of the methods and hardware used to create the ion trap quantum computer system 100 discussed herein.



FIG. 2 depicts a schematic view of an ion trap 200 (also referred to as a Paul trap) for confining ions in the chain 106 according to one embodiment. The confining potential is exerted by both a static (DC) voltage and a radio frequency (RF) voltage. A static (DC) voltage is applied to end-cap electrodes 210 and 212 to confine the ions along the Z-axis (also referred to as an “axial direction” or a “longitudinal direction”). The ions in the chain 106 are nearly evenly spaced in the axial direction due to the Coulomb interaction between the ions. In some embodiments, the ion trap 200 includes four hyperbolically shaped electrodes 202, 204, 206, and 208 extending along the Z-axis.


During operation, a sinusoidal voltage V1 (with an amplitude VRF/2) is applied to an opposing pair of electrodes 202, 204 and a sinusoidal voltage V2 with a phase shift of 180° from the sinusoidal voltage V1 (and the amplitude VRF/2) is applied to the other opposing pair of electrodes 206, 208 at a driving frequency ωRF, generating a quadrupole potential. In some embodiments, a sinusoidal voltage is only applied to one opposing pair of electrodes 202, 204, and the other opposing pair 206, 208 is grounded. The quadrupole potential creates an effective confining force in the X-Y plane perpendicular to the Z-axis (also referred to as a “radial direction” or “transverse direction”) for each of the trapped ions, which is proportional to the distance from a saddle point (i.e., a position in the axial direction (Z-direction)) at which the RF electric field vanishes. The motion in the radial direction (i.e., direction in the X-Y plane) of each ion is approximated as a harmonic oscillation (referred to as secular motion) with a restoring force towards the saddle point in the radial direction and can be modeled by spring constants kx and ky, respectively. In some embodiments, the spring constants in the radial direction are modeled as equal when the quadrupole potential is symmetric in the radial direction. However, undesirably in some cases, the motion of the ions in the radial direction may be distorted due to some asymmetry in the physical trap configuration, a small DC patch potential due to inhomogeneity of a surface of the electrodes, or the like and due to these and other external sources of distortion the ions may lie off-center from the saddle points. The Paul trap described herein is just one example of the types of traps that can be used as the ion trap 200. Other types of traps, including surface traps, can also be used for this purpose although their operation may be somewhat different.



FIG. 3 depicts a schematic energy diagram 300 of each ion in the chain 106 of trapped ions according to one embodiment. Each ion in the chain 106 of trapped ions is an ion having a nuclear spin I and an electron spin S such that a difference between the nuclear spin I and the electron spin is zero. In one example, each ion may be a positive Ytterbium ion 171Yb+, which has a nuclear spin






I
=

1
2





and the 2S1/2 hyperfine states (i.e., a multiplet of electronic states of which two are used as computational states) with an energy split corresponding to a frequency difference (referred to as a “carrier frequency”) of ω01/2π=12.642812 GHz. In other examples, each ion may be a positive barium ion 133Ba+, a positive cadmium ion 111Cd+ or 113Cd+, which all have a nuclear spin






I
=

1
2





and the 2S1/2 hyperfine states. A qubit is formed with two hyperfine states, denoted as |dcustom-character and |1custom-character, where the hyperfine ground state (i.e., the lowest energy state of the 2S1/2 hyperfine states) is chosen to represent |0custom-character. Hereinafter, the terms “hyperfine states”, “internal hyperfine states”, and “qubit states” may be interchangeably used to represent |0custom-character and |1custom-character. Further, the terms “trapped ions,” “ions,” and “qubits” may be interchangeably used. Each ion may be cooled (i.e., the kinetic energy of the ion may be reduced) to near the motional ground state |0custom-characterp for any motional mode with no phonon excitation (i.e., nph=0) by known laser cooling methods, such as Doppler cooling or resolved sideband cooling, and then the qubit state prepared in the hyperfine ground state |0custom-character by optical pumping. Here, |0custom-character represents the individual qubit state of a trapped ion whereas |0custom-characterp with the subscript denotes the motional ground state for a motional mode p of a chain 106 of trapped ions.


An individual qubit state of each trapped ion may be manipulated by, for example, a mode-locked laser at 355 nanometers (nm) via the excited 2P1/2 level (denoted as |ecustom-character). As shown in FIG. 3, a laser beam from the laser may be split into a pair of non-copropagating laser beams (a first laser beam with frequency ω1 and a second laser beam with frequency ω2) in the Raman configuration, and detuned by a one-photon transition detuning frequency Δ=ω1−ω0e with respect to the transition frequency ω0e between |0custom-character and |ecustom-character, as illustrated in FIG. 3. A two-photon transition detuning frequency δ includes adjusting the amount of energy that is provided to the trapped ion by the first and second laser beams, which, when combined, is used to cause the trapped ion to transfer between the hyperfine states |0custom-character and |1custom-character. When the one-photon transition detuning frequency Δ is much larger than the two-photon transition detuning frequency (also referred to simply as “detuning frequency”) δ=ω1−ω2−ω01 (hereinafter denoted as ±μ, μ being a positive value), the single-photon Rabi frequencies Ω0e(t) and Ω1e(t) (which are time-dependent, and are determined by amplitudes and phases of the first and second laser beams), at which Rabi flopping between states |0custom-character and |ecustom-character and between states |1custom-character and |ecustom-character respectively occur, and the spontaneous emission rate from the excited state |ecustom-character, Rabi flopping between the two hyperfine states |0custom-character and |1custom-character (referred to as a “carrier transition”) is induced at the two-photon Rabi frequency Ω(t). The two-photon Rabi frequency Ω(t) has an intensity (i.e., absolute value of amplitude) that is proportional to Ω0eΩ1e/2Δ, where Ω0e and Ω1e are the single-photon Rabi frequencies due to the first and second laser beams, respectively. Hereinafter, this set of non-copropagating laser beams in the Raman A configuration to manipulate internal hyperfine states of qubits (qubit states) may be referred to as a “composite pulse” or simply as a “pulse,” described by a pulse function g(t) and the resulting time-dependent pattern of the two-photon Rabi frequency Ω(t) may be referred to as an “amplitude” of a pulse. The detuning frequency δ=ω1−ω2−ω01 may be referred to as the detuning frequency of the composite pulse or the detuning frequency of the pulse. The amplitude of the two-photon Rabi frequency Ω(t), which is determined by amplitudes of the first and second laser beams, may be referred to as an “amplitude” of the composite pulse, such that the pulse function g(t) is now represented as








g

(
t
)

=


Ω

(
t
)


sin


{




0
t



μ

(

t


)



dt




+

φ

(
t
)


}



,




where φ(t) is a “phase” of the composite pulse that may be time dependent.


It should be noted that the particular atomic species used in the discussion provided herein is just one example of atomic species which have stable and well-defined two-level energy structures when ionized and an excited state that is optically accessible, and thus is not intended to limit the possible configurations, specifications, or the like of an ion trap quantum computer according to the present disclosure. For example, other ion species include alkaline earth metal ions (Be+, Ca+, Sr+, Mg+, and Ba+) or transition metal ions (Zn+, Hg+, Cd+).



FIG. 4 is provided to help visualize a qubit state of an ion represented as a point on the surface of the Bloch sphere 400 with an azimuthal angle ϕ and a polar angle θ. Application of the composite pulse as described above, causes Rabi flopping between the qubit state |0custom-character (represented as the north pole of the Bloch sphere) and |1custom-character (the south pole of the Bloch sphere) to occur. Adjusting time duration and the composite pulse flips the qubit state from |0custom-character to |1custom-character (i.e., from the north pole to the south pole of the Bloch sphere), or the qubit state from |1custom-character to |0custom-character (i.e., from the south pole to the north pole of the Bloch sphere). This application of the composite pulse is referred to as a “π-pulse”, Further, by adjusting time duration and the composite pulse, the qubit state |0custom-character may be transformed to a superposition state |0custom-character+1custom-character, where the two qubit-states |0custom-character and |1custom-character are added and equally-weighted in-phase (a normalization factor of the superposition state is omitted hereinafter for convenience) and the qubit state |1custom-character to a superposition state |0custom-character-|1custom-character, where the two qubit-states |0custom-character and |1custom-character are added equally-weighted but out of phase. This application of the composite pulse is referred to as a “π/2-pulse”. More generally, a superposition of the two qubit-states |0custom-character and |1custom-character that are added and equally weighted is represented by a point that lies on the equator of the Bloch sphere. For example, the superposition states |0custom-character±|1custom-character correspond to points on the equator with the azimuthal angle ϕ being zero and π, respectively. The superposition states that correspond to points on the equator with the azimuthal angle ϕ are denoted as |0custom-character+e|1custom-character. Transformation between two points on the equator (i.e. a rotation about the Z-axis on the Bloch sphere) can be implemented by shifting phases of the composite pulse.


II. Entanglement Formation


FIGS. 5A, 5B, and 5C depict a few schematic structures of collective transverse motional modes (also referred to simply as “motional mode structures”) of a chain 106 of five trapped ions, for example. Here, the confining potential due to a static voltage VS applied to the end-cap electrodes 210 and 212 is weaker compared to the confining potential in the radial direction. The collective motional modes of the chain 106 of trapped ions in the transverse direction are determined by the Coulomb interaction between the trapped ions combined with the confining potentials generated by the ion trap 200. The trapped ions undergo collective transversal motions (referred to as “collective transverse motional modes,” “collective motional modes,” or simply “motional modes”), where each mode has a distinct energy (or equivalently, a frequency) associated with it. A motional mode having the p-th lowest frequency is hereinafter referred to as |nphcustom-characterp, where nph denotes the number of motional quanta (in units of energy excitation, referred to as phonons) in the motional mode, and the number of motional modes P in a given transverse direction is equal to the number of trapped ions N in the chain 106. FIGS. 5A-5C schematically illustrate examples of different types of collective transverse motional modes that may be experienced by five trapped ions that are positioned in a chain 106. FIG. 5A is a schematic view of the common motional mode P having the highest energy where P is the number of motional modes. In the common motional mode |nphcustom-characterP, all ions oscillate in phase in the transverse direction. FIG. 5B is a schematic view of the tilt motional mode |nphcustom-characterP-1 which has the second highest energy. In the tilt motional mode, ions on opposite ends move out of phase in the transverse direction (i.e., in opposite directions). FIG. 5C is a schematic view of the higher-order motional mode |nphcustom-characterP-3 which has a lower energy than that of the tilt motional mode |nphcustom-characterP-1, and in which the ions move in a more complicated mode pattern.


It should be noted that the particular configuration described above is just one among several possible examples of a trap for confining ions according to the present disclosure and does not limit the possible configurations, specifications, or the like of traps according to the present disclosure. For example, the geometry of the electrodes is not limited to the hyperbolic electrodes described above. In other examples, a trap that generates an effective electric field causing the motion of the ions in the radial direction as harmonic oscillations may be a multi-layer trap in which several electrode layers are stacked, and an RF voltage is applied to two diagonally opposite electrodes, or a surface trap in which all electrodes are located in a single plane on a chip. Furthermore, a trap may be divided into multiple segments, adjacent pairs of which may be linked by shuttling one or more ions or coupled by photon interconnects. A trap may also be an array of individual trapping regions arranged closely to each other on a micro-fabricated ion trap chip. In some embodiments, the quadrupole potential has a spatially varying DC component in addition to the RF component described above.


In an ion trap quantum computer, the motional modes may act as a data bus to mediate entanglement between two qubits and this entanglement is used to perform an XX gate operation. That is, each of the two qubits is entangled with the motional modes, and then the entanglement is transferred to an entanglement between the two qubits by using motional sideband excitations, as described below. FIGS. 6A and 6B schematically depict views of a motional sideband spectrum for an ion in the chain 106 in a motional mode |nphcustom-characterp having frequency ωp according to one embodiment. As illustrated in FIG. 6B, when the detuning frequency of the composite pulse is zero (i.e., the frequency difference between the first and second laser beams is tuned to the carrier frequency, δ=0), simple Rabi flopping between the qubit states |0custom-character and |1custom-character (carrier transition) occurs. When the detuning frequency of the composite pulse is positive (i.e., the frequency difference between the first and second laser beams is tuned higher than the carrier frequency, δ=μ>0, referred to as a blue sideband, by cop), Rabi flopping between combined qubit-motional states |0custom-character|nphcustom-characterp and |1custom-character|nph+1custom-characterp occurs (i.e., a transition from the p-th motional mode with nph-phonon excitations denoted by |nphcustom-characterp to the p-th motional mode with nph+1-phonon excitations denoted by |nph+1custom-characterp occurs while the qubit state |0custom-character flips to |1custom-character). When the detuning frequency of the composite pulse is negative (i.e., the frequency difference between the first and second laser beams is tuned lower than the carrier frequency by δ=−μ<0, referred to as a red sideband, by ωp), Rabi flopping between combined qubit-motional states |0custom-character|nphcustom-characterp and |1custom-character|nph−1custom-characterp occurs (i.e., a transition from |nphcustom-characterp to |nph−1custom-character with one less phonon excitations occurs while the qubit state |0custom-character flips to |1custom-character). A π/2-pulse on the blue sideband applied to a qubit transforms the combined qubit-motional state |0custom-character|nph)p into a superposition of |0custom-character|nph)p and |1custom-character|nph+1)p. A π/2-pulse on the red sideband applied to a qubit transforms the combined qubit-motional state |0custom-character|nphcustom-characterp into a superposition of |0custom-character|nphcustom-characterp and |1custom-character|nph−1)p. When the two-photon Rabi frequency Ω(t) is smaller as compared to the detuning frequency δ=±μ, the blue sideband transition or the red sideband transition may be selectively driven. Thus, a qubit can be entangled with a desired motional mode by applying the right type of pulse, such as a π/2-pulse, which can be subsequently entangled with another qubit, leading to an entanglement between the two qubits that is needed to perform an XX-gate operation in an ion trap quantum computer.


By controlling and/or directing transformations of the combined qubit-motional states as described above, an XX-gate operation may be performed on two qubits (i-th and j-th qubits). In general, the XX-gate operation (with maximal entanglement) respectively transforms two-qubit states |0custom-characteri|0custom-characterj, |0custom-characteri|1custom-characterj, |1custom-characteri|0custom-characterj, and |1custom-characteri|1custom-characterj as follows:































"\[LeftBracketingBar]"

0



i



"\[RightBracketingBar]"



0



j





"\[LeftBracketingBar]"

0




i



"\[RightBracketingBar]"



0



j

-

i




"\[LeftBracketingBar]"

1





i




"\[RightBracketingBar]"




1



j




























"\[LeftBracketingBar]"

0



i



"\[RightBracketingBar]"



1



j





"\[LeftBracketingBar]"

0




i



"\[RightBracketingBar]"



1



j

-

i




"\[LeftBracketingBar]"

1





i




"\[RightBracketingBar]"




0



j




























"\[LeftBracketingBar]"

1



i



"\[RightBracketingBar]"



0



j





"\[LeftBracketingBar]"

1




i



"\[RightBracketingBar]"



0



j

-

i




"\[LeftBracketingBar]"

0





i




"\[RightBracketingBar]"




1



j




























"\[LeftBracketingBar]"

1



i



"\[RightBracketingBar]"



1



j





"\[LeftBracketingBar]"

1




i



"\[RightBracketingBar]"



1



j

-

i




"\[LeftBracketingBar]"

0





i




"\[RightBracketingBar]"




0



j







For example, when the two qubits (i-th and j-th qubits) are both initially in the hyperfine ground state |0custom-character (denoted as |0custom-characteri|0custom-characterj) and subsequently a π/2-pulse on the blue sideband is applied to the i-th qubit, the combined state of the i-th qubit and the motional mode |0custom-characteri|nphcustom-characterp is transformed into a superposition of |0custom-characteri|phcustom-characterp and |1custom-characteri|ph+1custom-character, and thus the combined state of the two qubits and the motional mode is transformed into a superposition of |0custom-characteri|0custom-characterj|nphcustom-characterp and |1custom-characteri|0custom-characterj|nph+1custom-characterp. When a π/2-pulse on the red sideband is applied to the j-th qubit, the combined state of the j-th qubit and the motional mode |0custom-characterj|nphcustom-characterp is transformed to a superposition of |0custom-characterj|nphcustom-characterp and |1custom-characterj|nph−1custom-characterp and the combined state |0custom-characteri|0custom-characterj|nphcustom-characterp is transformed into a superposition of |0custom-characteri|0custom-characterj|nphcustom-characterp and |0custom-characteri|1custom-characterj|nph−1custom-characterp.


Thus, applications of a π/2-pulse on the blue sideband on the i-th qubit and a π/2-pulse on the red sideband on the j-th qubit may transform the combined state of the two qubits and the motional mode |0custom-characteri|0custom-characterj|nphcustom-characterp into a superposition of |0custom-characteri|0custom-characterj|nphcustom-characterp and |1custom-characteri|1custom-characterj|nphcustom-characterP, the two qubits now being in an entangled state. For those of ordinary skill in the art, it should be clear that two-qubit states that are entangled with a motional mode having a different number of phonon excitations from the initial number of phonon excitations (i.e., |1custom-characteri|0custom-characterj|nph+1custom-characterp and |0custom-characteri|0custom-characterj|ph−1custom-character) can be removed by a sufficiently complex pulse sequence, and thus the combined state of the two qubits and the motional mode after the XX-gate operation may be considered disentangled as the initial number of phonon excitations nph in the p-th motional mode stays unchanged at the end of the XX-gate operation. Thus, qubit states before and after the XX-gate operation will be described below generally without including the motional modes.


More generally, the combined state of i-th and j-th qubits, transformed by the application of control pulses described by pulse functions gi(t) and gj(t), respectively, for duration τ (referred to as the “gate time”), can be described in terms of a degree of entanglement (also referred to as a “gate angle”) χij as follows:































"\[LeftBracketingBar]"

0



i



"\[RightBracketingBar]"



0



j




cos

(

2


χ
ij


)





"\[LeftBracketingBar]"

0





i



"\[RightBracketingBar]"



0



j

-

i



sin

(

2


χ
ij


)





"\[LeftBracketingBar]"

1





i



"\[RightBracketingBar]"



1



j




























"\[LeftBracketingBar]"

0



i



"\[RightBracketingBar]"



1



j




cos

(

2


χ
ij


)





"\[LeftBracketingBar]"

0





i



"\[RightBracketingBar]"



1



j

-

i



sin

(

2


χ
ij


)





"\[LeftBracketingBar]"

1





i



"\[RightBracketingBar]"



0



j




























"\[LeftBracketingBar]"

1



i



"\[RightBracketingBar]"



0



j




cos

(

2


χ
ij


)





"\[LeftBracketingBar]"

1





i



"\[RightBracketingBar]"



0



j

-

i



sin

(

2


χ
ij


)





"\[LeftBracketingBar]"

0





i



"\[RightBracketingBar]"



1



j




























"\[LeftBracketingBar]"

1



i



"\[RightBracketingBar]"



1



j




cos

(

2


χ
ij


)





"\[LeftBracketingBar]"

1





i



"\[RightBracketingBar]"



1



j

-

i



sin

(

2


χ
ij


)





"\[LeftBracketingBar]"

0





i



"\[RightBracketingBar]"



0



j







where








χ
ij

=







p
=
1

P



η
p
i



η
p
j





0
τ


d


t
2





0

t
2



d


t
1




g
i

(

t
1

)




g
i

(

t
2

)



sin
[


ω
p

(


t
2

-

t
1


)

]







,




and ηpi is the Lamb-Dicke parameter that quantifies the coupling strength between the i-th qubit and the p-th motional mode having the frequency ωp, and P is the number of the motional modes (equal to the number N of ions in the chain 106).


The entanglement interaction between two qubits described above can be used to perform an XX-gate operation. The XX-gate operation (XX gate) along with single-qubit gate operations (R gates) forms a set of gates {R, XX} that can be used to build a quantum computer that is configured to perform desired computational processes. Among several known sets of logic gates by which any quantum algorithm can be decomposed, a set of logic gates, commonly denoted as {R, XX}, is native to a quantum computing system of trapped ions described herein. Here, the R gate corresponds to manipulation of individual qubit states of trapped ions, and the XX gate (also referred to as an “entangling gate”) corresponds to manipulation of the entanglement of two trapped ions.


III. Trapped-ion Architecture and Hamiltonian

The trapped-ion architecture, i.e., chains of trapped ions, coherently controlled via Raman hyperfine transitions, is one of the most promising routes to scalable quantum computing. This quantum computer architecture is used both in laboratory experiments and in the emerging quantum computing industry. For both the current era of noisy intermediate-scale quantum computing and the anticipated era of fault-tolerant, error-corrected quantum computing, two-qubit gates of the highest possible fidelity are essential. While fault-tolerant quantum computing and quantum error-correction may, in principle, be achieved with two-qubit gates of modest fidelity, the overhead, i.e., the number of physical qubits required for one error-corrected logical qubit depends on the native fidelity of the physical gates and may be enormous for physical two-qubit gates of only modest fidelity. A reasonable amount of overhead in fault-tolerant quantum computing can be achieved only if the physical two-qubit gates themselves have a high native fidelity. Typically, for realistic, tolerable overhead, a physical two-qubit infidelity of ≤10−4 is recommended. Two-qubit gate infidelities close to this target have indeed already been achieved. However, the experimental demonstrations of high-fidelity two-qubit gates are restricted to two-qubit gates in very short ion chains, i.e., chains consisting of up to four ions. Moreover, to date, even in these cases two-qubit gate infidelities of ≤10−4 have not yet been achieved experimentally. Two adversaries stand in the way of achieving two-qubit gate infidelities ≤10−4: Random noise and deterministic, coherent control errors. Even in the shortest chains (two to four ions stored simultaneously), the target of ≤10−4 infidelity may not be achieved if the Hamiltonian used to design the control pulses for two-qubit gate implementation does not accurately enough reflect the reality of the quantum computer's hardware implementation. What this means is illustrated in FIG. 7. The actual quantum computer, i.e., the reality, is governed by a Hamiltonian ĤR. Reality can never be captured exactly. It can only be modeled approximately. Consequently a model of the quantum computer is constructed, replacing the unknown Hamiltonian ĤR with ĤM, where it is hoped that ĤM˜ĤR to a high accuracy. Both the quantum computer (ĤR) and its model (ĤM) are controlled by control pulses that are constructed on the basis of a Hamiltonian ĤC. Ideally, ĤCR. However, since ĤR is unknown, the best possible control Hamiltonian is ĤCM. However, in most cases ĤM is too complicated to use for efficiently constructing control pulses that frequently also have to be computed in real time. Therefore, ĤC is chosen as a compromise, close enough to ĤM to ensure acceptable control of the quantum computer, but simple enough to ensure efficient control-pulse construction.


One of the most basic tasks of a quantum computer is to construct two-qubit gates. In the embodiments described herein, two-qubit XX gates constructed according to the Mølmer-Sørensen scheme are considered. Ideally, given an input state, |ψincustom-character, the quantum computer, governed by ĤR, is expected to turn |ψincustom-character into |ψoutcustom-character=XX|ψincustom-character, where XX is the ideal XX gate. However, since ĤR≠ĤC, this will not happen in practice. Therefore, |ψoutRcustom-character, i.e., the output state produced by ĤR, is different from XX|ψincustom-character. However, assuming that ĤM is very close to ĤR, it is possible, at least approximately, to assess the quality of the control pulses by computing the model output state |ψoutMcustom-character and comparing it with the ideal output state XX|ψincustom-character, for instance, by computing the overlap |custom-characterψoutM|XX|ψincustom-character|2. Only for HCM is it expected that this overlap equals 1. However, if ĤM is close to ĤR, but ĤC is chosen as the manageable standard Hamiltonian ĤS, it is expected that this overlap and other fidelity measures (see Section VI) differ from 1. In this case, because of the insufficient quality of the control pulses, the resulting two-qubit gates may not be accurate enough for the target infidelity (for instance, <10−4). To this end, constructing a realistic model Hamiltonian ĤM for Raman-controlled trapped ions, it is shown that currently employed control-pulse construction techniques based on the standard Hamiltonian ĤS, i.e., ĤCS are not accurate enough to achieve the ≤10−4 infidelity target for realistic fault-tolerant quantum computing. This is shown by constructing control pulses on the basis of ĤS, which are then used to compute two-qubit XX gates in a 7-ion chain governed by ĤM, assuming that ĤM is sufficiently close to ĤR. The XX gate simulations of the 7-ion chain are performed with a gate-simulator code that is accurate on the 10−7 level and takes both computational levels and phonon states explicitly into account. This way it is shown that even assuming ideal conditions, i.e., neglecting all incoherent noise sources, control-pulse construction needs to be improved to reach the ≤10−4 infidelity goal.


There are two principal methods of implementing a trapped-ion chain quantum computer using the stimulated Raman scheme: Phase sensitive and phase insensitive. Both schemes have advantages and disadvantages. The phase-sensitive scheme is focused since it is technically more straightforward to implement and is currently used by commercial quantum computing companies such as IonQ, Inc. Therefore, the focus is to isolate the leading coherent error sources in the phase-sensitive architecture and to construct methods that allow us to eliminate these error sources. It is shown that on the basis of a new linear scheme of pulse construction, and in the absence of all incoherent error sources, XX gate infidelities ≤10−4 can be reached.


The entangling gate can be constructed from the model Hamiltonian ĤM (referred to as the full Mølmer-Sørensen Hamiltonian) that governs a chain of ions in a linear Paul trap (e.g., the chain 106 of trapped ions, illuminated simultaneously by two laser beams, one red detuned and one blue detuned). The effective two-level Hamiltonian:











H
^

=



H
^

0

+







j
=
1

N



(






Ω
eff

(
t
)


2

)



e

-

i
[



(

Δ


k



)

·


r


j


-

μ

t

-
Δφ

]






σ
ˆ

-

(
j
)



+

h
.
c
.



,




(
1
)







can be obtained via adiabatic elimination according to the Raman Λ scheme. Here, N is the number of ions in the chain,











H
^

0

=







p
=
1

N


ω
p




a
^

p





a
^

p






(
2
)







is the phonon Hamiltonian with the phonon frequencies ωp and associated phonon creation and destruction operators {circumflex over (α)}p and âp, respectively, the j sum is over the ions in the chain, Ωeff(t) is the time-dependent effective Rabi frequency, Δ{right arrow over (k)} is the wavenumber difference between the two Raman lasers, {right arrow over (r)}j is the position operator of ion number j in the chain, and Δφ is the phase difference between the two Raman lasers.


To construct a Mølmer-Sørensen (MS) gate, the ions are illuminated simultaneously with blue (+μ) and red (−μ) shifted light. In the interaction representation with respect to Ĥ0, the MS Hamiltonian is:













H
^


M

S


(
t
)

=






j


Ω
j



cos

(


μ

t

-

ϕ
j
m


)



{



cos
[






p




η
p
j

(




a
^

p


·

e

i


ω
p


t



+



a
^

p



e


-
i



ω
p


t




)


]




σ
ˆ

y

(
j
)



+


sin
[






p




η
p
j

(




a
^

p




e

i


ω
p


t



+



a
^

p



e


-
i



ω
p


t




)


]




σ
ˆ

x

(
j
)




}



,




(
3
)







where μ is the detuning frequency, ηpj are the Lamb-Dicke parameters, and {circumflex over (σ)}x, {circumflex over (σ)}y, {circumflex over (σ)}z are the Pauli operators. The Hamiltonian (3) may be generalized according to:












Ω
j



cos

(


μ

t

-

ϕ
j
m


)






Ω
j

(
t
)



cos
[




0
t



μ

(

t


)



dt




+

ϕ
j

(
0
)



]






g
j

(
t
)



,




(
4
)







where gj(t) may be any time-dependent pulse function, i.e., it includes amplitude-modulated (AM) pulses, frequency-modulated (FM) pulses, phase-modulated (PM) pulses, and simultaneously amplitude- and frequency-modulated (AMFM) pulses. Thus, written in terms of the most general pulse function gj(t), the MS Hamiltonian (3) becomes:












H
^


M

S


=






j



g
j

(
t
)



{



cos
[



V
j

ˆ

(
t
)

]




σ
ˆ

y

0
)



+


sin
[



V
j

ˆ

(
t
)

]




σ
ˆ

x

(
j
)




}



,




(
5
)







where, for later convenience, the Lamb-Dicke operators are defined as:













V
^

j

(
τ
)

=






p




η
p
j

(




a
^

p




e

i


ω
p


t



+



a
^

p



e


-
i



ω
p


t




)



,




(
6
)







which satisfy










[




V
^

j

(

t
1

)

,



V
ˆ

l

(

t
2

)


]

=


-
2


i






p



η
p
j



η
p
l




sin
[


ω
p

(


t
1

-

t
2


)

]

.






(
7
)







Expansion of the MS Hamiltonian ĤMS in powers of {circumflex over (V)} leads to a family of model Hamiltonians:












H
^

M

(


N
c

,

N
s


)


=






j



g
j

(
t
)



{











n
=
0





neven




N
c





(

-
1

)


n
/
2






σ
ˆ

y

(
j
)



n
!






V
ˆ

j
n

(
t
)


+










m
=
1





modd




N
s





(

-
1

)



(

m
-
1

)

/
2






σ
ˆ

x

(
j
)



m
!






V
ˆ

j
m

(
t
)



}



,




(
8
)








where










H
^

M

(


,


)


=



H
^


M

S


.





(
9
)







For later convenience, the standard Hamiltonian is also defined as:












H
^

S

=



H
^

M

(


-
2

,
1

)


=






j






g
j

(
t
)





V
j

ˆ

(
t
)




σ
ˆ

x

(
j
)





,




(
10
)







which is frequently used as the basis for control-pulse construction. Here, the superscript Nc=−2 codes for the complete suppression (omission) of the cosine term in (8). The test pulses used in the example are also all constructed on the basis of the standard Hamiltonian ĤS (as discussed in detail below in Section IV). The expanded model Hamiltonians (8) are use in Section VII to assess the accuracy of expansions of the MS Hamiltonian ĤMS in powers of the Lamb-Dicke operators {circumflex over (V)}j(t).


IV. Construction of Control Pulses for Entangling Gate Operations

Quantum computation can be performed in a quantum computing system, such as the ion trap quantum computing system 100, using a set of quantum gate operations including single-qubit gate operations (R gates) and two-qubit gate operations, such as XX-gate operations (XX gates). Although the methods for applying such basic building blocks of quantum computation have been established, there are errors, which result from experimental parameter drift or fluctuations, such as the vibrational mode frequencies of an ion chain, in the hardware of the quantum computing system. These errors are mainly due to the lack of knowledge about the changes in the computing environment and the properties of quantum computing hardware within the quantum computing system. Thus, stabilizing gate operations, i.e., the task of computing and implementing control pulses in the quantum computing system to be robust against the errors is needed to provide scalable and reliable quantum computation results.


While the pulse functions g(t) may be any pulse functions constructed by any of the known pulse construction schemes (e.g., AM, PM, FM, AMFM, etc.), to be specific, and for the purpose of illustrating the methods, but not restricting the generality of the methods in any way, in the embodiments described herein, the pulse functions g(t) of a control pulse are taken to be sine-AMFM pulses:











g

(
t
)

=







n
min


n
max




B
n



sin

(


ω
n


t

)



,




(
11
)







where the basis spans the states n∈{nmin, nmax}, the Fourier coefficients Bn are real amplitudes,










ω
n

=


2

π

n

τ





(
12
)







are the basis frequencies, and r is the gate time. The pulse functions (11) fulfill the “carrier condition”













0
τ


g



(
t
)



dt


=
0

,




(
13
)







which, as shown in Section IX, ensures that significant, first-order contributions to the gate infidelity due to the “carrier term”, i.e., the n=0 term in the expansion (8) of the MS Hamiltonian, are eliminated, and higher-order contributions to the gate infidelity are much reduced.


The phase-space closure condition requires:











α
p
j

=



-

η
p
j






0
τ



g
j




(
t
)



e

i


ω
p


t




dt



=

0



(

p
,

j
=
1

,

,
N

)




,




(
14
)







such that the trapped ions that are displaced from their initial positions as the motional modes are excited by the delivery of the control pulse return to their initial motional states. This condition must be imposed for all motional modes (p=1,2, . . . , N) and all ions (j=1, . . . ,N) in the chain of trapped ions. The sine-AMFM pulses (11) are known to fulfill (14) exactly. The number of ions in the chain is chosen as N=7, as an example, because it is large enough to be realistic, yet small enough to enable direct numerical simulations of the quantum dynamics of the chain, explicitly including a large phonon space. In addition, in the embodiments described herein, gj(t)=g(t) (=1, . . . , N) is chosen for illustrative purposes but is not intended to be a restriction of generality. That is, here, whenever a two-qubit gate is constructed between two ions, it is assumed that each of the two ions is irradiated with laser light controlled by the same pulse function g(t). This is a common choice, used in laboratories and in commercial quantum computers.


Among the pulse functions g(t) that fulfill the phase-space closure condition and the carrier condition, the pulse function g(t) that satisfies the gate angle condition, which requires the pulse g(t) to produce the desired gate angle χ according to:










χ
=

2








p
=
1

N



η
p

j
1




η
p

j
2






0
τ


dt




0
t




dt





g



(
t
)



g



(

t


)




sin

[


ω
p




(

t
-

t



)


]







,




(
15
)







is selected. A maximally entangling gate is obtained for χ=π/4. The mode frequencies ωp, p=1, . . . ,7, and the Lamb-Dicke parameters ηpj, p,j=1, . . . ,7, are listed in Tables I and II, respectively.









TABLE I







Motional-mode frequencies ωp/(2π) (in MHz), p = 1, . . . ,


7, used to construct the 7-ion AMFM test pulses:










mode number p
ωp/(2π) (MHz)














1
2.953



2
2.966



3
2.984



4
3.006



5
3.029



6
3.049



7
3.060

















TABLE II







Lamb-Dicke parameters ηpj, p, j = 1, . . . ,


7, used to construct the 7-ion AMFM test pulses:














p
j = 1
j = 2
j = 3
j = 4
j = 5
j = 6
j = 7

















1
0.01033
−0.03355
0.05478
−0.06313
0.05478
−0.03355
0.01033


2
0.02226
−0.05627
0.05036
0.00000
−0.05036
0.05627
−0.02226


3
−0.03494
0.05644
0.00760
−0.05823
0.00760
0.05644
−0.03494


4
0.04644
−0.03074
−0.05488
0.00000
0.05488
0.03074
−0.04644


5
0.05503
0.00994
−0.03678
−0.05637
−0.03678
0.00994
0.05503


6
−0.05848
−0.04491
−0.02433
0.00000
0.02433
0.04491
0.05848


7
0.04143
0.04143
0.04143
0.04143
0.04143
0.04143
0.04143









For computing analytical infidelities the following identities that follow directly from (14) with the expansion (11) and hold for all p=1, . . . , N are used:













0
τ


g



(
t
)




e


±
i



ω
p


t




dt


=
0

,




(
16
)
















0
τ


g



(
t
)



sin



(


ω
p


t

)



dt


=
0

,




(
17
)
















0
τ


g



(
t
)



cos



(


ω
p


t

)



dt


=
0

,




(
18
)



















n
min


n
max




B
n




(


ω
n



ω
n
2

-

ω
p
2



)


=
0.




(
19
)







For later use in the following sections, the following functions are defined:











χ
˜

=






jp




(

η
p
j

)

2





0
τ


dt




0
t



dt



g



(
t
)



g



(

t


)




sin

[


ω
p




(

t
-

t



)


]







,




(
20
)














G



(
t
)


=




0
t


g



(

t


)




dt




=








n




(


B
n


ω
n


)

[


1
-

cos



(


ω
n


t

)



]


=

2






n



(


B
n


ω
n


)





sin
2

(


ω
n


t
/
2

)





,




(
21
)














Q



(
w
)


=




0
τ


g



(
t
)




e
iwt



dt


=


[


e

i

w

τ


-
1

]







n



B
n




(


ω
n



w
2

-

ω
n
2



)




,




(
22
)














f

(
w
)

=




0
τ


g



(
t
)



G



(
t
)



e
iwt


dt


=




(

1
2

)

[


e

l

w

τ


-
1

]








n

m




(



B
n



B
m



ω
n


)



{




ω
m

-

ω
n





(


ω
m

-

ω
n


)

2

-

w
2



+



ω
m

+

ω
n





(


ω
m

+

ω
n


)

2

-

w
2




}




,




(
23
)















S
p




(
w
)


=




0
τ



dt
1





0

t
1




dt
2



g



(

t
1

)



g



(

t
2

)




sin

[


ω
p




(


t
1

-

t
2


)


]



e

iwt
1






=





0
τ



dt
1





0

t
1




dt
2



g



(

t
1

)



g



(

t
2

)




sin

[


ω
p




(


t
1

-

t
2


)


]




e

iwt
2






=







nm





B
n



B
m



2



(


w
2

-

ω
m
2


)





{



(


2


ω
n



ω
m




ω
n
2

-

4


w
2




)




e

iw

τ



sin



(

w

τ

)


+



iw
2





(


e

iw

τ


-
1

)


[


1



(


ω
n

-

ω
m


)

2

-

w
2



-

1



(


ω
n

-

ω
m


)

2

-

w
2




]



}





,




(
24
)















J
p

=



0
τ


g



(
t
)




G
2




(
t
)




e

i


ω
p


t



dt



,






(
25
)















Z



(


w
1

,

w
2


)


=




0
τ



dt
1





0

t
1




dt
2



g



(

t
1

)



g



(

t
2

)




e


iw
1



t
1





e


iw
2



t
2







=







nm



B
n



B
m




(

1


ω
m
2

-

w
2
2



)



{



(



ω
n



ω
m




w
1
2

-

ω
n
2



)


[


e


iw
1


τ


-
1

]

-



(



ω
n



ω
m




(


ω
m
2

-

ω
n
2

+

w
1
2

+

4


w
1



w
2


+

3


w
2
2



)




[



(


ω
n

+

ω
m


)

2

-


(


w
1

+

w
2


)

2


]

[



(


ω
n

-

ω
m


)

2

-


(


w
1

+

w
2


)

2


]


)

[


e


i

(


w
1

+

w
2


)


τ


-
1

]


}




,




(
26
)








and










Φ

[

η
,
g

]

=









p
=
1

N



η
p
1



η
p
2





0
τ



dt
1





0

t
1




dt
2



g



(

t
1

)



g



(

t
2

)



G



(

t
2

)




sin

[


ω
p




(


t
1

-

t
2


)


]






=




χ

τ


4

π









n
=

n
min



n
max





B
n

n




,




(
27
)







where (15) is used and















n



(


B
n

n

)


=


(


2

π


τ
2


)





0
τ


dt




0
t



dt



g



(

t


)





dt


.










(
28
)







V. Gate Simulator

Given a Hamiltonian and enough computer power, the time evolution of the computational states including phonon excitations can always be solved to any desired accuracy. For a 7-ion chain, the complete state |ψ(t)custom-character can be expanded in the combined Hilbert space of computational states |a, bcustom-character, a, b∈{0,1}, and phonon states |m1m2 . . . m7custom-character, mj=0,1, . . . , mjmax, j=1, . . . ,7, according to:











|
ψ



(
t
)



=








a
,
b



m
1



m
2





m
7







A


m
1



m
2





m
7



(

a
,
b

)


(
t
)


|
a


,

b

|

m
1



m
2





m
7



,




(
29
)







where mjmax≥0 is the maximal phonon occupation number included in the basis. The set {m1max, . . . , m7max} is referred to as the phonon scheme. With (29), the time-dependent Schrödinger equation results in the amplitude equations:











i





A
.



n
1



n
2





n
7



(

a
,
b

)





(
t
)


=










a


,

b





m
1



m
2





m
7





a


,

b

|


n
1





n
7

|

H
^




(
t
)

|

m
1





m
7


|

a



,


b




A


m
1





m
7



(


a


,

b



)





(
t
)


,




(
30
)







where Ĥ(t) may be any of the model Hamiltonians defined in Section III. The set of equations (30) are ordinary first-order differential equations that may be solved with any standard numerical differential equations solver. For simplicity and straightforward numerical error control, an elementary fourth-order Runge-Kutta solver with constant step size is chosen. With this simple integrator, the inventors have been able to obtain a relative accuracy of the numerical solution of better than 10−7. It should be noted that the gate simulator is not limited to 7 ions. It scales trivially to any number of ions.


Convergence in the phonon scheme is assessed by using the gate simulator to compute |ψ(τ)custom-character for the Hamiltonian Ĥ(t)=ĤS(t)=Ĥ−2,1)(t). In this case, full phase-custom-characterspace closure is required, because the control pulses are constructed on the basis of the same Hamiltonian that governs the time evolution. Only if enough phonon states are included in the basis used by the gate-simulator, will the phase space be closed and thus the phonon-space truncation according to the phonon scheme will guarantee an accurate result.


VI. Fidelity Measures

The ideal XX gate propagator is:












U
^

ideal

=

e

i

χ


σ
x

(
1
)




σ
x

(
2
)





,




(
31
)







where χ is the gate angle. For starting state |ψ0custom-character this produces the ideal final state:










|

ψ
ideal



=



U
^

ideal

|

ψ
0




.






(
32
)







However, a given gate pulse g(t), in general, produces a gate propagator of the form:












U
^

actual

=

e

i

[



χσ
x

(
1
)




σ
x

(
2
)



+

λ


Ê


]



,




(
33
)







where Ê is a Hermitian error operator and λ is its error strength. In this case, and for given initial state |ψ0custom-character, the state fidelity FS is defined as:










F
S

=


|


ψ
ideal

|

ψ
actual



|
2


=

|


ψ
0

|


U
^

ideal





U
^

actual

|

ψ
0




|
2

.







(
34
)







There are two types of error operators, i.e., those that commute with the product of the Pauli operators σx(1)σx(2) and those that do not. If only a single, commuting error operator Ê is present, the state fidelity FS, up to second order in the error strength λ, is:











F
S

=



|


ψ
0



e



-
i



χσ
x

(
1
)




σ
x

(
2
)



+

i

λ

Ê





e


i


χσ
x

(
1
)




σ
x

(
2
)



+

i

λ


Ê



|

ψ
0




|
2


=



|


ψ
0

|

e

i


λ

Ê



|

ψ
0



|
2


=

1
-


λ
2



σ
Ê
2






,




(
35
)








where










σ
Ê
2

=




ψ
0

|

Ê
2

|

ψ
0



-



ψ
0

|
Ê
|

ψ
0





2

.









(
36
)








This means that the state infidelity FS:












F
¯

S

=

1
-

F
S



,




(
37
)







up to second order in the error strength λ, is:











F
_

S

=


λ
2




σ

E
^

2

.






(
38
)







The state infidelity FS is proportional to the square of the error strength λ.


In case the error operator Ê does not commute with the product of the Pauli operators σx1αx(2), the Baker-Hausdorff-Campbell formula can be used to obtain the state fidelity FS, up to second order in the error strength λ,

























F
s

=




"\[LeftBracketingBar]"


ψ
0



"\[RightBracketingBar]"





U
^

ideal





U
^

actual





"\[LeftBracketingBar]"


ψ
0









"\[LeftBracketingBar]"

2


=




"\[LeftBracketingBar]"




ψ
0




"\[RightBracketingBar]"




e


-
i


χ


σ
x

(
1
)




σ
x

(
2
)






e



-
i


χ


σ
x

(
1
)




σ
x

(
2
)



+

i

λ


E
^








"\[LeftBracketingBar]"


ψ
0









"\[LeftBracketingBar]"

2


=





"\[LeftBracketingBar]"




ψ
0




"\[RightBracketingBar]"




e


i

λ


C
^


+

i


λ
2



D
^


+







"\[LeftBracketingBar]"


ψ
0








"\[RightBracketingBar]"


2

=





"\[LeftBracketingBar]"




ψ
0




"\[RightBracketingBar]"



1

+

i


λ

(


C
^

+

λ


D
^



)


-


1
2





λ
2

(


C
^

+

λ


D
^



)

2


+






"\[LeftBracketingBar]"


ψ
0









"\[RightBracketingBar]"


2

=

1
-


λ
2



σ

C
^

2




,




(
39
)







where Ĉ and {circumflex over (D)} are Hermitian operators that can be expressed as linear combinations of nested multi-commutators of the product of the Pauli operators σx(1)σx(2) and the error operator Ê. This implies that in this case, too, the state infidelity FS is proportional to the square of the error strength λ.


Most of the error operators Ê that appear in the present context do not commute with the product of the Pauli operators σx(1)σx2. However, if the error operator Ê can be written in the form Ê=Â{circumflex over (Ω)}, where  is a Hermitian error operator in the computational space and {circumflex over (Ω)} is a Hermitian error operator in the phonon space, and if the error operator  in the computational space fulfills the anti-commutation relation:











{



σ
x

(
1
)




σ
x

(
2
)



,

A
^


}

=


σ
x

(
1
)




σ
x

(
2
)




,



A
^

+

A


σ
x

(
1
)




σ
x

(
2
)




=
0

,




(
40
)







the state infidelity FS can be computed explicitly, which also provides an explicit expression for the operator Ĉ in (39). Examples of error operators  that fulfill (40) are:









A



{


σ
y

(
1
)


,

σ
y

(
2
)


,

σ
z

(
1
)


,


σ
z

(
2
)




σ
x

(
1
)




σ
y

(
2
)



,


σ
x

(
1
)




σ
z

(
2
)




σ
x

(
2
)




σ
y

(
1
)



,


σ
x

(
2
)




σ
z

(
1
)




}

.





(
41
)







Since they act in different spaces, the following conditions are satisfied:















[



σ
x

(
1
)




σ
x

(
2
)



,

Ω
^


]

=
0

,




[


A
^

,

Ω
^


]




=
0.




(
42
)







If (40) is fulfilled, Ûactual becomes:












U
^

actual

=


e


i

χ


σ
x

(
1
)




σ
x

(
2
)



+

i

λ


A
^



Ω
^




=


cos

(

φ
^

)

+


i

(


sin

(

φ
^

)


φ
^


)

[



χσ
x

(
1
)




σ
x

(
2
)



+

i

λ


A
^



Ω
^



]




,




(
43
)








where









φ
^

=




χ
2

+


λ
2




A
^

2




Ω
^

2




.





(
44
)







Then, up to second order in the error strength λ, the state fidelity FS becomes:










F
S

=





"\[LeftBracketingBar]"


1
+


i

(

λ
χ

)



cos

(
χ
)



sin

(
χ
)






ψ
0





"\[LeftBracketingBar]"



A
^



Ω
^




"\[RightBracketingBar]"




ψ
0





+


(

λ
χ

)




sin
2

(
χ
)







ψ
0





"\[LeftBracketingBar]"



σ
x

(
1
)




σ
x

(
2
)




A
^



Ω
^




"\[RightBracketingBar]"




ψ
0





-


(


λ
2


2


χ
2



)




sin
2

(
χ
)






ψ
0





"\[LeftBracketingBar]"




A
^

2




Ω
^

2




"\[RightBracketingBar]"




ψ
0








"\[RightBracketingBar]"


2

.





(
45
)







Now, (40) and (42) lead to:













ψ
0





"\[LeftBracketingBar]"



σ
x

(
1
)




σ
x

(
2
)




A
^



Ω
^




"\[RightBracketingBar]"




ψ
0




=


-




ψ
0





"\[LeftBracketingBar]"



A
^



σ
x

(
1
)




σ
x

(
2
)




Ω
^




"\[RightBracketingBar]"




ψ
0





=


-





ψ
0





"\[LeftBracketingBar]"



Ω
^



σ
x

(
1
)




σ
x

(
2
)




A
^





"\[RightBracketingBar]"




ψ
0




*


=

-






ψ
0





"\[LeftBracketingBar]"



σ
x

(
1
)




σ
x

(
2
)




A
^



Ω
^




"\[RightBracketingBar]"




ψ
0




*

.








(
46
)







This means that custom-characterψ0x(1)σx(2)Â{circumflex over (Ω)}|ψ0custom-character is purely imaginary, and thus:













ψ
0





"\[LeftBracketingBar]"



σ
x

(
1
)




σ
x

(
2
)




A
^



Ω
^




"\[RightBracketingBar]"




ψ
0




=

i



{




ψ
0





"\[LeftBracketingBar]"



σ
x

(
1
)




σ
x

(
2
)




A
^



Ω
^




"\[RightBracketingBar]"




ψ
0




}

.






(
47
)







With this result, the state fidelity FS can be written, up to second order in the error strength λ, as:











F
S

=


1
-


(


λ
2


χ
2


)




sin
2

(
χ
)






ψ
0





"\[LeftBracketingBar]"




A
^

2




Ω
^

2




"\[RightBracketingBar]"




ψ
0





+


(


λ
2


χ
2


)






sin
2

(
χ
)

[



cos

(
χ
)






ψ
0





"\[LeftBracketingBar]"



A
^


Ω



"\[RightBracketingBar]"




ψ
0





-

i


sin

(
χ
)






ψ
0





"\[LeftBracketingBar]"



σ
x

(
1
)




σ
x

(
2
)




A
^


Ω



"\[RightBracketingBar]"




ψ
0






]

2



=

1
-


λ
2



σ

C
^

2





,




(
48
)












C
=



(


sin

(
χ
)

χ

)

[



cos

(
χ
)


A

Ω

-

i


sin

(
χ
)



σ
x

(
1
)




σ
x

(
2
)




A
^



Ω
^



]

=


(


sin

(
χ
)

χ

)



e


-
i


χ


σ
x

(
1
)




σ
x

(
2
)






A
^




Ω
^

.







(
49
)







It should be noted that, because of (42), and since the error operator  in the computational space is assumed to fulfill (40), iσx(1)σx(2)Â{circumflex over (Ω)} is a Hermitian operator. So, Ĉ is Hermitian, as it should be, and Ĉ2Ĉ. With this result, the state fidelity {circumflex over (F)}S can be explicitly written as:


















F
S

=



(


λsin

(
χ
)

χ

)

2



{





ψ
0





"\[LeftBracketingBar]"





A
^



2




Ω
^

2




"\[RightBracketingBar]"




ψ
0




-



ψ
0








"\[RightBracketingBar]"




e


-
i


χ


σ
x

(
1
)




σ
x

(
2
)






A
^



Ω
^




"\[RightBracketingBar]"




ψ
0




2

}

.




(
50
)







The explicit form (48) of the state fidelity FS confirms the general result (39) in cases where the condition (40) is met. Many of the most important error operators occurring satisfy (40) and thus (50) is applicable.


In the case of a two-qubit gate, the error operator Ê takes the form Ê=Σj=1,2 Â(j){circumflex over (Ω)}(j). In this case (48), (49), and (50) may immediately be generalized using the substitution:











A
^



Ω
^








j
=
1

,
2





A
^


(
j
)






Ω
^


(
j
)


.







(
51
)







The output of the gate simulator code is the complete state |ψoutM(τ)custom-character, which includes computational states and phonon states. This way, the complete state information is available, which can be used to compute the state fidelity defined in (34) with |ψactualcustom-character=|ψoutM(τ)custom-character. In Section VII the state fidelity FS is used to assess the quality of the various model Hamiltonians ĤMNc,Ns).


The state fidelity FS, as defined in (34), depends on the initial state |ψ0custom-character. A more global measure of the fidelity of the quantum process that implements the two-qubit XX gate is the process fidelity











F
P

=


1
16



Tr
[


E
exact




E
actual


]



,




(
52
)







where Eexact is the exact XX gate process and Eactual is the actual two-qubit XX-gate process as computed with the gate simulator as described in Section V.


A related fidelity measure, also used in Section VII, is the average gate fidelity FG, which is defined as:











F
G

=


1

8

0









j
=
1


1

6



T


r
[



U
^


e

x

a

c

t





U
^

j





U
^


e

x

a

c

t





E

(


U
^

j

)


]



,




(
53
)







where Ûj, j=1, . . . ,16, is an operator basis in the computational space.


In addition to the state infidelity FS=1−FS, defined in (37), the average gate infidelity FG and the process gate infidelity FP are defined as:















F
¯

G

=

1
-

F
G



,








F
¯

P

=

1
-


F
P

.









(
54
)







For characterizing the quality of the various Hamiltonians, it is useful to define the gate angle error:










Δχ
=

χ
-

π
4



,




(
55
)







where χ is the actual gate angle computed by running the XX gate simulator (see Sections V and VII). A positive gate angle error Δχ corresponds to an over-rotated gate angle χ, while a negative Δχ corresponds to an under-rotated gate angle χ. The error operator associated with the gate angle error Δχ is Êχ=Δχ{circumflex over (σ)}(1){circumflex over (σ)}(2). Then, according to (35), for |ψ0custom-character=|00custom-character|phcustom-character, for instance, where |00custom-character is the computational state and |phcustom-character is any normalized phonon state, the state infidelity FS(χ) caused by Êχ is












F
_

S


(
χ
)


=



(

Δ

χ

)

2

.





(
56
)







VII. Numerical Results

As described in Section IV, the inventors have computed AMFM pulse functions g(t) for gate times ranging from τ=100 μs to τ=600 μs in steps of 100 μs, and used these pulse functions in the XX gate simulator (see Section V). As described in Section V, using the full Hamiltonian ĤMS defined in (5), the full state function |ψ(τ)custom-character that includes both the computational space and the phonon space were computed. From |ψ(τ)custom-character, as described in Section VI, the state infidelity FS, the gate infidelity FG, the process infidelity FP, and the gate angle error Δχ were computed. The results are shown in Table III.









TABLE III







Phonon schemes and infidelities for XX gate between ion pair (2,5) as


a function of gate time τ in μs. All infidelities are in units of 10−4.













τ
100
200
300
400
500
600
















phonon
2255111
4522111
2621111
2621111
2621111
2621111


scheme



F
S

3.1
2.6
4.0
1.9
2.5
1.7



F
G

2.4
2.1
3.1
1.5
2.0
1.3



F
P

3.0
2.6
3.8
1.8
2.5
1.6


Δχ
−0.012
−0.011
−0.011
−0.011
−0.011
−0.011



F
S
c

1.6
1.5
2.9
0.78
1.4
0.61



F
G
c

1.3
1.2
2.2
0.56
1.1
0.47



F
P
c

1.6
1.5
2.7
0.70
1.4
0.58



F
S
Φ, c

0.88
0.14
0.62
0.41
0.34
0.45



F
G
Φ, c

0.67
0.10
0.36
0.28
0.26
0.34



F
P
Φ, c

0.84
0.12
0.45
0.34
0.32
0.42









Accepting ĤMS as a good approximation of ĤR, the most important result from Table III is that a gate infidelity FG<10−4 cannot be achieved if the control pulses g(t) are constructed on the basis of the standard Hamiltonian ĤS. Nevertheless, while not quite meeting the goal of ≤10−4, the infidelities obtained are very close to this goal. It can also be seen that the three different infidelity measures, i.e., the state infidelity FS, the average gate infidelity FG, and the process infidelity FP yield similar results and any one of them may be used as a proxy for assessing the infidelity of the two-qubit XX gate.


Next, the control pulse g(t) will be fixed using the 300 μs pulse from Table III and the quality of the various approximations ĤM(Nc,Ns) is determined with respect to the full Hamiltonian ĤMS by computing the process infidelity {circumflex over (F)}P for some of the Hamiltonians ĤM(Nc,Ns). The result is shown in Table IV. It can be seen that, expectedly, FP<<10−4 for ĤM−2,1)S, since in this case the pulse is generated on the basis of the standard Hamiltonian ĤS and the gate simulator is controlled by the standard Hamiltonian ĤS as well. So, perfect fidelity is ideally expected. The difference from zero in Table IV in this case is not due to the accuracy of the numerical integrator, which, as stated in Section V is of the order of 10−7, but is due to the phonon scheme. Including more phonon states in the basis increases the accuracy of the simulations and drives the infidelity in the case of ĤMNc=−2,Ns=1)S closer to zero. The table entry for (Nc=−2, Ns=1) also provides us with an estimate of the accuracy of the infidelity entries in Tables III and IV. As indicated by the (Nc=−2, Ns=1) entry in Table IV, the chosen phonon schemes guarantee an accuracy of the computed infidelities of approximately 3×10−5.









TABLE IV







Process infidelities FP in units of 10−4 for phonon


scheme 2621111 and ion pair (2, 5) produced by model


Hamiltonians HM(Nc, Ns). A dash in the table means that


the corresponding quantity was not computed.












Ns = 1
Ns = 3
Ns = 5
Ns = ∞

















Nc = −2
0.31
1.6
1.6
1.6



Nc = 0
2.5
3.8
3.8




Nc = 2
2.5
3.8
3.8




Nc = ∞



3.8










Looking at the infidelity results in Table IV for the Hamiltonians expanded to zeroth and second orders in the cos-term in (5), it can be seen that neglecting the zeroth-order term in (5) (the carrier term) is not justified. But it can also be seen that, apparently, expansion to second order of the cos-term of (5) is not necessary. This is shown analytically in more detail in Sections IX. B. and IX. C.


Turning now to the expansions of the sin-term of (5), Table IV shows that truncating this expansion at the first order of the sin function, i.e., linearizing the sin-term in the Lamb-Dicke parameters, is not accurate enough. As a consequence, the expansion of the sin term in (5) has to be carried to the third order in the Lamb-Dicke parameters, but expansion to the 5th order is not necessary.


As an overall result of the performance tests for different (Nc, Ns) model Hamiltonians, ĤM(0,3) is a good enough approximation of ĤMS on the ≤10−4 fidelity level. Conversely, the important result is that pulse construction on the basis of the standard Hamiltonian ĤSM(−2,1) does not yield infidelities <10−4. Thus, to improve control-pulse construction, at a minimum, the carrier term [zeroth-order cos term in (5)] and the third-order sin term in (5) needed to be included. In Sections IX. B. and IX. C., the effects of these two additional Hamiltonian terms are further explored. It can also be seen analytically that inclusion of the second- and fourth-order terms of the Hamiltonian (5) are not needed.


VIII. Calibration

Table III shows that the gate angle error Δχ is quite large and may make a significant contribution to the infidelity. However, by slightly adjusting the amplitude of the control pulse g(t), the gate angle error Δχ can be completely eliminated and thus any contribution to the infidelity that otherwise would be due to the gate angle error Δχ can be eliminated. Adjusting the pulse function g(t) to result in Δχ=0 is called calibration. This procedure, extensively used in the laboratory, is an attractive way of reducing the infidelity, since the phase-space closure condition (14) linear in the amplitude of the control pulse g(t), is invariant under a change in the control-pulse amplitude. So, despite calibration of the pulse, phase-space closure is always guaranteed exactly, independent of the pulse amplitude.


The error operator for the gate angle error Δχ is Ê=Δχ{circumflex over (σ)}x(1){circumflex over (σ)}x(2), which trivially commutes with {circumflex over (σ)}x(1){circumflex over (σ)}x(2). Therefore, for all entries in Table III, the contribution of the gate angle error Δχ to the state infidelity FS may be estimated according to (35) and (36) as:












F
S

¯


(

Δ

χ

)


=




(

Δ

χ

)

2

[

1
-






ψ
0





"\[LeftBracketingBar]"



σ
x

(
1
)




σ
x

(
2
)






"\[LeftBracketingBar]"


ψ
0








2


]

.





(
57
)







Based on this result, and for all pulse lengths listed in Table III, FS(Δχ)˜1.2×10−4 is obtained, which makes a significant contribution to the infidelities listed in Table III. However, as mentioned above, this infidelity may be eliminated by calibrating the control pulse. Denoting by χtarget the desired gate angle and by χgtarget+Δχ the gate angle actually obtained with the control pulse g(t), the calibration factor c, i.e., the (real) factor by which the amplitude of g(t) has to be multiplied to eliminate the gate angle error Δχ is obtained explicitly, with (15), as:









c
=



(


χ
target

/

χ
g


)


1
/
2


=



(


χ

t

a

r

g

e

t




χ

t

a

r

get


+
Δχ


)


1
/
2


.






(
58
)







The entries for the state infidelity FSc, the gate infidelity FGc, and the process infidelity FPc in Table III represent the results for the respective infidelities computed with the same control pulses used for the corresponding entries FS, FG, and FP, but multiplied (calibrated) with the calibration factor c, computed according to (58) with the corresponding gate angle error Δχ values from Table III and χtarget=π/4. As expected, the result is a significant reduction of the infidelity. Since the starting state |ψ0custom-character for the results in Table III is |ψ0custom-character=|00custom-character|0custom-characterph, a reduction by Δχ2 can be expected. This agrees well with the results in Table III. Since they can no longer be due to the gate angle error Δχ, the rest of the infidelities in Table III have to come from other sources. To look for these sources, the XX-gate propagator can be computed via a Magnus expansion as outlined in the following section.


IX. Magnus Expansion

Given the time-dependent Schrödinger equation:













i





t





"\[LeftBracketingBar]"


ψ

(
t
)






=



H
^

(
t
)





"\[LeftBracketingBar]"


ψ

(
t
)






,




(
59
)







the time evolution operator Û(τ) of (59) over the time interval τ may be constructed systematically and analytically, using a Magnus expansion, i.e., up to 3rd order in the Hamiltonian:












U
^

(
τ
)

=

exp

[


i




W
^

1

(
τ
)


+

i




W
^

2

(
τ
)


+

i




W
^

3

(
τ
)


+


]


,




(
60
)








where












W
^

1

(
τ
)

=


1
i





0


τ




(

-

)




H
^

(

t
1

)


d


t
1





,




(
61
)













W
^

2

(
τ
)

=


1

2

i






0


τ



d


t
1





0



t
1




d



t
2

[



(

-

)




H
^

(

t
1

)


,


(

-

)




H
^

(

t
2

)



]







,









W
^

3

(
τ
)

=


1

6

i






0


τ



d


t
1





0



t
1




d


t
2





0



t
2




d


t
3



{


[



(

-

)




H
^

(

t
1

)


,

[



(

-

)




H
^

(

t
2

)


,


(

-

)




H
^

(

t
3

)



]


]

+


[



(

-

)




H
^

(

t
3

)


,

[



(

-

)




H
^

(

t
2

)


,


(

-

)




H
^

(

t
1

)



]


]


}












are Hermitian operators.


In this section, a consistent Magnus expansion up to 4th order in the Lamb-Dicke parameters ηpj is shown. Therefore, expanding the cosine-term in (5) up to fourth order in {circumflex over (V)}2 and the sine-term in (5) up to third order in {circumflex over (V)}j, the Hamiltonian:











H
^

(
t
)

=


g

(
t
)








α
=
0

4





h
ˆ

α

(
t
)






(
62
)







is used in the Magnus expansion (61), where
















h
ˆ

0



(
t
)


=



j


σ
y

(
j
)




,










h
ˆ

1



(
t
)


=



j




V
j

ˆ



(
t
)




σ
ˆ

x

(
j
)





,










h
ˆ

2



(
t
)


=


-

1
2






j




V
ˆ

j
2



(
t
)




σ
ˆ

y

(
j
)






,










h
ˆ

3



(
t
)


=


-

1
6






j




V
ˆ

j
3



(
t
)




σ
ˆ

x

(
j
)






,









h
ˆ

4



(
t
)


=


1

2

4






j




V
ˆ

j
4



(
t
)





σ
ˆ

y

(
j
)


.











(
63
)







It should be noted that ĥ0(t) is actually time independent, but the time argument is formally kept for notational convenience. Based on the results listed in Table IV, it is known that the zeroth order of cos[{circumflex over (V)}j(t)] contributes substantially to the infidelity, while the 2nd and higher orders of cos[{circumflex over (V)}j(t)] do not, and that the first and third orders of sin[{circumflex over (V)}j(t)] contribute substantially, while the 5th and higher orders do not. Thus, the Hamiltonian (62) covers all these important cases. According to Table IV, it may not be necessary to include the second- and fourth-order expansion terms of the cosine function in (5). However, for a consistent expansion up to fourth order in the Lamb-Dicke parameters, and also to show that these terms are negligible, they are included in the expansion (62) of (5).


In Section IX. A., Ŵ1(τ) is computed on the basis of (62). In Sections IX.B. and IX.C., Ŵ2(τ) and Ŵ3(τ), respectively are constructed. Many of the resulting error terms are found to be negligible. Further, the most significant terms that make significant contributions to the infidelity are identified.


With the operators defined in (63), the following Hermitian operators are defined:












T
ˆ

α

=

-



0


τ






h
ˆ

α

(
t
)



g

(
t
)


d

t




,

α
=
0,1,2,3,4,





(
64
)















T
ˆ

αβ

=


-

1

2

i







0


τ



d


t
1





0



t
1




d


t
2



g

(

t
1

)




g

(

t
2

)

[




h
ˆ

α

(

t
1

)

,



h
ˆ

β

(

t
2

)


]







,
α
,

β
=
0,1,2,3,4,





(
65
)








and











T
ˆ


a

β

γ


=


(

1
6

)





0


τ



d


t
1





0



t
1




d


t
2





0



t
2




d


t
3



g

(

t
1

)



g

(

t
2

)



g

(

t
3

)













{


[




h
ˆ

α

(

t
1

)

,

[



h
ˆ

β

(

t
2

)

]

,



h
ˆ

γ

(

t
3

)


]

+

[




h
ˆ

a

(

t
3

)

,

[



h
ˆ

β

(

t
2

)

]

,



h
ˆ

γ

(

t
1

)


]


}

,
α
,
β
,

γ
=

0,1,2,3,4
.







(
66
)







In the following sections, these operators are used (i) to compute Ŵ1, Ŵ2, and Ŵ3 and (ii) to compute infidelity contributions to the gate evolution operator Û(τ) defined in (60).


IX. A. First Order

With the definition in (64) Ŵ1(τ) becomes:













W
^

1

(
τ
)

=







α
=
0

4





T
ˆ

α

(
τ
)



,




(
67
)







where the carrier condition (13) together with













0


τ




g

(
t
)



e

i


ω
p


t



d

t


=


0




0


τ




g

(
t
)





V
ˆ

j

(
t
)


d

t



=
0


,




(
68
)







is used to arrive at













T
ˆ

0

(
τ
)

=
0

,




(
69
)
















T
ˆ

1

(
τ
)

=
0

,




(
70
)
















T
ˆ

2

(
τ
)

=



(

1
2

)








p

q

j




η
p
j



η
q
j





σ
ˆ

y

(
j
)


[



Q

(


ω
p

+

ω
q


)




a
^

p





a
^

q



+

h
.
c
.


]


+








p

q

j

,

p

q





η
p
j



η
q
j




σ
ˆ

y

(
j
)




Q

(


ω
p

-

ω
q


)




a
^

p





a
^

q




,




(
71
)
















T
ˆ

3

(
τ
)

=



1
6









j
=
1

,
2





σ
ˆ

x

(
j
)






0


τ




g

(
t
)






V
j

ˆ

3

(
t
)


dt



=


1
6








p
,
q
,
r
,
j




η
p
j



η
q
j



η
r
j




σ
ˆ

x

(
j
)









{



Q

(


ω
p

+

ω
q

+

ω
r


)




a
^

p





a
^

q





a
^

r



+


Q

(


ω
p

+

ω
q

-

ω
r


)




a
^

p





a
^

q





a
^

r


+


Q

(


ω
p

-

ω
q

+

ω
r


)




a
^

p





a
^

q




a
^

r



+


Q

(


-

ω
p


+

ω
q

+

ω
r


)




a
^

p




a
^

q





a
^

r



+

h
.
c
.


}

,





(
72
)








and












T
ˆ

4

(
τ
)

=



(

-

1

2

4



)





j




σ
ˆ

y

(
j
)






0


τ




g

(
t
)






V
j

ˆ

4

(
t
)


dt





=


(

-

1

2

4



)







j




σ
ˆ

y

(
j
)






0


τ




g

(
t
)








p

q

r

s




η
p
j



η
q
j



η
r
j



η
s
j










{




a
^

p





a
^

q





a
^

r





a
^

s




e


i

(


ω
p

+

ω
q

+

ω
r

+

ω
s


)


t



+



a
^

p





a
^

q





a
^

r





a
^

s



e


i

(


ω
p

+

ω
q

+

ω
r

-

ω
s


)


t







}

,





(
73
)







where Q(w), defined in (22), is used, in particular, with the carrier condition (13), Q(0)=0.


While {circumflex over (T)}0(τ) and {circumflex over (T)}1(τ) vanish, {circumflex over (T)}2(τ), {circumflex over (T)}3(τ), and {circumflex over (T)}4(τ) need to be investigated further since they may produce undesirable contributions to the infidelity of the XX gate.


According to (71), the size of {circumflex over (T)}2(τ) is controlled by










γ
2

=


max

pqj
,

σ
=

±
1









"\[LeftBracketingBar]"



η
p
j



η
q
j



Q

(


ω
p

+

σ


ω
q



)




"\[RightBracketingBar]"


.






(
74
)







Numerically, for the 300 μs test pulse,











γ
2

=


3
.
5

×
1


0

-
6




,




(
75
)







was obtained. Since γ2 is significantly smaller than 10−4, {circumflex over (T)}2(τ) may be neglected. According to (72), the size of {circumflex over (T)}3(τ) is controlled by










γ
3

(
+
)


=


(

1
6

)


max
pqrj




"\[LeftBracketingBar]"



η
p
j



η
q
j



η
r
j



Q

(


ω
p

+

ω
q

+

ω
r


)




"\[RightBracketingBar]"







(
76
)








and












γ
3

(
-
)


=


(

1
6

)


max
pqrj




"\[LeftBracketingBar]"



η
p
j



η
q
j



η
r
j



Q

(


ω
p

+

ω
q

-

ω
r


)




"\[RightBracketingBar]"









=


(

1
6

)


max
pqrj




"\[LeftBracketingBar]"



η
p
j



η
q
j



η
r
j



Q

(


ω
p

-

ω
q

+

ω
r


)




"\[RightBracketingBar]"









=


(

1
6

)


max
pqrj





"\[LeftBracketingBar]"



η
p
j



η
q
j



η
r
j



Q

(


-

ω
p


+

ω
q

+

ω
r


)




"\[RightBracketingBar]"


.









(
77
)







For the 300 μs test pulse,











γ
3

(
+
)


=


5
.
8

×
1


0

-
8




,




(
78
)











γ
3

(
-
)


=


3
.
1

×
1


0

-
4




,




was obtained. Since {circumflex over (σ)}x(j) commutes with {circumflex over (σ)}x(1){circumflex over (σ)}x(2), (35) may be used to estimate the infidelity FS(T3)) caused by {circumflex over (T)}3(τ). Since, according to (78), both γ3(+) and γ3(−) are smaller than 10−3, and since FS(T3), according to (35), involves the square of {circumflex over (T)}3(τ), the infidelity caused by {circumflex over (T)}3(τ) is negligible on the level of 10−4.


According to (73), the size of {circumflex over (T)}4(τ) is controlled by










γ
4

=



max

j
,
pqrs





σ
p



σ
q



σ
r



σ
s


=

±
1







"\[LeftBracketingBar]"



η
p
j



η
q
j



η
r
j



η
s
j



Z

(



σ
p



ω
p


,



σ
q



ω
q


+


σ
r



ω
r


+


σ
s



ω
s




)




"\[RightBracketingBar]"


.






(
79
)







For the 300 μs test pulse,











γ
4

=


1
.
1

×
1


0

-
7




,




(
80
)







was obtained. Therefore, {circumflex over (T)}4(τ) can be neglected.


As a result of this section it has been found that, on the 10−4 level, the first-order terms in the Magnus expansion do not contribute to the infidelity. However, it should be noted that this is only true if the pulse function g(t) satisfies the carrier condition (13). Thus, the carrier condition (13) is an important condition that needs to be required for high-fidelity XX gates.


IX. B. Second Order

Now, the second-order terms (65) are evaluated in the Magnus expansion, i.e., Ŵ2(τ) is computed analytically for Ĥ(t) defined in (62) up to fourth order in the Lamb-Dicke parameters η. With the definitions (65) of the operators {circumflex over (T)}αβ(τ), the definition (15) of the gate angle, making use of the carrier condition (13), and the functions defined in (16)-(28),













W
^

2

(
τ
)

=






α
,

β
=
0





4





T
ˆ

αβ

(
τ
)



,




(
81
)







was obtained, where the operators {circumflex over (T)}αβ, listed only up to fourth order in η, are












T
ˆ


0

0


=
0

,




(
82
)

















T
ˆ


0

1


=

-





j
=
1

,
2





σ
ˆ

z

(
j
)








0



τ




g

(
t
)



G

(
t
)





V
j

ˆ

(
t
)



dt












=

-





jp




η
p
j





σ
ˆ

z

(
j
)


[



f

(

ω
p

)




a
^

p



+



f
*

(

ω
p

)




a
^

p



]





,







(
83
)















T
ˆ


0

2


=
0

,





(
84
)


















T
ˆ


0

3



=


(

1
6

)







j
=
1

,
2





σ
ˆ

z

(
j
)








0



τ



g


(
t
)


G


(
t
)






V
j

ˆ

3

(
t
)



dt













=


(

1
6

)







pqrj





σ
ˆ

z

(
j
)




η
p
j



η
q
j



η
r
j



{



f

(


ω
p

+

ω
q

+

ω
r


)




a
^

p





a
^

q





a
^

r



+















f

(


ω
p

+

ω
q

-

ω
r


)




a
^

p





a
^

q





a
^

r














+

f

(


ω
p

-

ω
q

+

ω
r


)





a
^

p





a
^

q




a
^

r



+


f

(


-

ω
p


+

ω
q

+

ω
r


)




a
^

p




a
^

q





a
^

r



+

h
.
c
.


}

,








(
85
)













T
ˆ


0

4


=
0

,












T
ˆ

10

=


T
ˆ

01


,





(
87
)
















T
ˆ


1

1


=


χ
˜

+

χ



σ
ˆ

x

(
1
)





σ
ˆ

x

(
2
)





,




(
88
)















T
ˆ


1

2


=



(

1
4

)







j





σ
ˆ

z

(
j
)








0



τ




dt
1







0




t
1





dt
2



g

(

t
1

)



g

(

t
2

)



{




V
ˆ

j

(

t
1

)

,




V
j

ˆ

2

(

t
2

)


}








-






pq
,

j

k






η
p
j



η
p
k



η
q
k




σ
ˆ

x

(
j
)






σ
ˆ

y

(
k
)


[




S
p

(

ω
q

)




a
^

q



+



S
p
*

(

ω
q

)




a
^

q



]





,




(
89
)

















T
ˆ

13

=



(

-

1
2


)







jkp





σ
ˆ

x

(
j
)





σ
ˆ

x

(
k
)




η
p
j



η
p
k







0



τ




dt
1





0




t
1


















dt


2



g

(

t
1

)



g

(

t
2

)



sin
[


ω
p

(


t
1

-

t
2


)

]





V
ˆ

j
2

(

t
1

)








=



(

-

1
2


)







jkpqr





σ
ˆ

x

0
)





σ
ˆ

x

(
k
)




η
p
j



η
p
k



η
q
j




η
r
j

[



S
p

(


ω
q

+

ω
r


)




a
^

q





a
^

r

















+



S
p

(


ω
q

-

ω
r


)





a
^

q





a
^

r


+



S
p
*

(


ω
q

-

ω
r


)




a
^

q




a
^

r



+



S
p
*

(


ω
q

+

ω
r


)




a
^

q




a
^

r



]

,







(
90
)















T
ˆ


2

0


=
0

,





(
91
)
















T
ˆ


2

1


=


T
ˆ


1

2



,




(
92
)















T
ˆ

22

=


(

1
2

)







jkp




η
p
j



η
p
k




σ
ˆ

y

(
j
)





σ
ˆ

y

(
k
)








0



τ




dt
1







0




t
1






dt


2



g

(

t
1

)



g

(

t
2

)



sin
[


ω
p

(


t
1

-

t
2


)

]



{




V
ˆ

j

(

t
1

)

,



V
ˆ

k

(

t
2

)


}









,




(
93
)















T
ˆ


3

0


=


T
ˆ

03


,





(
94
)
















T
ˆ


3

1


=


T
ˆ


1

3



,




(
95
)








and










T
ˆ


4

0


=
0.





(
96
)








The above explicit, analytical results are computed making explicit use of the carrier condition (13).


Since {circumflex over (χ)} in (88) is only a c-number, which causes only a global phase, {circumflex over (T)}11 generates the desired XX gate. All the other operators {circumflex over (T)}αβ in (82)-(96), if not identically zero, are unwanted error operators that generate infidelities. Because of symmetries and the operators that are identically zero, the sizes of only five remaining, non-zero error operators, i.e., {circumflex over (T)}01, {circumflex over (T)}03, {circumflex over (T)}12, {circumflex over (T)}13, and {circumflex over (T)}22 need to be investigated.


The size of {circumflex over (T)}01 is controlled by










γ

0

1


=


max
pj





"\[LeftBracketingBar]"



η
p
j



f

(

ω
p

)




"\[RightBracketingBar]"


.






(
97
)







For the 300 μs test pulse











γ

0

1


=


1
.
8

×
1


0

-
6




,




(
98
)







was obtained. Thus, on the 10−4 level, {circumflex over (T)}01 can safely be neglected.


Next, {circumflex over (T)}03 is evaluated, which proceeds in analogy to the evaluation of {circumflex over (T)}3(τ) in Section IX. A. The size of {circumflex over (T)}03 is controlled by










γ
03

(
+
)


=


(

1
6

)


max
pqrj




"\[LeftBracketingBar]"



η
p
j



η
q
j



η
r
j



f

(


ω
p

+

ω
q

+

ω
r


)




"\[RightBracketingBar]"







(
99
)








and












γ
03

(
-
)


=


(

1
6

)


max
pqrj




"\[LeftBracketingBar]"



η
p
j



η
q
j



η
r
j



f

(


ω
p

+

ω
q

-

ω
r


)




"\[RightBracketingBar]"









=


(

1
6

)


max
pqrj




"\[LeftBracketingBar]"



η
p
j



η
q
j



η
r
j



f

(


ω
p

-

ω
q

+

ω
r


)




"\[RightBracketingBar]"









=


(

1
6

)


max
pqrj





"\[LeftBracketingBar]"



η
p
j



η
q
j



η
r
j



f

(


-

ω
p


+

ω
q

+

ω
r


)




"\[RightBracketingBar]"


.









(
100
)







For the 300 μs test pulse,











γ

0

3


(
+
)


=


7
.
4

×
1


0

-
10




,




(
101
)











γ

0

3


(
-
)


=


9
.
3

×
1


0

-
10




,




was obtained. Thus, {circumflex over (T)}03 is negligible.


According to (89), the operator {circumflex over (T)}12 consists of two parts, an anti-commutator part and a part that originated from a commutator. The size of the anti-commutator part of {circumflex over (T)}12 is controlled by










γ

1

2


(
a
)


=



max

j
,
pqr





σ
p



σ
q



σ
r


=

±
1







"\[LeftBracketingBar]"



η
p
j



η
q
j



η
r
j



Z

(



σ
p



ω
p


,



σ
q



ω
q


+


σ
r



ω
r




)




"\[RightBracketingBar]"


.






(
102
)







The commutator part is controlled by










γ

1

2


(
c
)


=


max

pq
,

j

k







"\[LeftBracketingBar]"



η
p
j



η
p
k



η
q
k




S
p

(

ω
q

)




"\[RightBracketingBar]"


.






(
103
)







For the 300 μs test pulse both turned out to be very small. Thus, {circumflex over (T)}12 can be neglected.


The operator {circumflex over (T)}13 in (90) can be split into a diagonal part











T
ˆ


1

3


(
d
)


=


(

-

1
2


)







jpqr





(

η
p
j

)

2



η
q
j




η
r
j

[




S
p

(


ω
q

+

ω
r


)




a
^

q





a
^

r



+



S
p

(


ω
q

-

ω
r


)




a
^

q





a
^

r


+



S
p
*

(


ω
q

-

ω
r


)




a
^

q




a
^

r



+



S
p
*

(


ω
q

+

ω
r


)




a
^

q




a
^

r



]








(
104
)







and an off-diagonal part











T
ˆ


1

3


(
o
)


=


(

-

1
2


)







jkpqr





σ
ˆ

x

(
1
)





σ
ˆ

x

(
2
)




η
p

(
1
)







η
p

(
2
)


[



η
q

(
1
)




η
r

(
1
)



+


η
q

(
2
)




η
r

(
2
)




]

[




S
p

(


ω
q

+

ω
r


)




a
^

q





a
^

r



+



S
p

(


ω
q

-

ω
r


)




a
^

q





a
^

r


+



S
p
*

(


ω
q

-

ω
r


)




a
^

q




a
^

r



+



S
p
*

(


ω
q

+

ω
r


)




a
^

q




a
^

r



]

.








(
105
)







The size of {circumflex over (T)}3(d) is controlled by










γ

1

3


(
d
)


=


max




j
,
pqr






σ
=

±
1










"\[LeftBracketingBar]"




(

η
p
j

)

2



η
q
j



η
r
j




S
p

(


ω
q

+

σω
r


)




"\[RightBracketingBar]"


.






(
106
)







For the 300 μs test pulse,











γ

1

3


(
d
)


=


1
.
1


7
×
1


0

-
3




,




(
107
)







were obtained. Thus, compared to the target infidelity of <<10−4, {circumflex over (T)}13(d) cannot be dismissed outright. However, taking {circumflex over (T)}13(d) as the error operator and since {circumflex over (T)}13(d) commutes with σx(1)αx(2), the infidelity estimate (35) can be used, which involves the squares of {circumflex over (T)}13(d), i.e., the contribution of {circumflex over (T)}13(d) to the infidelity of Û(τ) is expected to be of the order of (γ13(d))2˜10−6. This means that the contribution of {circumflex over (T)}13(d) to the infidelity of Û(τ) can be neglected.


The term {circumflex over (T)}13(o) contains σx(1)σx(2) and thus contributes to over/under rotation of the XX gate, i.e., it contributes to Δχ (see Table III). The operator {circumflex over (T)}13(o) acts in the computational space but also produces phonon excitations. However, according to (105), the two-phonon excitation terms are proportional to Spqr), which are nonresonant and very small. Assuming that the initial state starts out in the phonon ground state, |0>ph, the operator {circumflex over (T)}13(o) is, to an excellent approximation,











T
ˆ


1

3


(
0
)


=


(

-

1
2


)








p

q




η
p

(
1
)





η
p

(
2
)


[



(

η
q

(
1
)


)

2

+


(

η
q

(
2
)


)

2


]



σ
x

(
1
)




σ
x

(
2
)






S
p

(
0
)

.






(
108
)







Now, with (15),















p



η
p

(
1
)




η
p

(
2
)





S
p

(
0
)


=







p



η
p

(
1
)




η
p

(
2
)






0
τ


d


t
1





0

t
1



d


t
2



g

(

t
1

)



g

(

t
2

)



sin
[


ω
p

(


t
1

-

t
2


)

]






=


χ
2

.






(
109
)







With this result,











T
ˆ


1

3


(
0
)


=


[


(

-

χ
4


)








j

p





(

η
p
j

)

2


]



σ
x

(
1
)





σ
x

(
2
)


.






(
110
)







The prefactor of the αx(1)σx(2) operator is a c-number. Therefore, {circumflex over (T)}13(o) produces a contribution to the gate angle χ. Since {circumflex over (T)}31={circumflex over (T)}13, the total contribution to the gate angle error Δχ is










Δ

χ

=


(

-

χ
2


)








j

p






(

η
p
j

)

2

.






(
111
)







Numerically, for the N=7 case (see Table II),

















j

p





(

η
p
j

)

2


=


2
.
4


5
×
1


0

-
2




,




(
112
)







was obtained. For χ=π/4, this results in











Δ

χ

=


-

9
.
6



2
×
1


0

-
3




.




(
113
)







According to the numerical simulations (see Table III), Δχ≈−0.011 is obtained. Thus, the analytical calculations predict the correct sign (under-rotation) of χ. In addition, the magnitude of the relative error of the analytical prediction is (0.011−9.62×10−3)/0.011≈0.13, i.e., the analytical prediction is only of the order of 10% off.


According to (111), Δχ depends only on the Lamb-Dicke parameters, and not on the gate duration τ. This is reflected in Table III and explains why Δχ in Table III is approximately constant, independent of τ.


Summarizing the results obtained in this Section, it is found that the second-order Magnus-expansion operators yield only two substantial contributions, i.e., the operator {circumflex over (T)}11, which generates the desired XX gate and the operator 2{circumflex over (T)}13 which explains the under-rotation of the gate angle, its approximate independence of the gate time τ, and, approximately, its size, as listed in Table Ill.


At the end of Section VIII, it is noted that Δχ explains a significant contribution to the infidelity of Û(τ), but cannot explain the entire infidelity contribution. Thus, the additional sources of infidelity in the various orders of the Magnus expansion were explored. In this section the Inventors have found that the second order explains only the origin of Δχ, but does not reveal any additional significant sources of infidelity. Since the second order of the Magnus expansion did not reveal these sources, the third order of the Magnus expansion is now investigated, which, indeed, reveals the remaining significant sources of infidelity. In addition, it will be found that this source of infidelity can be eliminated by the addition of a single linear equation to the control-pulse construction protocol.


IX. C Third Order

In this section, Ŵ3(τ) is computed. With the definitions (66) stated at the end of the introduction to Section IX,












W
^

3

(
τ
)

=







j

k

i





T
ˆ

jkl






(
114
)







was obtained. All operators {circumflex over (T)}jkl up to fourth order in η are listed in Section XIII. There is only a single operator of zeroth order in η, i.e., {circumflex over (T)}000˜η0. It is trivially zero and does not contribute to the infidelity.


There are three operators of first order in η, i.e., {circumflex over (T)}001, {circumflex over (T)}010, {circumflex over (T)}100, where [see Section XIII]{circumflex over (T)}010=2{circumflex over (T)}001, and {circumflex over (T)}100=0. This means that only {circumflex over (T)}001's contribution to the infidelity has to be investigated. With (25), the infidelity caused by {circumflex over (T)}001 is controlled by










γ

0

0

1


=


max
jp





"\[LeftBracketingBar]"



η
p
j



J
p




"\[RightBracketingBar]"


.






(
115
)







For the 300 μs control pulse,











γ

0

0

1


=


1
.
2

×
1


0

-
6




,




(
116
)







was obtained. Therefore, {circumflex over (T)}001, and with it {circumflex over (T)}010, are negligible. Since {circumflex over (T)}100=0, all operators ˜η1 can be neglected.


There are six operators of second order in η, i.e., {circumflex over (T)}002, {circumflex over (T)}011, {circumflex over (T)}020, {circumflex over (T)}101, {circumflex over (T)}110, and {circumflex over (T)}200. Of these, according to Section XIII, only {circumflex over (T)}011, {circumflex over (T)}101, and {circumflex over (T)}110 are nonzero, and of those, only {circumflex over (T)}011 and {circumflex over (T)}110 are non-negligible. While {circumflex over (T)}011 acts only on the computational space, {circumflex over (T)}110 also has a part that produces phonon excitations. This part, however, is negligibly small. As an overall result of the operators ˜η2, it has been found that the effective error operator corresponding to the sum of the leading parts of {circumflex over (T)}011 and {circumflex over (T)}110 is:











E
^



σ
x



σ
z



=

4




Φ
[

η
,
g

]

[




σ
ˆ

x

(
1
)





σ
ˆ

z

(
2
)



+



σ
ˆ

x

(
2
)





σ
ˆ

z

(
1
)




]

.






(
117
)







The inventors have checked that all operators of order three and four in η are negligible. Thus, (117) is the only significant error operator that results from the third-order Magnus expansion. It should be noted that this operator acts only in the computational space, not in the phonon space. With (50) and λ=4Φ[η, g], the infidelity contribution of (117) for |ψ0custom-character=|00custom-character|0custom-characterph.













F
S

¯


(


σ
x



σ
z


)


=




(


λ


sin

(
χ
)


χ

)

2






ψ
0





"\[LeftBracketingBar]"


[




σ
ˆ

x

(
1
)





σ
ˆ

z

(
2
)



+



σ
ˆ

x

(
2
)





σ
ˆ

z

(
1
)




]



"\[RightBracketingBar]"




ψ
0





=


(


4

λ

π

)

2



,




(
118
)







was obtained. For the 300 μs test pulse,










λ
=


1
.
1


7
×
1


0

-
2




,




(
119
)







was obtained. Thus, with (118),













F
S

¯


(


σ
x



σ
z


)


=


2
.
2

×
1


0

-
4




,




(
120
)







was obtained. Together with (113), an estimate for the total infidelity of the 300 μs test pulse is obtained according to:











F
_

S

=




(
Δχ
)

2

+


F
_

S

(


σ
x



σ
z


)



=




(


-
9.62

×

10

-
3



)

2

+

2.2
×

10

-
4




=

3.1
×


10

-
4


.








(
121
)







According to Table III, this accounts for about 80% of the infidelity of the 300 μs test pulse. Since, via calibration, Δχ can always be set to zero, generating control pulses that zero out the Φ functional may go a long way to reduce the infidelity. How to generate such control pulses, and that this recipe actually works to suppress the infidelity below 10−4, is shown in the following section.


X. Improved Control-Pulse Construction

In Section VIII, it has been argued and proved numerically, that a significant portion of the infidelity can be removed by calibration of the control pulse. Here, it is shown that by eliminating the infidelity due to the Φ-functional (see Section IX. C.), the infidelity can be further suppressed below the level of 10−4. To eliminate Φ, the auxiliary condition:















n




B
n

n


=
0




(
122
)







is added to the AMFM pulse-solver code and obtain new pulses {tilde over (g)}(t) that zero out Φ[η, {tilde over (g)}], defined in (27). That the AMFM code with the condition (122) added produces control pulses {tilde over (g)}(t) with Φ[η, {tilde over (g)}]=0 was confirmed explicitly. As described in Section VIII, {tilde over (g)}(t) may be renormalized (calibrated) such that {tilde over (g)}(t) not only produces Φ[η, {tilde over (g)}]=0, but simultaneously produces Δχ=0. Running the gate-simulator code (see Section V) with the calibrated pulses {tilde over (g)}(t), the infidelities FSΦ,c, FGΦ,c, and FΦΦ,c were found as shown in Table III. It can be sees that in all cases the calibrated pulses {tilde over (g)}(t) produce infidelities below 10−4. It should be noted that the calibrated pulses {tilde over (g)}(t) require only insignificantly larger power compared with the original pulses g(t). This is as expected, since only one additional condition, i.e., the auxiliary condition (122), was added to the original set of linear phase-space closure conditions (14). Thus, the computation of the pulse function g(t) involves a linear process of solving a set of linear equations with respect to the Fourier coefficients Bn. It should be noted that, in conjunction with calibration, the construction of the improved AMFM pulses {tilde over (g)}(t) is still a linear process. Nonlinear optimizer codes are not required.


XI. Scaling

So far the 7-ion case has been discussed, for which a complete analysis machinery is in place consisting of pulse construction, analytical formulas for error estimates, and a gate simulator that includes all the relevant phonon states (see Section V). The analytical results do not depend on the number of ions N in the chain, i.e., the analytical results are valid for any number of qubits. In particular, as soon as a control pulse is generated (it does not matter whether this is an AM pulse, FM pulse, AMFM pulse, or any other type of pulse), this pulse can immediately be inserted into the analytical formulas, which then may be used to obtain infidelity estimates for this particular N-ion control pulse. This method is illustrated for N=36 by computing the infidelity (118), i.e., the leading source of infidelity, for N=36 uncalibrated control pulses for 2-qubit XX gates between all possible gate combinations (i0, j0), j0=1, . . . , i0−1, i0=2, . . . ,36. This results in 630 gate combinations. The infidelities obtained are displayed in FIG. 8 in the form of a bar graph, where the height of a bar shows the frequency of occurrence of infidelities within the width of the bar. The infidelities in FIG. 8 are in units of 10−4=1 pptt, where the unit “pptt” denotes one part per ten thousand. It can be seen that the infidelities generated by N=36 control pulses constructed on the basis of the Standard Hamiltonian ĤS are significant, and in many cases they are much larger than 10 pptt. This particular error source, in conjunction with calibration, can now be eliminated completely by using the linear construction technique outlined in Section X.


The histogram in FIG. 8 was made for 300 μs AMFM pulses. The question is: How does this scale with the gate time τ. To answer this question, 36-ion AMFM histograms at 700 μs were also computed. The result is that most of the Φ-infidelities for the 700 μs AMFM histogram are below 5 pptt. About half of the gates are good gates with infidelities less than 1 pptt and most of the other gates have Φ-infidelities less than 5 pptt. This indicates that the Φ-infidelity is a sensitive function of gate time τ.


XII: Gate Simulator Matrix Elements

In this section, the matrix elements of the full Hamiltonian ĤMS are presented as well as the ones of the model Hamiltonians Ĥ(Nc,Ns). The matrix elements of the full Hamiltonian, ĤMS are calculated.


The matrix elements of the cosine part of ĤMS are











C



n
1



n
2





;


m
1



m
2






(
j
)



=






n
1



n
2









"\[LeftBracketingBar]"


cos

[






p




η
p
j

(



a
^

p


+


a
^

p


)


]



"\[RightBracketingBar]"




m
1



m
2








=




1
2






n
1



n
2







"\[LeftBracketingBar]"



e

i




p



η
p
i

(



a
^

p


+


a
^

p


)




+


e


-
i





p



η
p
i

(



a
^

p


+


a
^

p


)








"\[LeftBracketingBar]"



m
1



m
2














=



1
2





{








p






n
p





"\[LeftBracketingBar]"



e

i



η
p
j

(



a
^

p


+


a
^

p


)







"\[LeftBracketingBar]"


m
p








+






p






n
p





"\[LeftBracketingBar]"



e

i



η
p
j

(



a
^

p


+


a
^

p


)







"\[LeftBracketingBar]"


m
p










}

.








(
123
)







It can be seen that Cn1n2. . . ;m1m2. . . (j) is real and symmetric in np↔mp. With np≥mp and













n




"\[LeftBracketingBar]"



e

λ



a
^









"\[LeftBracketingBar]"

m







=

{



0




if


m

>
n









λ

n
-
m




(

n
-
m

)

!


[


n
!


m
!


]


1
/
2







if


m


n

,









(
124
)















C



n
1



n
2





;


m
1



m
2






(
j
)



=



1
2









p







e



-


(

η
p
j

)

2


/
2


(



m
p

!



n
p

!


)


1
/
2





(

η
p
j

)



n
p

-

m
p






L

m
p


(


n
p

-

m
p


)


[


(

η
p
j

)

2

]







{







p



i

(


n
p

-

m
p


)



+






p




(

-
i

)


(


n
p

-

m

p




)




}

,





(
125
)







are obtained. Now, define









σ
=


[






p



(


n

p



-

m

p




)


]



mod

4.





(
126
)







Then:











C



n
1



n
2





;


m
1



m
2






(
j
)



=







p







e



-


(

η
p
j

)

2


/
2


(



m
p

!



n
p

!


)


1
/
2





(

η
p
j

)



n
p

-

m
p






L

m
p


(


n
p

-

m
p


)


[


(

η
p
j

)

2

]






{




1
,






if


σ

=
0

,






0
,






if


σ

=
1

,







-
1

,






if


σ

=
2

,






0
,





if


σ

=
3.









(
127
)







Because of












C



n
1



n
2





;


m
1



m
2






(
j
)


~





p






(

η
p
j

)



n
p

-

m
p




,




(
128
)







and |ηpj|<<1, it can be seen that Cn1n2. . . ;m1m2. . . (j) is very close to diagonal, i.e., only the first few off-diagonals are significantly different from zero. This fact can be used to speed up the numerical integration of the system of linear equations significantly.


Similarly,









S



n
1



n
2





;


m
1



m
2






(
j
)


=






n
1



n
2









"\[LeftBracketingBar]"


sin

[






p




η
p
j

(



a
^

p


+


a
^

p


)


]



"\[RightBracketingBar]"




m
1



m
2








=







p







e



-


(

η
p
j

)

2


/
2


(



m
p

!



n
p

!


)


1
/
2





(

η
p
j

)



n
p

-

m
p






L

m
p


(


n
p

-

m
p


)


[


(

η
p
j

)

2

]



{




0
,






if


σ

=
0

,






1
,






if


σ

=
1

,






0
,






if


σ

=
2

,







-
1

,






if


σ

=
3

,











(
129
)







are obtained.


XIII: Third-Order Commutators

In this section, the results of some third-order commutators Tjkl as defined in (66) with η orders ηm, m≤4 are listed, grouped according to their η order m.


Commutators {circumflex over (T)}jkl˜η0:












T
^

000

=
0

,




(
130
)







Commutators {circumflex over (T)}jkl˜η1:












T
^

001

=


(

2
3

)







j
=
1

,
2




[



0


τ




g

(
t
)




G
2

(
t
)





V
^

j

(
t
)


dt


]




σ
^

x

(
j
)






,




(
131
)















T
^

010

=

2



T
^

001



,




(
132
)















T
^

100

=
0

,




(
133
)







Commutators {circumflex over (T)}jkl˜η2:












T
^

002

=
0

,




(
134
)















T
^

011

=


(

8
3

)




Φ
[

η
,
g

]

[




σ
^

x

(
1
)





σ
^

z

(
2
)



+



σ
^

x

(
2
)





σ
^

z

(
1
)




]



,




(
135
)















T
^

020

=
0

,




(
136
)















T
^

101

=


(

-

2
3


)







j
=
1

,
2





σ
^

y

(
j
)






0


τ




dt
1





0



t
1





dt
2



g

(

t
1

)




g

(

t
2

)

[


G

(

t
1

)

-

G

(

t
2

)


]













[





V
^

j

(

t
1

)





V
^

j

(

t
2

)


+




V
^

j

(

t
2

)





V
^

j

(

t
1

)



]

,





(
137
)















T
^

110

=


(

-

2
3


)





0


τ




dt
1





0



t
1





dt
2



g

(

t
1

)



g

(

t
2

)



G

(

t
1

)







j













[





V
^

j

(

t
1

)





V
^

j

(

t
2

)


+




V
^

j

(

t
2

)





V
^

j

(

t
1

)



]




σ
^

y

(
j
)



+


(

4
3

)




Φ
[

η
,
g

]

[




σ
^

x

(
1
)





σ
^

z

(
2
)



+



σ
^

x

(
2
)





σ
^

z

(
1
)




]



,





(
138
)














T
^

200

=
0.




(
139
)







Commutators {circumflex over (T)}jkl˜η3:












T
^

003

=


(

-

1
9


)







j



{



0


τ




g

(
t
)




G
2

(
t
)





V
^

j
3

(
t
)


dt


}




σ
^

x

(
j
)




,




(
140
)















T
^

012

=



(

1
6

)







k




σ
^

x

(
k
)






0


τ




dt
1





0



t
1





dt
2



g

(

t
1

)



g

(

t
2

)



{



G

(

t
2

)

[





V
^

k

(

t
2

)





V
^

k
2

(

t
1

)


+




V
^

k
2

(

t
1

)





V
^

k

(

t
2

)



]

-


G

(

t
1

)

[





V
^

k

(

t
1

)





V
^

k
2

(

t
2

)


+




V
^

k
2

(

t
2

)





V
^

k

(

t
1

)



]


}






-


(

2
3

)







p



η
p
1



η
p
2





0


τ




dt
1





0



t
1





dt
2



g

(

t
1

)



g

(

t
2

)




sin

[


ω
p

(


t
1

-

t
2


)

]



{



[



G

(

t
2

)





V
^

1

(

t
1

)


+


G

(

t
1

)





V
^

1

(

t
2

)



]




σ
^

y

(
1
)





σ
^

z

(
2
)



+


[



G

(

t
2

)





V
^

2

(

t
1

)


+


G

(

t
1

)





V
^

2

(

t
2

)



]




σ
^

y

(
2
)





σ
^

z

(
1
)




}








,




(
141
)















T
^

021

=



(

1
3

)







k




σ
^

x

(
k
)






0


τ




dt
1





0



t
1





dt
2



g

(

t
1

)



g

(

t
2

)




G

(

t
1

)

[





V
^

k
2

(

t
1

)





V
^

k

(

t
2

)


+




V
^

k

(

t
2

)





V
^

k
2

(

t
1

)



]






-


(

2
3

)







p



η
p
1



η
p
2





0


τ




dt
1





0



t
1





dt
2



g

(

t
1

)



g

(

t
2

)




sin

[


ω
p

(


t
1

-

t
2


)

]



{



[



G

(

t
2

)





V
^

1

(

t
2

)


+


G

(

t
1

)





V
^

1

(

t
1

)



]




σ
^

y

(
1
)





σ
^

z

(
2
)



+


[



G

(

t
2

)





V
^

2

(

t
2

)


+


G

(

t
1

)





V
^

2

(

t
1

)



]




σ
^

y

(
2
)





σ
^

z

(
1
)




}








,




(
142
)















T
^

030

=


(

-

2
9


)







j
=
1

,
2





σ
^

x

(
j
)






0


τ




g

(
t
)




G
2

(
t
)





V
^

j
3

(
t
)


dt






,




(
143
)















T
^

102

=
0

,




(
144
)















T
^

111

=
0

,




(
145
)















T
^

120

=
0

,




(
146
)

















T
^

021

=


(

-

1
6


)







j




σ
^

x

(
j
)






0


τ




dt
1





0



t
1





dt
2



g

(

t
1

)




g

(

t
2

)

[


G

(

t
1

)

-

G

(

t
2

)


]











{





V
^

j
2

(

t
1

)





V
^

j

(

t
2

)


+




V
^

j

(

t
2

)





V
^

j
2

(

t
1

)


+




V
^

j
2

(

t
2

)





V
^

j

(

t
1

)


+




V
^

j

(

t
1

)





V
^

j
2

(

t
2

)



}

+


(

2
3

)








p
,

j

k






σ
^

y

(
j
)





σ
^

z

(
k
)




η
p
j



η
p
k





0


τ




dt
1





0



t
1





dt
2



g

(

t
1

)



g

(

t
2

)













[


G

(

t
1

)

-

G

(

t
2

)


]




sin

[


ω
p

(


t
1

-

t
2


)

]





[
V


^


j



(

t
1

)


-



V
^

j

(

t
2

)



]

,




(
147
)















T
^

210

=



(

1
6

)







j




σ
^

x

(
j
)






0


τ




dt
1





0



t
1





dt
2



g

(

t
1

)



g

(

t
2

)



{



G

(

t
2

)

[





V
^

j
2

(

t
1

)





V
^

j

(

t
2

)


+




V
^

j

(

t
2

)





V
^

j
2

(

t
1

)



]

-


G

(

t
1

)

[





V
^

j
2

(

t
2

)





V
^

j

(

t
1

)


+




V
^

j

(

t
1

)





V
^

j
2

(

t
2

)



]


}






-


(

2
3

)








p
,

j

k






σ
^

y

(
j
)





σ
^

z

(
k
)




η
p
j



η
p
k





0


τ




dt
1





0



t
1





dt
2



g

(

t
1

)



g

(

t
2

)





sin

[


ω
p

(


t
1

-

t
2


)

]


[



G

(

t
2

)





V
^

j

(

t
1

)


+


G

(

t
1

)





V
^

j

(

t
2

)



]








,




(
148
)














T
^

300

=
0.




(
149
)







Commutators {circumflex over (T)}jkl˜η4:












T
^

004

=
0

,




(
150
)















T
^

013

=



(

-

1
3


)

[




σ
^

x

(
1
)





σ
^

z

(
2
)



+



σ
^

x

(
2
)





σ
^

z

(
1
)




]








p
,

j
=
1

,
2




η
p
1



η
p
2





0


τ




dt
1





0



t
1





dt
2



g

(

t
1

)



g

(

t
2

)





sin

[


ω
p

(


t
1

-

t
2


)

]

[



G

(

t
1

)





V
^

j
2

(

t
2

)


+


G

(

t
2

)





V
^

j
2

(

t
1

)



]







,




(
151
)














T
^

022

=
0




(
152
)















T
^

031

=



(

-

2
3


)

[




σ
^

x

(
1
)





σ
^

z

(
2
)



+



σ
^

x

(
2
)





σ
^

z

(
1
)




]








p
,

j
=
1

,
2




η
p
1



η
p
2





0


τ




dt
1





0



t
1





dt
2



g

(

t
1

)



g

(

t
2

)



G

(

t
1

)




sin

[


ω
p

(


t
1

-

t
2


)

]





V
^

j
2

(

t
1

)







,




(
153
)














T
^

040

=
0




(
154
)















T
^

103

=



0


τ




dt
1





0



t
1





dt
2



g

(

t
1

)




g

(

t
2

)

[


G

(

t
1

)

-

G

(

t
2

)


]



{



(

1
18

)









j
=
1

,
2






σ
^

y

(
j
)


[





V
^

j

(

t
1

)





V
^

j
3

(

t
2

)


+




V
^

j
3

(

t
2

)





V
^

j

(

t
1

)


+




V
^

j

(

t
2

)





V
^

j
3

(

t
1

)


+




V
^

j
3

(

t
1

)





V
^

j

(

t
2

)



]


+


(

1
3

)








j

k





σ
^

x

(
j
)





σ
^

z

(
k
)








p



η
p
j




η
p
k

[




V
^

k
2

(

t
2

)

-



V
^

k
2

(

t
1

)


]




sin

[


ω
p

(


t
1

-

t
2


)

]



}






,




(
155
)














T
^

112

=


(

1
6

)





0


τ




dt
1





0



t
1





dt
2





0



t
2





dt
3



g

(

t
1

)



g

(

t
2

)



g

(

t
3

)



{




(

-

1
2


)







j




σ
^

y

(
j
)




{





V
^

j

(

t
1

)


[





V
^

j

(

t
2

)





V
^

j
2

(

t
3

)


+




V
^

j
2

(

t
3

)





V
^

j

(

t
2

)



]

+


[





V
^

j

(

t
2

)





V
^

j
2

(

t
3

)


+




V
^

j
2

(

t
3

)





V
^

j

(

t
2

)



]





V
^

j

(

t
1

)


+




V
^

j

(

t
3

)

[





V
^

j

(

t
2

)





V
^

j
2

(

t
1

)


+




V
^

j
2

(

t
1

)





V
^

j

(

t
2

)



]

+



[





V
^

j

(

t
2

)





V
^

j
2

(

t
1

)


+




V
^

j
2

(

t
1

)





V
^

j

(

t
2

)



]





V
^

j

(

t
3

)



}


-

2







p
,

j

k






σ
^

x

(
j
)





σ
^

z

(
k
)




η
p
j



η
p
k



{





V
^

k
2

(

t
3

)




sin

[


ω
p

(


t
1

-

t
2


)

]


-



V
k
2

(

t
1

)




sin

[


ω
p

(


t
2

-

t
3


)

]


+



[





V
^

k

(

t
2

)





V
^

k

(

t
3

)


+




V
^

k

(

t
3

)





V
^

k

(

t
2

)



]




sin

[


ω
p

(


t
1

-

t
3


)

]


-



[





V
^

k

(

t
2

)





V
^

k

(

t
1

)


+




V
^

k

(

t
1

)





V
^

k

(

t
1

)





V
^

k

(

t
2

)



]




sin

[


ω
p

(


t
1

-

t
3


)

]



}


+


4






pq



η
p
1



η
p
2



η
q
1




η
q
2

(



σ
^

y

(
1
)


+


σ
^

y

(
2
)



)



sin

[


ω
q

(


t
1

-

t
3


)

]



{


sin

[


ω
p

(


t
2

-

t
3


)

]

-

sin

[


ω
p

(


t
2

-

t
1


)

]


}


-


2






p



η
p
1



η
p
2




σ
^

x

(
1
)






σ
^

z

(
2
)


[





V
^

2

(

t
1

)





V
^

2

(

t
3

)


+




V
^

2

(

t
3

)





V
^

2

(

t
1

)



]



{


sin

[


ω
p

(


t
2

-

t
3


)

]

+

{

sin

[


ω
p

(


t
2

-

t
1


)

]

}


}



,













(
156
)















T
^

121

=


(

-

1
12


)





0


τ




dt
1





0



t
1





dt
2





0



t
2





dt
3



g

(

t
1

)



g

(

t
2

)



g

(

t
3

)







jkl



{



2
[





V
^

j

(

t
1

)





V
^

k
2

(

t
2

)





V
^

l

(

t
3

)


+




V
^

j

(

t
3

)





V
^

k
2

(

t
2

)





V
^

l

(

t
1

)



]




σ
^

x

(
j
)





σ
^

y

(
k
)





σ
^

x

(
l
)



-


[





V
^

j

(

t
1

)





V
^

k

(

t
3

)





V
^

l
2

(

t
2

)


+




V
^

j

(

t
3

)





V
^

k

(

t
1

)





V
^

l
2

(

t
2

)



]




σ
^

x

(
j
)





σ
^

x

(
k
)





σ
^

y

(
l
)



-


[





V
^

j
2

(

t
2

)





V
^

k

(

t
3

)





V
^

l

(

t
1

)


+




V
^

j
2

(

t
2

)





V
^

k

(

t
1

)





V
^

l

(

t
3

)



]




σ
^

y

(
j
)





σ
^

x

(
k
)





σ
^

x

(
l
)




}









,




(
157
)















T
^

130

=



(

1
9

)





0


τ




dt
1





0



t
1





dt
2



g

(

t
1

)



g

(

t
2

)



G

(

t
1

)



{








j
=
1

,
2






σ
^

y

(
j
)



[





V
^

j

(

t
2

)





V
^

j
3

(

t
1

)


+




V
^

j
3

(

t
1

)





V
^

j

(

t
2

)



]


}






-


(

2
3

)





0


τ




dt
1





0



t
1





dt
2



g

(

t
1

)



g

(

t
2

)





















j
,

k
=
1

,
2






j

k












p
=
1

N



η
p
j



η
p
k



σ
x
j



σ
z
k



G

(

t
1

)





V
^

k
2

(

t
1

)




sin

[


ω
p

(


t
1

-

t
2


)

]


,





(
158
)















T
^

202

=
0

,




(
159
)















T
^

211

=


(

4
3

)








p
,

k

j





η
p
1



η
p
2




σ
^

z

(
j
)





σ
^

x

(
k
)






0


τ




dt
1





0



t
1





dt
2





0



t
2





dt
3



g

(

t
1

)



g

(

t
2

)



g

(

t
3

)





V
^

j
2

(

t
1

)




sin

[


ω
p

(


t
2

-

t
3


)

]









,




(
160
)






Claims
  • 1. A method of performing a two-qubit gate operation, comprising: computing, by a classical computer, a control pulse to be applied to a pair of trapped ions in a plurality of trapped ions in a quantum processor, each of the plurality of trapped ions having two frequency-separated states defining a qubit, wherein computing the control pulse comprises: computing a pulse function of the control pulse based on a phase-space closure condition and an auxiliary condition; andcomputing the pulse function of the control pulse further based on a gate angle condition; andapplying, by a system controller, the control pulse, having the computed pulse function, to the pair of trapped ions.
  • 2. The method of claim 1, wherein the computing of the pulse function based on the phase-space closure condition and the auxiliary condition comprises computing Fourier coefficients of the pulse function of the control pulse by solving a set of linear equations with respect to the Fourier coefficients.
  • 3. The method of claim 2, wherein the phase-space closure condition requires the pair of trapped ions that are excited by a delivery of the control pulse return to their initial motional state.
  • 4. The method of claim 3, wherein the auxiliary condition implies the vanishing of the Φ functional.
  • 5. The method of claim 1, further comprising: prior to the application of the control pulse, calibrating the pulse function of the control pulse by multiplying the pulse function by a calibration factor.
  • 6. The method of claim 5, wherein the calibration factor is based on a gate angle error and a target gate angle determined by the gate angle condition.
  • 7. The method of claim 6, wherein the target gate angle is
  • 8. A quantum computing system, comprising: a quantum processor comprising a plurality of trapped ions, wherein each of the trapped ions having two frequency-separated states defining a qubit;a classical computer configured to: compute a control pulse to be applied to a pair of trapped ions in the quantum processor, wherein computing the control pulse comprises: computing a pulse function of the control pulse based on a phase-space closure condition and an auxiliary condition; andcomputing the pulse function of the control pulse further based on a gate angle condition; anda system controller configured to: apply the control pulse, having the computed pulse function, to the pair of trapped ions.
  • 9. The quantum computing system of claim 8, wherein the computing of the pulse function, based on the phase-space closure condition and the auxiliary condition, comprises computing Fourier coefficients of the pulse function of the control pulse by solving a set of linear equations with respect to the Fourier coefficients.
  • 10. The quantum computing system of claim 9, wherein the phase-space closure condition requires the pair of trapped ions that are excited by a delivery of the control pulse return to their initial motional state.
  • 11. The quantum computing system of claim 10, wherein the auxiliary condition causes the Φ functional to vanish.
  • 12. The quantum computing system of claim 8, further comprising: prior to the applying of the control pulse, calibrating the pulse function of the control pulse by multiplying the pulse function by a calibration factor.
  • 13. The quantum computing system of claim 12, wherein the calibration factor is based on a gate angle error and a target gate angle determined by the gate angle condition.
  • 14. The quantum computing system of claim 13, wherein the target gate angle is
  • 15. A quantum computing system comprising non-volatile memory having a number of instructions stored therein which, when executed by one or more processors, causes the quantum computing system to perform operations comprising: computing, by a classical computer, a control pulse to be applied to a pair of trapped ions in a plurality of trapped ions in a quantum processor, each of the plurality of trapped ions having two frequency-separated states defining a qubit, wherein computing the control pulse comprises: computing a pulse function of the control pulse based on a phase-space closure condition and an auxiliary condition; andcomputing the pulse function of the control pulse further based on the gate angle condition; andapplying, by a system controller, the control pulse, having the computed pulse function, to the pair of trapped ions.
  • 16. The quantum computing system of claim 15, wherein the computing of the pulse function, based on the phase-space closure condition and the auxiliary condition, comprises computing Fourier coefficients of the pulse function of the control pulse by solving a set of linear equations with respect to the Fourier coefficients.
  • 17. The quantum computing system of claim 16, wherein the phase-space closure condition requires the pair of trapped ions that are excited by a delivery of the control pulse return to their initial motional state.
  • 18. The quantum computing system of claim 17, wherein the auxiliary condition implies the vanishing of the Φ functional.
  • 19. The quantum computing system of claim 15, further comprising: prior to the applying of the control pulse, calibrating the pulse function of the control pulse by multiplying the pulse function by a calibration factor.
  • 20. The quantum computing system of claim 19, wherein the calibration factor is based on a gate angle error and a target gate angle determined by the gate angle condition.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority to U.S. Provisional Application Ser. No. 63/601,783 filed Nov. 22, 2023, which is herein incorporated by reference in its entirety.

Provisional Applications (1)
Number Date Country
63601783 Nov 2023 US