اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFast and differentiable simulation of driven quantum systems
54
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The controls enacting logical operations on quantum systems are described by time-dependent Hamiltonians that often include rapid oscillations. In order to accurately capture the resulting time dynamics in numerical simulations, a very small integration time step is required, which can severely impact the simulation run-time. Here, we introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical integrators. This solver, which we name Dysolve, efficiently captures the effect of the highly oscillatory terms in the system Hamiltonian, significantly reducing the simulations run time as well as its sensitivity to the time-step size. Furthermore, this solver provides the exact derivative of the time-evolution operator with respect to the drive amplitudes. This key feature allows for optimal control in the limit of strong drives and goes beyond common pulse-optimization approaches that rely on rotating-wave approximations. As an illustration of our method, we show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
قيم البحث
اقرأ أيضاً
We introduce a new technique for the simulation of dissipative quantum systems. This method is composed of an approximate decomposition of the Lindblad equation into a Kraus map, from which one can define an ensemble of wavefunctions. Using principal
component analysis, this ensemble can be truncated to a manageable size without sacrificing numerical accuracy. We term this method emph{Ensemble Rank Truncation} (ERT), and find that in the regime of weak coupling, this method is able to outperform existing wavefunction Monte-Carlo methods by an order of magnitude in both accuracy and speed. We also explore the possibility of combining ERT with approximate techniques for simulating large systems (such as Matrix Product States (MPS)), and show that in many cases this approach will be more efficient than directly expressing the density matrix in its MPS form. We expect the ERT technique to be of practical interest when simulating dissipative systems for quantum information, metrology and thermodynamics.
We compare discrete-time quantum walks on graphs to their natural classical equivalents, which we argue are lifted Markov chains, that is, classical Markov chains with added memory. We show that these can simulate quantum walks, allowing us to answer
an open question on how the graph topology ultimately bounds their mixing performance, and that of any stochastic local evolution. The results highlight that speedups in mixing and transport phenomena are not necessarily diagnostic of quantum effects, although superdiffusive spreading is more prominent with quantum walks.
We introduce a combined molecular dynamics (MD) and quantum trajectories (QT) code to simulate the effects of near-resonant optical fields on state-vector evolution and particle motion in a collisional system. In contrast to collisionless systems, in
which the quantum dynamics of multi-level, laser-driven particles with spontaneous emission can be described with the optical Bloch equations (OBEs), particle velocities in sufficiently collisional systems change on timescales comparable to those of the laser-induced, quantum-state dynamics. These transient velocity changes can cause the time-averaged velocity dependence of the quantum state to differ from the OBE solution. We use this multiscale code to describe laser-cooling in a strontium ultracold neutral plasma. Important phenomena described by the simulation include suppression of electromagnetically induced transparencies through rapid velocity changing collisions and thermalization between cooled and un-cooled directions for anisotropic laser cooling.
A quantum algorithm is presented for the simulation of arbitrary Markovian dynamics of a qubit, described by a semigroup of single qubit quantum channels ${T_t}$ specified by a generator $mathcal{L}$. This algorithm requires only $mathcal{O}big((||ma
thcal{L}||_{(1rightarrow 1)} t)^{3/2}/epsilon^{1/2} big)$ single qubit and CNOT gates and approximates the channel $T_t = e^{tmathcal{L}}$ up to chosen accuracy $epsilon$. Inspired by developments in Hamiltonian simulation, a decomposition and recombination technique is utilised which allows for the exploitation of recently developed methods for the approximation of arbitrary single-qubit channels. In particular, as a result of these methods the algorithm requires only a single ancilla qubit, the minimal possible dilation for a non-unitary single-qubit quantum channel.
A typical goal of a quantum simulation is to find the energy levels and eigenstates of a given Hamiltonian. This can be realized by adiabatically varying the system control parameters to steer an initial eigenstate into the eigenstate of the target H
amiltonian. Such an adiabatic quantum simulation is demonstrated by directly implementing a controllable and smoothly varying Hamiltonian in the rotating frame of two superconducting qubits, including longitudinal and transverse fields and iSWAP-type two-qubit interactions. The evolution of each eigenstate is tracked using time-resolved state tomography. The energy gaps between instantaneous eigenstates are chosen such that depending on the energy transition rate either diabatic or adiabatic passages are observed in the measured energies and correlators. Errors in the obtained energy values induced by finite $T_1$ and $T_2$ times of the qubits are mitigated by extrapolation to short protocol times.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
