We propose a quantum algorithm for simulation of the Anderson transition in disordered lattices and study numerically its sensitivity to static imperfections in a quantum computer. In the vicinity of the critical point the algorithm gives a quadratic speedup in computation of diffusion rate and localization length, comparing to the known classical algorithms. We show that the Anderson transition can be detected on quantum computers with $7 - 10$ qubits.
We study analytically and numerically the effects of various imperfections in a quantum computation of a simple dynamical model based on the Quantum Wavelet Transform (QWT). The results for fidelity timescales, obtained for a large range of error amplitudes and number of qubits, imply that for static imperfections the threshold for fault-tolerant quantum computation is decreased by a few orders of magnitude compared to the case of random errors.
We determine the universal law for fidelity decayin quantum computations of complex dynamics in presenceof internal static imperfections in a quantum computer. Our approach is based on random matrix theory applied toquantum computations in presence of imperfections.The theoretical predictions are tested and confirmed in extensive numerical simulations of a quantum algorithm for quantum chaos in the dynamical tent map with up to 18 qubits. The theory developed determines the time scales forreliable quantum computations in absence of the quantum error correction codes. These time scales are rela…
We study numerically the imperfection effects in the quantum computing of the kicked rotator model in the regime of quantum chaos. It is shown that there are two types of physical characteristics: for one of them the quantum computation errors grow exponentially with the number of qubits in the computer while for the other the growth is polynomial. Certain similarity between classical and quantum computing errors is also discussed.
We study the properties of eigenstates of an operating quantum computer which simulates the dynamical evolution in the regime of quantum chaos. Even if the quantum algorithm is polynomial in number of qubits $n_q$, it is shown that the ideal eigenstates become mixed and strongly modified by static imperfections above a certain threshold which drops exponentially with $n_q$. Above this threshold the quantum eigenstate entropy grows linearly with $n_q$ but the computation remains reliable during a time scale which is polynomial in the imperfection strength and in $n_q$.
Quantum walks have been shown to have impressive transport properties compared to classical random walks. However, imperfections in the quantum walk algorithm can destroy any quantum mechanical speed-up due to Anderson localization. We numerically study the effect of static disorder on a quantum walk on the glued trees graph. For small disorder, we find that the dominant effect is a type of quantum decay, and not quantum localization. For intermediate disorder, there is a crossover to diffusive transport, while a localization transition is observed at large disorder, in agreement with Anderson…
We study the effects of dissipation or leakage on the time evolution of Grover's algorithm for a quantum computer. We introduce an effective two-level model with dissipation and randomness (imperfections), which is based upon the idea that ideal Grover's algorithm operates in a 2-dimensional Hilbert space. The simulation results of this model and Grover's algorithm with imperfections are compared, and it is found that they are in good agreement for appropriately tuned parameters. It turns out that the main features of Grover's algorithm with imperfections can be understood in terms of two basi…
We present a nonlocal construction of universal gates by means of holonomic (geometric) quantum teleportation. The effect of the errors from imperfect control of the classical parameters, the looping variation of which builds up holonomic gates, is investigated. Additionally, the influence of quantum decoherence on holonomic teleportation used as a computational primitive is studied. Advantages of the holonomic implementation with respect to control errors and dissipation are presented.
Optical nanostructures have proven to be meritorious for tailoring the emission properties of quantum emitters. However, unavoidable fabrication imperfections may represent a nuisance. Quite remarkably, disorder offers new opportunities since light can be efficiently confined by random multiple scattering leading to Anderson localization. Here we investigate the effect of such disorder-induced cavities on the emission dynamics of single quantum dots embedded in disordered photonic-crystal waveguides. We present time-resolved measurements of both the total emission from Anderson-localized cavit…
We formulate and numerically simulate the single control qubit Shor algorithm for the case of static imperfections induced by residual couplings between qubits. This allows us to study the accuracy of Shor's algorithm with respect to these imperfections using numerical simulations of realistic quantum computations with up to $n_q=18$ computational qubits allowing to factor numbers up to N=205193. We confirm that the algorithm remains operational up to a critical coupling strength $ε_c$ which drops only polynomially with $\log_2 N$. The obtained numerical dependence of $ε_c$ on $\log_2 N$ is in…
The simulation of complex quantum systems on a quantum computer is studied, taking the kicked Harper model as an example. This well-studied system has a rich variety of dynamical behavior depending on parameters, displays interesting phenomena such as fractal spectra, mixed phase space, dynamical localization, anomalous diffusion, or partial delocalization, and can describe electrons in a magnetic field. Three different quantum algorithms are presented and analyzed, enabling to simulate efficiently the evolution operator of this system with different precision using different resources. Depend…
The transmission of an excitation along a spin chain can be hindered by the presence of small fixed imperfections that create trapping regions where the excitation may get caught (Anderson localization). A certain degree of noise, ensuing from the interaction with a thermal bath, allows to overcome localization (noise-assisted transport). In this paper we investigate the relation between noise-assisted transport and (quantum) computation. In particular we prove that noise does assist classical computation on a quantum computing device but hinders the possibility of creating entanglement.
We show that a quantum computer operating with a small number of qubits can simulate the dynamical localization of classical chaos in a system described by the quantum sawtooth map model. The dynamics of the system is computed efficiently up to a time $t\geq \ell$, and then the localization length $\ell$ can be obtained with accuracy $ν$ by means of order $1/ν^2$ computer runs, followed by coarse grained projective measurements on the computational basis. We also show that in the presence of static imperfections a reliable computation of the localization length is possible without error correc…
We study effects of static inter-qubit interactions and random errors in quantum gates on the stability of various quantum algorithms including the Grover quantum search algorithm and the quantum chaos maps. For the Grover algorithm our numerical and analytical results show existence of regular and chaotic phases depending on the static imperfection strength $ε$. The critical border $ε_c$ between two phases drops polynomially with the number of qubits $n_q$ as $ε_c \sim n_q^{-3/2}$. In the regular phase $(ε< ε_c)$ the algorithm remains robust against imperfections showing the efficiency gain $…
We study the influence of errors and decoherence on both the performance of Shor's factoring algorithm and Grover's search algorithm, and on the amount of interference in these algorithms using a recently proposed interference measure. We consider systematic unitary errors, random unitary errors, and decoherence processes. We show that unitary errors which destroy the interference destroy the efficiency of the algorithm, too. However, unitary errors may also create useless additional interference. In such a case the total amount of interference can increase, while the efficiency of the quantum…
The extension of quantum trajectory theory to incorporate realistic imperfections in the measurement of solid-state qubits is important for quantum computation, particularly for the purposes of state preparation and error-correction as well as for readout of computations. Previously this has been achieved for low-frequency (dc) weak measurements. In this paper we extend realistic quantum trajectory theory to include radio frequency (rf) weak measurements where a low-transparency quantum point contact (QPC), coupled to a charge qubit, is used to damp a classical oscillator circuit. The resultin…
We study effects of imperfections induced by residual couplings between qubits on the accuracy of Shor's algorithm using numerical simulations of realistic quantum computations with up to 30 qubits. The factoring of numbers up to N=943 show that the width of peaks, which frequencies allow to determine the factors, grow exponentially with the number of qubits. However, the algorithm remains operational up to a critical coupling strength $ε_c$ which drops only polynomially with $\log_2 N$. The numerical dependence of $ε_c$ on $\log_2 N$ is explained by analytical estimates that allows to obtain …
BosonSampling is a problem where a quantum computer offers a provable speedup over classical computers. Its main feature is that it can be solved with current linear optics technology, without the need for a full quantum computer. In this work, we investigate whether an experimentally realistic BosonSampler can really solve BosonSampling without any fault-tolerance mechanism. More precisely, we study how the unavoidable errors linked to an imperfect calibration of the optical elements affect the final result of the computation. We show that the fidelity of each optical element must be at least…
We derive a general Hamiltonian that governs the interaction between an $N$-ion chain and an externally controlled laser field, where the ion motion is quantized and the laser field is considered beyond the plane-wave approximation. This general form not only explicitly includes terms that are used to drive ion-ion entanglement, but also a series of unwanted terms that can lead to quantum gate infidelity. We demonstrate the power of our expressivity of the general Hamiltonian by singling out the effect of axial mode heating and confirm this experimentally. We discuss pathways forward in furthe…
Quantum Machine Learning (QML) algorithms to solve classifications problems have been made available thanks to recent advancements in quantum computation. While the number of qubits are still relatively small, they have been used for "quantum enhancement" of machine learning. An important question is related to the efficacy of such protocols. We evaluate this efficacy using common baseline data sets, in addition to recent coronavirus spread data as well as the quantum metal-insulator transition in three dimensions. For the computation, we used the 16 qubit IBM quantum computer. We find that th…
We introduce a mapping between a variety of superconducting circuits and a family of Hamiltonians describing localized magnetic impurities interacting with conduction bands. This includes the Anderson model, the single impurity one- and two-channel Kondo problem, as well as the 1D Kondo lattice. We compare the requirements for performing quantum simulations using the proposed circuits to those of universal quantum computation with superconducting qubits, singling out the specific challenges that will have to be addressed.
A general error correction method is presented which is capable of correcting coherent errors originating from static residual inter-qubit couplings in a quantum computer. It is based on a randomization of static imperfections in a many-qubit system by the repeated application of Pauli operators which change the computational basis. This Pauli-Random-Error-Correction (PAREC)-method eliminates coherent errors produced by static imperfections and increases significantly the maximum time over which realistic quantum computations can be performed reliably. Furthermore, it does not require redundan…
The theory of stabilizer quantum error correction allows us to actively stabilize quantum states and simulate ideal quantum operations in a noisy environment. It is critical is to correctly diagnose noise from its syndrome and nullify it accordingly. However, hardware that performs quantum error correction itself is inevitably imperfect in practice. Here, we show that stabilizer codes possess a built-in capability of correcting errors not only on quantum information but also on faulty syndromes extracted by themselves. Shor's syndrome extraction for fault-tolerant quantum computation is natura…
We propose an all-geometric implementation of quantum computation using neutral atoms in cavity QED. We show how to perform generic single- and two-qubit gates, the latter by encoding a two-atom state onto a single, many-level atom. We compare different strategies to overcome limitations due to cavity imperfections.
In the era of quantum computing without full fault-tolerance, it is essential to suppress noise effects via the quantum error mitigation techniques to enhance the computational power of the quantum devices. One of the most effective noise-agnostic error mitigation schemes is the generalized quantum subspace expansion (GSE) method, which unifies various mitigation algorithms under the framework of the quantum subspace expansion. Specifically, the fault-subspace method, a subclass of GSE method, constructs an error-mitigated quantum state with copies of quantum states with different noise levels…
We propose a scheme for scalable photonic quantum computation based on cavity assisted interaction between single-photon pulses. The prototypical quantum controlled phase-flip gate between the single-photon pulses is achieved by successively reflecting them from an optical cavity with a single-trapped atom. Our proposed protocol is shown to be robust to practical nose and experimental imperfections in current cavity-QED setups.
Quantum computers, which process information encoded in quantum mechanical systems, hold the potential to solve some of the hardest computational problems. A substantial obstacle for the further development of quantum computers is the fact that the life time of quantum information is usually too short to allow practical computation. A promising method to increase the life time, known as dynamical decoupling, consists of applying a periodic series of inversion pulses to the quantum bits. In the present review, we give an overview of this technique and compare different pulse sequences proposed …
We assess the effects of an intrinsic model for imperfections in cluster states by introducing {\it noisy cluster states} and characterizing their role in the one-way model for quantum computation. The action of individual dephasing channels on cluster qubits is also studied. We show that the effect of non-idealities is limited by using small clusters, which requires compact schemes for computation. In light of this, we address an experimentally realizable four-qubit linear cluster which simulates a controlled-{\sf NOT} ({\sf CNOT}).
We investigate the possibility of realising effective quantum gates between two atoms in distant cavities coupled by an optical fibre. We show that highly reliable swap and entangling gates are achievable. We exactly study the stability of these gates in presence of imperfections in coupling strengths and interaction times and prove them to be robust. Moreover, we analyse the effect of spontaneous emission and losses and show that such gates are very promising in view of the high level of coherent control currently achievable in optical cavities.
With the development of delegated quantum computation, clients will want to ensure confidentiality of their data and algorithms, and the integrity of their computations. While protocols for blind and verifiable quantum computation exist, they suffer from high overheads and from over-sensitivity: When running on noisy devices, imperfections trigger the same detection mechanisms as malicious attacks, resulting in perpetually aborted computations. We introduce the first blind and verifiable protocol for delegating BQP computations to a powerful server with repetition as the only overhead. It is c…
Real materials always contain, to some extent, randomness in the form of defects or irregularities. It is known since the seminal work of Anderson that randomness can drive a metallic phase to an insulating one, and the mechanism responsible for this transition is intrinsically different from the one of the interaction-induced transitions discovered by Mott. Lattice Hamiltonians, with their conceptual and computational advantages, permitted to investigate broadly the interplay of both mechanisms. However, a clear understanding of the differences (or not) with their real-space counterparts is l…
In spontaneous parametric down conversion (SPDC) based quantum information processing (QIP) experiments, there is a tradeoff between the coincide count rates (i.e. the pumping power of the SPDC), which limits the rate of the protocol, and the visibility of the quantum interference, which limits the quality of the protocol. This tradeoff is mainly caused by the multi-photon pair emissions from the SPDCs. In theory, the problem is how to model the experiments without truncating these multi-photon emissions while including practical imperfections. In this paper, we establish a method to theoretic…
We present an all-optical implementation of quantum computation using semiconductor quantum dots. Quantum memory is represented by the spin of an excess electron stored in each dot. Two-qubit gates are realized by switching on trion-trion interactions between different dots. State selectivity is achieved via conditional laser excitation exploiting Pauli exclusion principle. Read-out is performed via a quantum-jump technique. We analyze the effect on our scheme's performance of the main imperfections present in real quantum dots: exciton decay, hole mixing and phonon decoherence. We introduce a…
Quantum information processing requires a high degree of isolation from the detrimental effects of the environment as well as an extremely precise level of control on the way quantum dynamics unfolds in the information-processing system. In this paper, we show how these two goals can be ideally achieved by hybridizing the concepts of noiseless subsystems and of holonomic quantum computation. An all-geometric universal computation scheme based on non-adiabatic and non-Abelian quantum holonomies embedded in a four-qubit noiseless subsystem for general collective decoherence is proposed. The impl…
Medium-scale quantum devices that integrate about hundreds of physical qubits are likely to be developed in the near future. However, such devices will lack the resources for realizing quantum fault tolerance. Therefore, the main challenge of exploring the advantage of quantum computation is to minimize the impact of device and control imperfections without encoding. Quantum error mitigation is a solution satisfying the requirement. Here, we demonstrate an error mitigation protocol based on gate set tomography and quasiprobability decomposition. One- and two-qubit circuits are tested on a supe…
We show that deterministic quantum computing with one qubit (DQC1) can be experimentally implemented with a spatial light modulator, using the polarization and the transverse spatial degrees of freedom of light. The scheme allows the computation of the trace of a high dimension matrix, being limited by the resolution of the modulator panel, and the technical imperfections. In order to illustrate the method, we compute the normalized trace of unitary matrices, and implement the Deutsch-Jozsa algorithm. The largest matrix that can be manipulated with our set-up is 1080$\times$1920, which is able…
Engineering desired Hamiltonian in quantum many-body systems is essential for applications such as quantum simulation, computation and sensing. Conventional quantum Hamiltonian engineering sequences are designed using human intuition based on perturbation theory, which may not describe the optimal solution and is unable to accommodate complex experimental imperfections. Here we numerically search for Hamiltonian engineering sequences using deep reinforcement learning (DRL) techniques and experimentally demonstrate that they outperform celebrated sequences on a solid-state nuclear magnetic reso…
Describing the critical behavior of the Anderson transition in infinite dimension by random-matrix ensembles: logarithmic multifractality and critical localization
Performance Limits of Fault-Tolerant Quantum Error Correction Schemes
University of Bologna（博洛尼亚大学）；CNIT/WiLab（国家信息技术研究与开发中心/无线实验室）；Department of Electrical, Electronic, and Information Engineering “Guglielmo Marconi”（“古列尔莫·马可尼”电气、电子和信息工程系）；Quantinuum
Quantum information processing devices need to be robust and stable against external noise and internal imperfections to ensure correct operation. In a setting of measurement-based quantum computation, we explore how an intelligent agent endowed with a projective simulator can act as controller to adapt measurement directions to an external stray field of unknown magnitude in a fixed direction. We assess the agent's learning behavior in static and time-varying fields and explore composition strategies in the projective simulator to improve the agent's performance. We demonstrate the applicabil…
Quantum network protocols offer new functionalities such as enhanced security to communication and computational systems. Despite the rapid progress in quantum hardware, it has not yet reached a level of maturity that enables execution of many quantum protocols in practical settings. To develop quantum protocols in real world, it is necessary to examine their performance considering the imperfections in their practical implementation using simulation platforms. In this paper, we consider several quantum protocols that enable promising functionalities and services in near-future quantum network…
We study the use of the quantum wavelet transform to extract efficiently information about the multifractal exponents for multifractal quantum states. We show that, combined with quantum simulation algorithms, it enables to build quantum algorithms for multifractal exponents with a polynomial gain compared to classical simulations. Numerical results indicate that a rough estimate of fractality could be obtained exponentially fast. Our findings are relevant e.g. for quantum simulations of multifractal quantum maps and of the Anderson model at the metal-insulator transition.
Quantum computing devices are inevitably subject to errors. To leverage quantum technologies for computational benefits in practical applications, quantum algorithms and protocols must be implemented reliably under noise and imperfections. Since noise and imperfections limit the size of quantum circuits that can be realized on a quantum device, developing quantum error mitigation techniques that do not require extra qubits and gates is of critical importance. In this work, we present a deep learning-based protocol for reducing readout errors on quantum hardware. Our technique is based on train…
Testing measurement-based computational phases of quantum matter on a quantum processor
University of Chicago（芝加哥大学）；Pritzker School of Molecular Engineering, University of Chicago（普林茨克分子工程学院，芝加哥大学）；University of British Columbia（不列颠哥伦比亚大学）；Stewart Blusson Quantum Matter Institute, University of British Columbia（斯图尔特·布拉斯量子物质研究所，不列颠哥伦比亚大学）
Quantum solver for single-impurity Anderson models with particle-hole symmetry
Middle Tennessee State University（中田纳西州立大学）；Quantum Research Interdisciplinary Science and Education (QRISE) Center, Middle Tennessee State University（中田纳西州立大学量子研究交叉科学与教育中心）
Probing disorder-driven topological phase transitions via topological edge modes with ultracold atoms in Floquet-engineered honeycomb lattices
Max-Planck-Institut für Quantenoptik（马克斯·普朗克量子光学研究所）；Munich Center for Quantum Science and Technology (MCQST)（慕尼黑量子科学与技术中心）；Fakultät für Physik, Ludwig-Maximilians-Universität（慕尼黑大学物理学院）
We propose a protocol for bosonic binomial-code nonadiabatic holonomic quantum computation in a system composed of an artificial atom ultrastrongly coupled to a cavity resonator. In our protocol, the binomial codes, formed by superpositions of Fock states, can greatly save physical resources to correct errors in quantum computation. We apply to the system strong driving fields designed by shortcuts-to-adiabatic methods. This reduces the gate time to tens of nanoseconds. Decoherence of the system accumulated over time can be effectively reduced by such a fast evolution. Noise induced by control…
We show that quantum circuits where the initial state and all the following quantum operations can be represented by positive Wigner functions can be classically efficiently simulated. This is true both for continuous-variable as well as discrete variable systems in odd prime dimensions, two cases which will be treated on entirely the same footing. Noting the fact that Clifford and Gaussian operations preserve the positivity of the Wigner function, our result generalizes the Gottesman-Knill theorem. Our algorithm provides a way of sampling from the output distribution of a computation or a sim…
Quantum bits have technological imperfections. Additionally, the capacity of a component that can be implemented feasibly is limited. Therefore, distributed quantum computation is required to scale up quantum computers. This dissertation presents a new quantum computer architecture which takes into account imperfections, aimed to realize distributed computation by connecting quantum computers each of which consists of multiple quantum CPUs and memories. Quantum CPUs employ a quantum error correcting code which has faster logical gates and quantum memories employ a code which is superior in spa…
Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model and thus gives an approximate solution of the Hubbard model from the solution of simpler quantum impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models by preparing and evolving the ground state under the impurity Hamiltonian on a quantum computer that is assumed to have the scalability and accuracy far beyond the current state-of-the-art quantum hardware. As a proof of principle demonstration targeting t…
