اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديد64-Qubit Quantum Circuit Simulation
228
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Classical simulations of quantum circuits are limited in both space and time when the qubit count is above 50, the realm where quantum supremacy reigns. However, recently, for the low depth circuit with more than 50 qubits, there are several methods of simulation proposed by teams at Google and IBM. Here, we present a scheme of simulation which can extract a large amount of measurement outcomes within a short time, achieving a 64-qubit simulation of a universal random circuit of depth 22 using a 128-node cluster, and 56- and 42-qubit circuits on a single PC. We also estimate that a 72-qubit circuit of depth 23 can be simulated in about 16 h on a supercomputer identical to that used by the IBM team. Moreover, the simulation processes are exceedingly separable, hence parallelizable, involving just a few inter-process communications. Our work enables simulating more qubits with less hardware burden and provides a new perspective for classical simulations.
قيم البحث
اقرأ أيضاً
We describe a qubit linearly coupled to a heat bath, either directly or via a cavity. The bath is formed of oscillators with a distribution of energies and coupling strengths, both for qubit-oscillator and oscillator-oscillator interaction. A direct
numerical solution of the Schrodinger equation for the full system including up to $10^6$ oscillators in the bath and analytic solutions are given, verifying quantum decay in short time quadratic (Zeno), long time exponential and eventually power law relaxation regimes. The main new results of the paper deal with applications and implications in quantum thermodynamics setups. We start by providing a correspondence of the oscillator bath to a resistor in a circuit. With the presented techniques we can then shed light on two topical questions of open quantum systems. First, splitting a quantum to uncoupled baths is presented as an opportunity for detection of low energy photons. Second, we address quantitatively the question of separation between a quantum system and its classical environment.
In the Bloch sphere picture, one finds the coefficients for expanding a single-qubit density operator in terms of the identity and Pauli matrices. A generalization to $n$ qubits via tensor products represents a density operator by a real vector of le
ngth $4^n$, conceptually similar to a statevector. Here, we study this approach for the purpose of quantum circuit simulation, including noise processes. The tensor structure leads to computationally efficient algorithms for applying circuit gates and performing few-qubit quantum operations. In view of variational circuit optimization, we study backpropagation through a quantum circuit and gradient computation based on this representation, and generalize our analysis to the Lindblad equation for modeling the (non-unitary) time evolution of a density operator.
The future development of quantum information using superconducting circuits requires Josephson qubits [1] with long coherence times combined to a high-fidelity readout. Major progress in the control of coherence has recently been achieved using circ
uit quantum electrodynamics (cQED) architectures [2, 3], where the qubit is embedded in a coplanar waveguide resonator (CPWR) which both provides a well controlled electromagnetic environment and serves as qubit readout. In particular a new qubit design, the transmon, yields reproducibly long coherence times [4, 5]. However, a high-fidelity single-shot readout of the transmon, highly desirable for running simple quantum algorithms or measur- ing quantum correlations in multi-qubit experiments, is still lacking. In this work, we demonstrate a new transmon circuit where the CPWR is turned into a sample-and-hold detector, namely a Josephson Bifurcation Amplifer (JBA) [6, 7], which allows both fast measurement and single-shot discrimination of the qubit states. We report Rabi oscillations with a high visibility of 94% together with dephasing and relaxation times longer than 0:5 mus. By performing two subsequent measurements, we also demonstrate that this new readout does not induce extra qubit relaxation.
The future development of quantum information using superconducting circuits requires Josephson qubits with long coherence times combined to a high-delity readout. Major progress in the control of coherence has recently been achieved using circuit qu
antum electrodynamics (cQED) architectures, where the qubit is embedded in a coplanar waveguide resonator (CPWR) which both provides a well controlled electromagnetic environment and serves as qubit readout. In particular a new qubit design, the transmon, yields reproducibly long coherence times. However, a high-delity single-shot readout of the transmon, highly desirable for running simple quantum algorithms or measuring quantum correlations in multi-qubit experiments, is still lacking. In this work, we demonstrate a new transmon circuit where the CPWR is turned into a sample-and-hold detector, namely a Josephson Bifurcation Amplifer (JBA), which allows both fast measurement and single-shot discrimination of the qubit states. We report Rabi oscillations with a high visibility of 94% together with dephasing and relaxation times longer than 0.5 $mu$s. By performing two subsequent measurements, we also demonstrate that this new readout does not induce extra qubit relaxation.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
