Floquet quantum simulation with superconducting qubits
Oleksandr Kyriienko, Anders S. S{\o}rensen

TL;DR
This paper introduces a Floquet-based quantum simulation method using superconducting qubits to emulate spin models, offering a resource-efficient approach for programmable quantum simulators.
Contribution
It develops a Floquet theory-based algorithm for simulating XYZ spin models with superconducting qubits, including a practical recipe for implementing the transverse Ising model.
Findings
Numerical demonstration of simulating the transverse Ising model.
Benchmarking shows advantages over digital simulation with limited resources.
Protocol is feasible with current superconducting chip technology.
Abstract
We propose a quantum algorithm for simulating spin models based on periodic modulation of transmon qubits. Using Floquet theory we derive an effective time-averaged Hamiltonian, which is of the general XYZ class, different from the isotropic XY Hamiltonian typically realised by the physical setup. As an example, we provide a simple recipe to construct a transverse Ising Hamiltonian in the Floquet basis. For a 1D system we demonstrate numerically the dynamical simulation of the transverse Ising Hamiltonian and quantum annealing to its ground state. We benchmark the Floquet approach with a digital simulation procedure, and demonstrate that it is advantageous for limited resources and finite anharmonicity of the transmons. The described protocol can serve as a simple yet reliable path towards configurable quantum simulators with currently existing superconducting chips.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Floquet quantum simulation with superconducting qubits
Oleksandr Kyriienko
The Niels Bohr Institute, University of Copenhagen, Blegdamsvej 17, DK-2100 Copenhagen, Denmark
Anders S. Sørensen
The Niels Bohr Institute, University of Copenhagen, Blegdamsvej 17, DK-2100 Copenhagen, Denmark
Abstract
We propose a quantum algorithm for simulating spin models based on periodic modulation of transmon qubits. Using Floquet theory we derive an effective time-averaged Hamiltonian, which is of the general XYZ class, different from the isotropic XY Hamiltonian typically realised by the physical setup. As an example, we provide a simple recipe to construct a transverse Ising Hamiltonian in the Floquet basis. For a 1D system we demonstrate numerically the dynamical simulation of the transverse Ising Hamiltonian and quantum annealing to its ground state. We benchmark the Floquet approach with a digital simulation procedure, and demonstrate that it is advantageous for limited resources and finite anharmonicity of the transmons. The described protocol can serve as a simple yet reliable path towards configurable quantum simulators with currently existing superconducting chips.
pacs:
03.67.Lx, 85.25.-j, 42.50.-p
Quantum simulation generally relies on exploiting a controllable quantum system to imitate a complex quantum system of interest Lloyd1996 . It provides an efficient way to solve classically inaccessible problems of material science Wecker2015 and quantum chemistry Wecker2014 ; Reiher2016 . Ultimately quantum simulation may give access to properties of complex quantum systems with exponential speed-up as compared to classical algorithms NielsenChuang ; Georgescu2014 . Superconducting circuits (SC) Wallraff2004 ; Devoret2013 have recently emerged as one of the prime candidates for realizing full scale quantum computers, with operations close to the fault tolerant threshold Barends2014 ; Kelly2015 ; Riste2015 ; Corcoles2015 ; Ofek2016 ; Reed2012 and the possibility of scaling these advances to larger systems Bejanin2016 . From the simulation point of view, various protocols were proposed and realized experimentally Houck2012 , including simulation of spin systems LasHeras2014 ; Salathe2015 ; Barends2016 , fermionic models Barends2015 , quantum chemistry OMalley2015 , thermalization Neill2016 , synthetic magnetic fields Roushan2016 , ultrastrong coupling Ballester2012 ; Langford2016 , and gauge field theories Mezzacapo2015 . To demonstrate the full potential of quantum simulation with SC, however, there is a need for protocols which can outperform classical protocols for realistic near term medium size systems.
Typically protocols for quantum simulation can be divided into digital and analog (or emulator) types. While these techniques are similar, they exploit different methods to achieve a quantum speed-up. The digital approach relies on discretizing the Hamiltonian evolution using a set of quantum gates. A protocol for simulating an arbitrary unitary governed by a Hamiltonian not available in a physical setup, exploits the sequential implementation of the available unitaries represented by gates. The corresponding unitary of a single digital step of duration can be constructed as . This string of unitaries can be recast in terms of Hamiltonians . An implementation of of these Trotter steps combines into a unitary , where and NielsenChuang . Given a universal set of gates any required Hamiltonian can in principle be simulated. This poses the challenge of implementing several quantum gates for successful simulation, leading to errors if they have limited fidelity. This issue can possibly be overcome by quantum error correction but this requires substantial overhead in resources. The digital approach is widely used for quantum simulation with SC LasHeras2014 ; Salathe2015 ; Barends2016 ; Barends2015 ; OMalley2015 ; Ballester2012 ; Langford2016 , as it is tunable and does not require changing sample layout to simulate different models.
Analog quantum simulation relies on the actual physical implementation of the required Hamiltonian, corresponding to the emulation of a targeted real system. This was realised on various platforms, including cold atoms in optical lattices Bloch2012 ; Simon2011 and trapped ions Kim2010 ; Cenko2015 . By exploiting continuous time dynamics, Trotterization errors are minimized and analog protocols can therefore have superior simulation fidelities compared to digital approaches. However, they are restricted to the types of Hamiltonian physically realizable in the system. In particular, this is the case for SC quantum systems. Current highly coherent chains of transmons, sketched in Fig. 1, are limited to nearest neighbour flip-flop type of interqubit interaction provided by the capacitive coupling between them. Thus, they are confined to simulate isotropic XY type spin-1/2 model Wendin2016 . The accessible models can be enriched by implementing different connections between the qubits to engineer various nonlinear couplings Neumeier2013 ; Dumur2015 ; Sameti2016 , or allowing for modulation of interqubit interactions to break the rotating wave approximation Bertet2006 ; Mezzacapo2014 ; Kapit2015 . However, this adds extra complications to the experiments and potentially introduces additional errors.
Here, we propose an alternative analog-like simulation strategy, which can be performed without modifications of the system. It is based on using a Floquet basis to perform quantum simulation with superconducting circuits, and can be extended to ground state preparation via quantum annealing. The idea relies on the time-dependent modulation of the Hamiltonian , where is a time-independent part, and is periodic with a period . The corresponding unitary operator for a single period can be rewritten as an effective evolution with a time-independent Hamiltonian given by the Magnus expansion Bukov2015 ; Iadecola2015 . When the frequency of modulation is much bigger than the coupling in the static Hamiltonian, , the dynamics of the system can be conveniently represented in terms of a period averaged Floquet Hamiltonian,
[TABLE]
where denotes the static Hamiltonian rewritten in the interaction picture with respect to the oscillating part. The resulting Hamiltonian may possess qualitatively different behavior compared to . Such Floquet type simulation recently gained attention in the cold atom Goldman2014 and condensed matter physics communities Rudner2013 ; Jiang2011 , where Floquet topological insulators and gauge fields were introduced. Finally, in circuit QED the Floquet quasienergies of a single qubit were studied recently Deng2015 .
In this paper we consider superconducting qubits with isotropic XY coupling, and show that by exploiting fast driving of each site we can efficiently tailor the effective Hamiltonian of the system. For concreteness we here focus on one dimensional chains, but the method can easily be extended to more dimensions. First, we describe how the approach can be used to simulate the dynamics of the transverse Ising model showing that as compared to digital protocols higher fidelity can be attained. Next, we simulate quantum annealing to the ground state of the transverse Ising model and find that the Floquet approach outperforms the digital for restricted resources, when limited by the finite anharmonicity of the transmons. Finally, we describe an algorithm for simulating the spin-1/2 XYZ model with the Floquet approach.
*System and Hamiltonian.—*As a physical realization we consider a capacitively coupled chain of qubits (Fig. 1), where periodically oscillating effective magnetic fields are applied at chosen lattice sites. The qubits can be of transmon Riste2015 , xmon Barends2013 , gmon Chen2014 , or gatemon-type Casparis2016 , with the main requirements being tunability and high fidelity operation. The time independent Hamiltonian in the rotating frame contains a nearest-neighbour flip-flop interaction with bare coupling , corresponding to the isotropic XY spin-1/2 model
[TABLE]
Here () are spin-1/2 Pauli operators at lattice site , denotes total number of qubits in the chain, and we consider open boundary conditions. The time dependent Hamiltonian contains a periodic magnetic field which rapidly oscillates along arbitrary axes, and we assume that it differs between even and odd sites,
[TABLE]
where and denote floor and ceiling functions, respectively. We assume that the magnetic field is sharply turned on at time , and thus explicitly account for the kick operator contribution, which is relevant in the current setting targeting realistic quantum simulation Goldman2014 . Going to the rotating frame with respect to and integrating over a period as in Eq. (1) we get the reduced Floquet Hamiltonian in the general form [SM, A]:
[TABLE]
where the time-averaged coefficients are defined in the Supplemental Material SM , and are controlled by the amplitude and alignment of the effective magnetic fields.
*Transverse Ising model: quantum dynamics.—*We first consider the Floquet simulation of the tranverse Ising model, which represents a particular case of the more general Floquet Hamiltonian (4). It can be realized with a drive of the form and , where is a drive parameter, and denotes the zeroth order Bessel function of the first kind. The -directed terms additionally introduce an effective transverse magnetic field . In the infinite frequency limit and for () this leads to an effective Hamiltonian of the form [SM, B]
[TABLE]
where for later reference describes the effective simulated coupling of the model. In the transverse Ising case it corresponds to the original bare coupling, , and we note that the ratio between the effective magnetic field in the Floquet basis and the Ising interaction, , can be controlled by the drive parameters. To verify the approach, we numerically calculate the full dynamics of the system with time periodic driving of frequency and access the Floquet dynamics by looking at stroboscopic times , where is an integer [Fig. 2 (a)]. The results are compared to an ideal simulation of the transverse Ising Hamiltonian (5), with the initial state . Additionally, we benchmark the Floquet simulation with a digital protocol [SM, C]. It uses the isotropic XY interaction and its rotated version, and approaches the Ising model in the limit of large LasHeras2014 . The results in Fig. 2(b) show that the Floquet simulation closely follows the exact dynamics at short time, but deviates at later stages due to the finite Floquet frequency. On the contrary, the digital approach shows substantial deviations for this limited number of Trotter periods even at short times, but will have rapid convergence with more Trotter steps (see below). We note that a comparison of the number of Floques periods and Trotter steps may not be a fair comparison, since the latter involves multiple gates. A more detailed comparison is done below.
*Transverse Ising model: quantum annealing.—*Next, we study the ground state preparation of the simulated model. To access a ground state, we perform the quantum annealing procedure Kadowaki1998 , which also serves as a basis for adiabatic quantum computing Fahri2000 , and may solve NP-complete problems Fahri2001 . Using the Floquet basis, we design the Hamiltonian , where the effective magnetic field is linearly turned off during a total annealing time . Here we consider , which allows to achieve the ground state of the ferromagnetic -Ising Hamiltonian. The ideal target state is an entangled GHZ-like state , where , and we start from the trivial initial state .
The results of the annealing procedure are shown in Fig. 3. The dynamics of the system, quantified as the fidelity of the instantaneous wavefunction of the system with the ideal target state, , is shown in Fig. 3(a) for a 4 qubits chain. Blue dots correspond to Floquet simulation at stroboscopic times, which closely follows the red solid curve of the ideal continuous annealer. The blue oscillatory curve corresponds to the full dynamics, with fast oscillation arising from the drive term. To study the scaling with the system size, we perform fixed time () annealing for chains of various length [Fig. 3(b)]. Fixing the drive frequency to moderate values, we observe that the final infidelities of the Floquet simulator, , and digital simulator, , have similar scalings with the system size, both adding extra infidelity on top of the continuous evolution, and largely dependent on and as described below. In Fig. 3(c) we show the dependence on the frequency of the periodic drive of the Floquet infidelity, measured with respect to the finite time annealing state. Here the frequency is rescaled by the total annealing time, such that shows the number of stroboscopic periods. The infidelity can be reduced for large , with results converging to continuous annealing infidelity for . The analogous behavior for the digital approach corresponds to the variation of the number of Trotter steps, and is shown in Fig. 3(d). While a direct comparison between two approaches is complicated, the general tendency can be deduced: the Floquet approach has smaller infidelity for small number of steps and limited resources, while the digital approach has better scaling if a large number of Trotter steps can be implemented.
*Imperfections.—*To describe a realistic quantum simulator, we study the influence of a finite anharmonicity of the transmon qubits, which will be a major limitation to our approach. Driving a transmon with a finite anharmonicity leads to leakage of information from the logical subspace. To account for this we consider a full Hamiltonian of a SC chain [SM, D], and perform numerical simulations including doubly occupied states of the transmons. As an example we use annealing of the transverse Ising model with . The resulting infidelity of the simulation is shown in Fig. 4. First, we fix the value of the anharmonicity, and calculate the infidelity as a function of the Floquet frequency [Fig. 4(a)]. We observe that contrary to the ideal circuit, the infidelity is minimized for a finite (optimal) drive frequency . We note that the window of frequencies in which the infidelity stays close to minimal is typically broad. In Fig. 4(b) we show the optimized infidelity of the simulation as a function of (blue curve).
To benchmark the results of the Floquet simulation we compare it to the digital simulation. Assuming the same value for the single- and two-qubit gate errors, the error for a single Trotter step is equal to . We optimize the total infidelity with respect to the number of Trotter steps. Here is the error coming from digitization of the dynamics [as shown in Fig. 3(d)]. To highlight the relevant parameter range, we assign a cut-off based on the single gate time . The results are plotted as horizontal lines in Fig. 4(b), and show that the Floquet approach can outperform the digital approach unless very high fidelity gates with are used. Furthermore, the Floquet approach is highly advantageous for small values of , which for a given transmon anharmonicity is the regime where the simulation is finished the fastest and thus has the least influence of decoherence. Thus for shorter time of simulation/higher error rates the Floquet is advantageous compared to the digital approach. We highlight that while digital approaches typically exploit DRAG techniques to remove leakage Motzoi2009 ; Martinis2014 , the presented Floquet approach is not specifically designed to work for small , and it may be possible to improve on this issue using few-tone drives.
*Estimates.—*To quantify the performance we consider numbers which can be achieved with currently available transmon setups Barends2013 ; Chen2014 . Taking the anharmonicity to be MHz, drive frequency MHz, nearest-neighbour coupling MHz (reduced compared to most setups), and s, the four qubit chain can be annealed to the ground state of the Ising model with (ideal continuous annealing gives ). An additional error will arise from dephasing, but its effect will be small for highly coherent qubits (s).
Reaching a similar performance with the digital strategy is highly challenging and would require single and two qubit gate operation times of ns and accuracy. The single Trotter step duration for is s, and with s this can allow for 14 Trotter steps. The corresponding digitization error is (dephasing should be added separately).
*Generic XYZ Hamiltonians.—*The Floquet approach may be extended to simulate generic spin-1/2 models represented by XYZ type spin Hamiltonian, . These are of the so called non-stoquatic type, where recent results have suggested that they can give enhanced computational powers Nishimori2016 . We consider couplings , , and . This configuration can be realized by a uniform periodic magnetic field in the direction at all lattice sites [SM, E]. As compared to the transverse Ising case this Hamiltonian possesses small energy gaps, and in the absence of the additional transverse field is difficult to anneal even with the ideal continuous Hamiltonian. The results are qualitatively similar to the Ising case, showing that the Floquet approach outperforms digital simulation unless ultrahigh fidelity gates are implemented, although high-quality simulation is very challenging in both cases.
*Conclusion.—*We have presented a scheme for a reconfigurable and tunable superconducting quantum simulator based on the transmon qubits. Utilizing the Floquet approach, we show that the originally limited isotropic XY interaction can be transformed into transverse Ising or XYZ type spin-1/2 Hamiltonian. The approach was used for simulation of multiqubit system dynamics and preparation of non-trivial groundstates. The Floquet simulation was shown to perform better than a digital scheme for restricted resources, and represents a realistic path for modern SC quantum simulators.
*Acknowledgements.—*The research was funded by the European Union Seventh Framework Programme through ERC Grant QIOS (Grant No. 306576). O.K. acknowledges useful discussions with Pedram Roushan, Charles Neill, Guanyu Zhu, Mohammad Hafezi, Göran Johansson, and Stefan Filipp.
.1 Derivation of the generic Floquet Hamiltonian
Here we present the derivation of Eq. (4) in the main text, and simultaneously describe the general Floquet Hamiltonian originating from arbitrary axis magnetic field oscillation for the two sublattices.
We start with the transmon Hamiltonian written in the form
[TABLE]
and consider the effective magnetic fields to be different for even and odd sublattices. Here and denote floor and ceiling functions, correspondingly. To have an explicit form of we decompose it into , where is some periodic function, form a Cartesian basis, and are components of an effective magnetic field for even (indexed by e) and odd (indexed by o) sites. This corresponds to the magnetic field oscillating along a certain axis, which is different for even and odd sublattices. Here we consider the time-dependence to be the same for all spin components, such that the axis of magnetic field does not precess. This restriction decreases the number of independent tuning parameters. Note that the effective magnetic field used for the simulation of the transverse Ising model, deviates slightly from this form. This deviation is, however, a perturbation and will be dealt with below. If the fields do not have this form, the time-dependent Hamiltonian does not commute with itself at different times, thus largely complicating the solution. This more general setting will be considered in future works.
We perform a unitary transformation with respect to the rapidly oscillating time-dependent part . This is done using the unitary operator:
[TABLE]
where is the time-ordering operator and is an initial switch-on time. The unitary (S2) can be factorized into odd and even sublattices parts, and time-ordering disappears as the magnetic field oscillates along a fixed axis. This yields with
[TABLE]
where indices and help denote sublattice parity, and we define the time-integrated functions . Here defines the absolute value of the effective magnetic field vector, and correspond to the normalized Cartesian components. The rotated Hamiltonian then reads . The second term is divided into two parts and each of these can be rewritten using the relation for the derivative of an arbitrary time-dependent matrix , being . For the case of considered here the commutators vanish, and in total the derivative term gives . However, we emphasize that this conclusion would not be true for general time-dependence of the Cartesian components of an effective magnetic field, where additional derivative-dependent terms appear.
Next, we need to calculate the matrix product terms of the form
[TABLE]
Let us perform the unitary rotation for each sublattice consecutively. For this, it is convenient to go from Cartesian to the spherical coordinate frame . Next, noting that the unitary operation is defined as a spin rotation with respect to a fixed axis , it can be decomposed into Cartesian rotations as:
[TABLE]
where the rotation operator is defined as (). Then, the Hamiltonian after the odd sublattice transformation can be obtained through rotations
[TABLE]
and the subsequent transformation for the even sublattice can be performed in a similar fashion.
Finally, to get a closed expression for the transformed Hamiltonian we use the Baker-Campbell-Hausdorff formula
[TABLE]
where denotes -th order nested commutator. We proceed with calculating the commutators and resumming the series. After straightforward but tedious algebra we can get the Hamiltonian in a rotating frame
[TABLE]
with the coefficients
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
where we state explicitly the time-dependence of even and odd integral terms and .
Once we have rotated the Hamiltonian into a suitable frame, the corresponding unitary operator for the evolution during a period can be rewritten using the Magnus expansion Bukov2015SM :
[TABLE]
with the Floquet Hamiltonian , which consists of corrections in . They can be written as
[TABLE]
and higher-order terms can be written in a similar way using nested commutators. We notice that , and thus for very small time intervals, given by the period of the oscillating term (infinite frequency limit), the effective Floquet Hamiltonian is represented by the period-average of the time-dependent Hamiltonian written in Eq. (S10). In this work we consider the Floquet Hailtonian only to lowest order, , while higher order corrections () are accounted for in the numerical integration of the full time-dependent Hamiltonian.
Finally, let us choose the form of the oscillatoric magnetic field and find the period-averaged Floquet Hamiltonian for the transmon chain. This can be chosen in the form
[TABLE]
where are constants of order unity, and are initial phases for the modulation. The latter is of high importance in the Floquet formalism, as it leads to kick-operator terms which change the basis of the system, but do not enter the effective time-independent Hamiltonian Goldman2014_SM . However, in the current study we are interested in actual protocols with Floquet simulation, where the drive term is abruptly turned on at time point , and the initial phase of the drive may be important. Here we consider zero initial phases , such that the kick operator is unity.
The integral functions are given by
[TABLE]
Then, the period averaged coefficients can be written in the form:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
The above equations define the exact form of the generic Hamiltonian (4) from the main text, and thus describe the possible Hamiltonians accessible for the Floquet quantum simulation with this method, assuming different even/odd periodic cosine modulation.
.2 Transverse Ising model derivation and intuitive explanation
In this section we provide a detailed procedure to engineer the transverse Ising Hamiltonian as an effective Floquet Hamiltonian of the isotropic XY model with transverse and longitudinal fields. For this we consider a system with two (odd and even) sublattices, where only one of the sublattices experience fast oscillations of the magnetic field (see sketch in Fig. S1).
The intuitive way to describe the realization of the Ising model () from the isotropic XY case (with interaction type ) is to take two spins and imagine one to be rotating in a magnetic field. Starting from the flip-flop interaction, if we choose the axis of the magnetic field to be in the direction, nothing will happen to the first interaction term. At the same time, the rotation of the second spin leads to oscillations of the second term between , and also induce a interaction component. For large frequencies of oscillation and carefully chosen drive amplitude, the plus and minus components will cancel each other, as well as the cross-interaction components, ultimately leaving the Ising term only.
Having in mind the aforementioned intuitive explanation, and taking the full solution from section A, the starting Hamiltonian for the simulation of the Ising model in the transmon chain reads:
[TABLE]
where is a drive parameter, and denotes the zeroth order Bessel function of the first kind. In the infinite frequency limit and for (such that ) the interaction term can be reduced to the Ising type. Additionally, the last term in Eq. (S15) is designed to introduce a transverse effective magnetic field and can be written as:
[TABLE]
The first term in Eq. (S16) is a static magnetic field on the odd sublattice, and commutes trivially with the fast oscillation part. However, the magnetic field on the even sublattice can be modified by the drive. The second term representing the magnetic field, deviates from the general form considered in Sec. .1, since it does not have the same time dependence. As opposed to the other field, however, the magnitude of this field does not increase with increasing and can thus be treated as a perturbation. Since it doesn’t commute with the main driving field, it will be strongly modified by it. Going to the rotating frame with the unitary operator , the magnetic term becomes
[TABLE]
Finally, performing the period averaging, the term vanishes trivially since the sine function oscillates between positive and negative values. At the same time, given that is fixed by the condition , the integral gives a finite result
[TABLE]
thus allowing to introduce an effective transverse field .
.3 Digital simulation of transverse Ising model
In this section we describe the digital simulation protocol, which we use to benchmark the performance of the Floquet quantum simulator. The transverse Ising model simulation, which we will consider, was theoretically described in Ref. LasHeras2014_SM and experimentally realized in Ref. Salathe2015_SM . The circuit scheme is shown in Fig. S2.
The algorithm relies on the preparation of a unitary transformation with the effective Hamiltonian of interest using repetitions of a small step, corresponding to the Trotterization procedure. The protocol for the simulation of an arbitrary k-local Hamiltonian (generally not available in the physical setup) relies on the sequential implementation of the available parts of a Hamiltonian (constructed from gates) such that . The corresponding unitary of a single digital step of duration reads
[TABLE]
and the implementation of Trotter steps combine into the unitary .
In this spirit, the implementation of the transverse Ising model model was proposed to rely on multiple applications of the Trotter step graphically shown in Fig. S2. It starts with the implementation of , where by we define the simple application of XY interaction for each pair of qubits. Next, this unitary can be rotated by applying X rotations at every second qubit, , which leads to , where we define as the XY Hamiltonian with the YY term flipped by rotation. Finally, the last layer in the Trotter step implements the transverse fields with . Once the Trotter step is repeated many times, the non-commuting Hamiltonian parts can be added, thus implementing the transverse Ising model digitally.
The same considerations can be repeated for the digitized annealing procedure Barends2016_SM . Here the important part is to keep the phase applied by gates consistent with the adiabatic evolution.
.4 Accounting for the finite anharmonicity
In this section we consider the transmon chain Hamiltonian and account for finite anharmonicity. This can be described by the Hamiltonian
[TABLE]
where () corresponds to the creation (annihilation) operator for excitations of the -th transmon circuit. The first term in Eq. (S20) corresponds to nearest-neighbour capacitive coupling for transmons. The second term in curly brackets denotes an effective magnetic field in the direction given by the flux-bias dependent detuning and the microwave drive terms corresponding to an effective magnetic field in plane. The last term of Eq. (S20) corresponds to the anharmonicity of the circuit provided by Josephson junctions. In the case of infinitely large anharmonicity the Hamiltonian (S20) can be projected onto the lowest occupation subspace for each qubit , accounting only for singly excited circuits. This allows for a spin-1/2 description of the chain, and subsequent simulation of quantum magnetism. However, in realistic transmon samples the anharmonicity is typically small, and higher states of the circuit must be accounted for [see sketch in Fig. S3(a)]. In particular, this is important for the case of a strong microwave drive , as it leads to non-zero occupation of higher lying states, corresponding to the leakage of information out of the logical subspace. This can largely decrease the fidelity, and typically is the bottleneck for fast digital computation.
In this study we consider the effects of finite by expanding the Hilbert space for each site to have doubly occupied states, . As a test case we take the ground state preparation of the transverse Ising model, studied for the case of infinite anharmonicity in the preceding sections. The annealing schedule is chosen in the same form, making use of the and correspondence.
The main results of the finite scaling for the Floquet quantum simulation is presented in Fig. 4 and the corresponding section of the main text. Here we provide more details of the Floquet to digital benchmarking procedure. The estimate of the digital protocol infidelity accounts for several contributions. The first comes from the Trotterization procedure and depends strongly on the number of Trotter steps, favouring long sequences. The second contribution is a total infidelity from gate operations , which increases with the number of Trotter steps. The optimization procedure is performed for different values of the gate errors . The results are plotted in Fig. S3(b), and the optimal Trotter step numbers is shown to decrease in the case of large gate errors. The corresponding optimal infidelity [Fig. S3(c)] shows a significant increase for .
To compare the digital and Floquet approaches, we should compare how each of the two approaches could be implemented on comparable physical systems. To this end we consider transmons with the same anharmonicity , and assume that they also have comparable decoherence rates (but note that we assume that the physical coupling can be different in the two scenarios). Therefore, to have a similar influence of decoherence in the two approaches we assume that the simulations need to be completed in the same time. To simulate the same evolution this requires that the two approaches have the same and thus the same values of . In the Floquet case this is defined by the and ratios. For the digital simulation, the relation is more subtle and relies on the scaling of the gate time with for a fixed error value. The full discussion of this complex subject lies beyond the scope of present study, and for simplicity we just assume that each gate can be implemented in a time , where is a constant which controls the quality of the gate. Taking the existing studies Rol2016_SM ; Motzoi2009_SM ; Martinis2014_SM , and considering a best case scenario, we set . For realistic devices with MHz this will correspond to 18 ns gates, and we will consider a low error of . This will be extremely challenging to achieve with current technologies, but for the example considered in the main text this is what is required to achieve a performance comparable to what is achievable with the Floquet approach. With more realistic numbers the performance of the digital approach will be less ideal and thus not comparable to the result which can be achieved with the Floquet simulation.
.5 Floquet simulation of spin-1/2 XYZ model
To simulate the XYZ model in the Floquet basis, we start with the time-dependent Hamiltonian in the form
[TABLE]
where we consider the oscillating effective magnetic field to be homogeneous for all sites. describes the part of the Hamiltonian responsible for implementing the static -oriented magnetic field for annealing. Considering with being the largest energy scale, and setting , we eliminate the cross-terms and are left with a Floquet Hamiltonian of the form
[TABLE]
where the couplings are , , and . Here the simulated coupling changes for the YY and ZZ interaction components, and we consider as a reference. We note that as compared to the transverse Ising case this Hamiltonian possesses a small energy gap, and in the absence of an additional transverse field it is difficult to anneal even with the ideal continuous Hamiltonian.
To characterize the Floquet and digital simulation procedures we plot the instantaneous infidelity with respect to the continuous annealing case, observing how closely one can follow the ground state [Fig. S4(a)]. The blue curve for the Floquet simulation at stroboscopic times shows that the deviation begins to grow once we approach the critical point. To compare with the digital procedure, we plot the infidelity for the Trotterization approach. We assume the number of Trotter steps is equal to half of number of Floquet periods, (see below for the details of the circuit). This will be an upper bound for the number of Trotter steps for the digital simulator for the same resources. This can be deduced from the digital simulation protocol assuming that the time required to implement the two-qubit gate is inversely proportional to the coupling strength, , and in addition the gates on the two sublattices have to be applied separately. We note that considering different ordering of the gates results in largely different results for the final state infidelity. While we have not performed a full optimization of this ordering, the results presented in the figure is the result of the optimization over 24 different possibilities for a Trotter step composition. This suggests that the digital procedure is strongly model dependent, and extra resources are required for sequence optimization Wecker2015_SM ; Reiher2016_SM . In Fig. S4(b) we plot the dependence of the Floquet XYZ annealing on the drive frequency, showing the resources necessary for high fidelity annealing as a function of the number of stroboscopic periods. A similar analysis is performed for the digital procedure, where the dependence of Trotter step number is considered [Fig. S4(c)]. Akin to the transverse Ising annealing case described in the main text, the Floquet approach shows smaller infidelity for limited number of steps, in particular for . Unlike the transverse Ising model, however even for as large as thousand steps, the digital approach fails provide smaller infidelity as compared to Floquet approach, but this may change if even higher number of Trotter steps are considered.
*Digital XYZ model.—*The considered digital simulation protocol, originally described in Ref. LasHeras2014_SM , is sketched in Fig. S5.
It relies on the sequential rotation of the basis for nearest-neighbour interaction, such that in the limit of a large number of Trotter steps it sums up to . First, the XY unitary is performed, implementing , where is some constant. Next, applying rotation around the axis for each qubit, , the two-qubit unitary can be transformed to . Subsequent rotation around the axis will implement the interaction. For instance, the final chosen configuration of , can be achieved by choosing (can be different from ), , , , simplifying the gate sequence. Finally, the operation introduces an effective magnetic field in the direction which allows for annealing to the ground state of the XYZ model. The linear schedule can then be designed similarly to the non-stoquastic case considered in Ref. Barends2016_SM . While the sequence represented in Fig. S5 will work perfectly in the limit, we note that the order of the unitaries , which form a Trotter step, will alter the final infidelity for the annealed state. Thus, for the digital simulation procedure we consider 24 permutations of unitaries for the set , and choose the sequence of the step which yields minimal infidelity.
We note that alternatively the XYZ model can be simulated with controlled-phase (ZZ) gates as described by Barends et al. Barends2016_SM .
References
- (1) M. Bukov, L. D’Alessio, and A. Polkovnikov, Universal High-Frequency Behavior of Periodically Driven Systems: from Dynamical Stabilization to Floquet Engineering, Advances in Physics, 64, 139 (2015).
- (2) N. Goldman and J. Dalibard, Periodically Driven Quantum Systems: Effective Hamiltonians and Engineered Gauge Fields, Phys. Rev. X 4, 031027 (2014).
- (3) U. Las Heras, A. Mezzacapo, L. Lamata, S. Filipp, A. Wallraff, and E. Solano, Digital Quantum Simulation of Spin Systems in Superconducting Circuits, Phys. Rev. Lett. 112, 200501 (2014).
- (4) Y. Salathé, M. Mondal, M. Oppliger, J. Heinsoo, P. Kurpiers, A. Potočnik, A. Mezzacapo, U. Las Heras, L. Lamata, E. Solano, S. Filipp, and A. Wallraff, Digital Quantum Simulation of Spin Models with Circuit Quantum Electrodynamics, Phys. Rev. X 5, 021027 (2015).
- (5) R. Barends et al., Digitized adiabatic quantum computing with a superconducting circuit, Nature 534, 222 (2016).
- (6) M. A. Rol, C. C. Bultink, T. E. O’Brien, S. R. de Jong, L. S. Theis, X. Fu, F. Luthi, R. F. L. Vermeulen, J. C. de Sterke, A. Bruno, D. Deurloo, R. N. Schouten, F. K. Wilhelm, L. DiCarlo, Restless Tuneup of High-Fidelity Qubit Gates, arXiv:1611.04815 (2016).
- (7) F. Motzoi, J. M. Gambetta, P. Rebentrost, and F. K. Wilhelm, Simple Pulses for Elimination of Leakage in Weakly Nonlinear Qubits, Phys. Rev. Lett. 103, 110501 (2009).
- (8) J. M. Martinis and M. R. Geller, Fast adiabatic qubit gates using only control, Phys. Rev. A 90, 022307 (2014).
- (9) D. Wecker, M. B. Hastings, N. Wiebe, B. K. Clark, C. Nayak, and M. Troyer, Solving strongly correlated electron models on a quantum computer, Phys. Rev. A 92, 062318 (2015).
- (10) M. Reiher, N. Wiebe, K. M Svore, D. Wecker, and M. Troyer, Elucidating Reaction Mechanisms on Quantum Computers, arXiv:1605.03590 (2016).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1(1) S. Lloyd, Universal Quantum Simulators , Science 273 , 1073 (1996).
- 2(2) D. Wecker, M. B. Hastings, N. Wiebe, B. K. Clark, C. Nayak, and M. Troyer, Solving strongly correlated electron models on a quantum computer, Phys. Rev. A 92 , 062318 (2015).
- 3(3) D. Wecker, B. Bauer, B. K. Clark, M. B. Hastings, and M. Troyer, Gate-count estimates for performing quantum chemistry on small quantum computers, Phys. Rev. A 90 , 022305 (2014).
- 4(4) M. Reiher, N. Wiebe, K. M Svore, D. Wecker, and M. Troyer, Elucidating Reaction Mechanisms on Quantum Computers, ar Xiv:1605.03590 (2016).
- 5(5) M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information , (Cambridge Univ. Press, 2010).
- 6(6) I. M. Georgescu, S. Ashhab, and Franco Nori, Quantum simulation, Rev. Mod. Phys. 86 , 153 (2014).
- 7(7) A. Wallraff, D. I. Schuster, A. Blais, L. Frunzio, R.-S. Huang, J. Majer, S. Kumar, S. M. Girvin and R. J. Schoelkopf, Circuit quantum electrodynamics: Coherent coupling of a single photon to a Cooper pair box, Nature (London) 431 , 162 (2004).
- 8(8) M. H. Devoret, R. J. Schoelkopf, Superconducting Circuits for Quantum Information: An Outlook, Science 339 , 1169 (2013).
