As quantum devices make steady progress towards intermediate scale and fault-tolerant quantum computing, it is essential to develop rigorous and efficient measurement protocols that account for known sources of noise. Most existing quantum characterization protocols such as gate set tomography and randomized benchmarking assume the noise acting on the qubits is Markovian. However, this assumption is often not valid, as for the case of 1/f charge noise or hyperfine nuclear spin noise. Here, we present a general framework for quantum process tomography (QPT) in the presence of time-correlated noise. We further introduce fidelity benchmarks that quantify the relative strength of different sources of Markovian and non-Markovian noise. As an application of our method, we perform a comparative theoretical and experimental analysis of silicon spin qubits. We first develop a detailed noise model that accounts for the dominant sources of noise and validate the model against experimental data. Applying our framework for time-correlated QPT, we find that the number of independent parameters needed to characterize one and two-qubit gates can be compressed by 10x and 100x, respectively, when compared to the fully generic case. These compressions reduce the amount of tomographic measurements needed in experiment, while also significantly speeding up numerical simulations of noisy quantum circuit dynamics compared to time-dependent Hamiltonian simulation. Using this compressed noise model, we find good agreement between our theoretically predicted process fidelities and two qubit interleaved randomized benchmarking fidelities of 99.8% measured in recent experiments on silicon spin qubits. More broadly, our formalism can be directly extended to develop efficient and scalable tuning protocols for high-fidelity control of large-arrays of quantum devices with non-Markovian noise.
We apply the method of compressed sensing (CS) quantum process tomography (QPT) to characterize quantum gates based on superconducting Xmon and phase qubits. Using experimental data for a two-qubit controlled-Z gate, we obtain an estimate for the process matrix $χ$ with reasonably high fidelity compared to full QPT, but using a significantly reduced set of initial states and measurement configurations. We show that the CS method still works when the amount of used data is so small that the standard QPT would have an underdetermined system of equations. We also apply the CS method to the analys…
Long-range correlated errors can severely impact the performance of NISQ (noisy intermediate-scale quantum) devices, and fault-tolerant quantum computation. Characterizing these errors is important for improving the performance of these devices, via calibration and error correction, and to ensure correct interpretation of the results. We propose a compressed sensing method for detecting two-qubit correlated dephasing errors, assuming only that the correlations are sparse (i.e., at most s pairs of qubits have correlated errors, where s << n(n-1)/2, and n is the total number of qubits). In parti…
Note: This preprint has been superseded by arXiv:1806.04318. Recent advances in nanotechnology have enabled researchers to control individual quantum mechanical objects with unprecedented accuracy, opening the door for both quantum and extreme-scale conventional computing applications. As these devices become larger and more complex, the ability to design them such that they can be simply controlled becomes a daunting and computationally infeasible task. Here, motivated by ideas from compressed sensing, we introduce a protocol for the Compressed Optimization of Device Architectures (CODA). It …
Characterising quantum processes is a key task in and constitutes a challenge for the development of quantum technologies, especially at the noisy intermediate scale of today's devices. One method for characterising processes is randomised benchmarking, which is robust against state preparation and measurement (SPAM) errors, and can be used to benchmark Clifford gates. A complementing approach asks for full tomographic knowledge. Compressed sensing techniques achieve full tomography of quantum channels essentially at optimal resource efficiency. So far, guarantees for compressed sensing protoc…
In [R. Jozsa, B. Kraus, A. Miyake, J. Watrous, Proc. R. Soc. A {\bf 466}, 809-830 (2010)] it has been shown that a match gate circuit running on n qubits can be compressed to a universal quantum computation on \log(n)+3 qubits. Here, we show how this compression can be employed to simulate the Ising interaction of a 1D--chain consisting out of n qubits using a universal quantum computer running on log(n) qubits. We demonstrate how the adiabatic evolution can be realized on this exponentially smaller system and how the magnetization, which shows a quantum phase transition, can be measured.
In multi-qubit system, correlated errors subject to unwanted interactions with other qubits is one of the major obstacles for scaling up quantum computers to be applicable. We present two approaches to correct such noise and demonstrate with high fidelity and robustness. We use spectator and intruder to discriminate the environment interacting with target qubit in different parameter regime. Our proposed approaches combines analytical theory and numerical optimization, and are general to obtain smooth control pulses for various qubit systems. Both theory and numerical simulations demonstrate t…
Many qubit implementations are afflicted by correlated noise not captured by standard theoretical tools that are based on Markov approximations. While independent gate operations are a key concept for quantum computing, it is actually not possible to fully describe noisy gates locally in time if noise is correlated on times longer than their duration. To address this issue, we develop a method based on the filter function formalism to perturbatively compute quantum processes in the presence of correlated classical noise. We derive a composition rule for the filter function of a sequence of gat…
Randomized benchmarking has emerged as a popular and easy-to-implement experimental technique for gauging the quality of gate operations in quantum computing devices. A typical randomized benchmarking procedure identifies the exponential decay in the fidelity as the benchmarking sequence of gates increases in length, and the decay rate is used to estimate the fidelity of the gate. That the fidelity decays exponentially, however, relies on the assumption of time-independent or static noise in the gates, with no correlations or significant drift in the noise over the gate sequence, a well-satisf…
Growth in the complexity and capabilities of quantum information hardware mandates access to practical techniques for performance verification that function under realistic laboratory conditions. Here we experimentally characterise the impact of common temporally correlated noise processes on both randomised benchmarking (RB) and gate-set tomography (GST). We study these using an analytic toolkit based on a formalism mapping noise to errors for arbitrary sequences of unitary operations. This analysis highlights the role of sequence structure in enhancing or suppressing the sensitivity of quant…
We show that a significant quantum gain corresponding to squeezed or over-squeezed spin states can be obtained in multiparameter estimation by measuring the Hadamard coefficients of a 1D or 2D signal. The physical platform we consider consists of twolevel atoms in an optical lattice in a squeezed-Mott configuration, or more generally by correlated spins distributed in spatially separated modes. Our protocol requires the possibility to locally flip the spins, but relies on collective measurements. We give examples of applications to scalar or vector field mapping and compressed sensing.
In this work, we report on a novel quantum gate approximation algorithm based on the application of parametric two-qubit gates in the synthesis process. The utilization of these parametric two-qubit gates in the circuit design allows us to transform the discrete combinatorial problem of circuit synthesis into an optimization problem over continuous variables. The circuit is then compressed by a sequential removal of two-qubit gates from the design, while the remaining building blocks are continuously adapted to the reduced gate structure by iterated learning cycles. We implemented the develope…
The current generation of noisy intermediate scale quantum computers introduces new opportunities to study quantum many-body systems. In this paper, we show that quantum circuits can provide a dramatically more efficient representation than current classical numerics of the quantum states generated under non-equilibrium quantum dynamics. For quantum circuits, we perform both real- and imaginary-time evolution using an optimization algorithm that is feasible on near-term quantum computers. We benchmark the algorithms by finding the ground state and simulating a global quench of the transverse f…
Quantum states obey an asymptotic no-cloning theorem, stating that no deterministic machine can reliably replicate generic sequences of identically prepared pure states. In stark contrast, we show that generic sequences of unitary gates can be replicated deterministically at nearly quadratic rates, with an error vanishing on most inputs except for an exponentially small fraction. The result is not in contradiction with the no-cloning theorem, since the impossibility of deterministically transforming pure states into unitary gates prevents the application of the gate replication protocol to sta…
The notion of compressed quantum computation is employed to simulate the Ising interaction of a 1D--chain consisting out of $n$ qubits using the universal IBM cloud quantum computer running on $\log(n)$ qubits. The external field parameter that controls the quantum phase transition of this model translates into particular settings of the quantum gates that generate the circuit. We measure the magnetization, which displays the quantum phase transition, on a two--qubit system, which simulates a four--qubit Ising chain, and show its agreement with the theoretical prediction within a certain error…
Majorana-based quantum gates are not complete for performing universal topological quantum computation while Fibonacci-based gates are difficult to be realized electronically and hardly coincide with the conventional quantum circuit models. In Ref. \cite{hukane}, it has been shown that a strongly correlated Majorana edge mode in a chiral topological superconductor can be decomposed into a Fibobacci anyon $τ$ and a thermal operator anyon $\varepsilon$ in the tricritical Ising model. The deconfinement of $τ$ and $\varepsilon$ via the interaction between the fermion modes yields the anyon {collis…
This paper investigates quantum error correction schemes for fully-correlated noise channels on an $n$-qubit system, where error operators take the form $W^{\otimes n}$, with $W$ being an arbitrary $2\times 2$ unitary operator. In previous literature, a recursive quantum error correction scheme can be used to protect $k$ qubits using $(k+1)$-qubit ancilla. We implement this scheme on 3-qubit and 5-qubit channels using the IBM quantum computers, where we uncover an error in the previous paper related to the decomposition of the encoding/decoding operator into elementary quantum gates. Here, we …
Correlated electron materials, such as superconductors and magnetic materials, are regarded as fascinating targets in quantum computing. However, the quantitative resources, specifically the number of quantum gates and qubits, required to perform a quantum algorithm to simulate correlated electron materials remain unclear. In this study, we estimate the resources required for the Hamiltonian simulation algorithm for correlated electron materials, specifically for organic superconductors, iron-based superconductors, binary transition metal oxides, and perovskite oxides, using the fermionic swap…
Zero-noise extrapolation is a quantum error mitigation technique that has typically been studied under the ideal approximation that the noise acting on a quantum device is not time-correlated. In this work, we investigate the feasibility and performance of zero-noise extrapolation in the presence of time-correlated noise. We show that, in contrast to white noise, time-correlated noise is harder to mitigate via zero-noise extrapolation because it is difficult to scale the noise level without also modifying its spectral distribution. This limitation is particularly strong if "local" gate-level m…
Bounding the cost of classically simulating the outcomes of universal quantum circuits to additive error $δ$ is often called weak simulation and is a direct way to determine when they confer a quantum advantage. Weak simulation of the $T$+Clifford gateset is $BQP$-complete and is expected to scale exponentially with the number $t$ of $T$ gates. We constructively tighten the upper bound on the worst-case $L_1$ norm sampling cost to next order in $t$ from $\mathcal O(ξ^t δ^{-2})$ if $δ^2 \gg ξ^{-t}$ to $\mathcal O((ξ^t{-}t) δ^{-2} )$ if $δ^2 \gg (ξ^t -t)^{-1}$, where $ξ^t = 2^{\sim 0.228 t}$ is …
The surface code is designed to suppress errors in quantum computing hardware and currently offers the most believable pathway to large-scale quantum computation. The surface code requires a 2-D array of nearest-neighbor coupled qubits that are capable of implementing a universal set of gates with error rates below approximately 1%, requirements compatible with experimental reality. Consequently, a number of authors are attempting to squeeze additional performance out of the surface code. We describe an optimal complexity error suppression algorithm, parallelizable to O(1) given constant compu…
We propose a universal quantum computing scheme in which the orthogonal qubit states $|0>$ and $|1>$ are identical in their single-particle spin and charge properties. Each qubit is contained in a single quantum dot and gate operations are induced all-electrically by changes in the confinement potential. Within the computational space, these qubits are robust against environmental influences that couple to the system through single-particle channels. Due to the identical spin and charge properties of the $|0>$, $|1>$ states, the lowest-order relaxation and decoherence rates $1/T_1$ and $1/T_2$…
Implementation of variational Quantum Machine Learning (QML) algorithms on Noisy Intermediate-Scale Quantum (NISQ) devices is known to have issues related to the high number of qubits needed and the noise associated with multi-qubit gates. In this paper, we propose a variational QML algorithm using a dressed quantum network to address these issues. Using the "super compressed encoding" scheme that we follow here, the classical encoding layer in our dressed network drastically scales down the input-dimension, before feeding the input to the variational quantum circuit. Hence, the number of qubi…
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic systems. We focus specifically on 2D and linear geometry with nearest neighbor qubit-qubit couplings, typical for superconducting transmon qubit arrays. We improve an existing algorithm to prepare an arbitrary Slater determinant by exploiting a unitary symmetry. We also present a quantum algorithm to prepare an arbitrary fermionic Gaussian state with $O(N^2…
Quantum error correction provides a path to large-scale quantum computers, but is built on challenging assumptions about the characteristics of the underlying errors. In particular, the mathematical assumption of independent errors in quantum logic operations is at odds with realistic environments where error-sources may exhibit strong temporal correlations. We present experiments enabling the identification of error correlations between operations in quantum circuits, using only projective measurements at the end of the circuit. Using a single trapped ion qubit and engineered noise with tunab…
Adaptive time Compressed QITE (ACQ) and its geometrical interpretation
Universidad CEU Cardenal Herrera（塞乌卡迪纳尔埃雷拉大学）；Universitat Politècnica de València（瓦伦西亚理工大学）；Universitat de València-CSIC（瓦伦西亚大学-西班牙国家研究委员会）；The Barcelona Institute of Science and Technology（巴塞罗那科学与技术研究所）；Griffith University（格里菲斯大学）；VTT Technical Research Centre of Finland（芬兰技术研究中心）；Leibniz Institute of Hannover（汉诺威莱布尼茨研究所）；TU Berlin（柏林工业大学）
Quantum Simulation of Strongly Correlated Fermion-Phonon Models in Circuit QED
Institute for Quantum Computing Analytics (PGI-12), Forschungszentrum Jülich（朱利希研究中心量子计算分析研究所）；Theoretical Physics, Saarland University（萨尔兰州立大学理论物理系）；Institute for Theoretical Physics, University of Cologne（科隆大学理论物理研究所）
Simulating complex molecules and materials is an anticipated application of quantum devices. With strong quantum advantage demonstrated in artificial tasks, we examine how such advantage translates into modeling physical problems of correlated electronic structure. We simulate static and dynamical electronic structure on a superconducting quantum processor derived from Google's Sycamore architecture for two representative correlated electron problems: the nitrogenase iron-sulfur molecular clusters, and $α$-ruthenium trichloride, a proximate spin-liquid material. To do so, we simplify the elect…
Correlation-Assisted Odd-Parity Encoded Gates in Coupled Fluxonium Qubits under Non-Markovian TLS Noise
School of Physics, Hangzhou Dianzi University（杭州电子科技大学物理学院）；State Key Laboratory of Quantum Optics Technologies and Devices, Shanxi University（山西大学量子光学技术与器件国家重点实验室）；Zhejiang Key Laboratory of Quantum State Control and Optical Field Manipulation, Hangzhou Dianzi University（杭州电子科技大学量子态调控与光场操纵浙江省重点实验室）
We show that errors are not generated correlatedly provided that quantum bits do not directly interact with (or couple to) each other. Generally, this no-qubits-interaction condition is assumed except for the case where two-qubit gate operation is being performed. In particular, the no-qubits-interaction condition is satisfied in the collective decoherence models. Thus, errors are not correlated in the collective decoherence. Consequently, we can say that current quantum error correcting codes which correct single-qubit-errors will work in most cases including the collective decoherence.
We propose an implementation of holonomic (geometrical) quantum gates by means of semiconductor nanostructures. Our quantum hardware consists of semiconductor macroatoms driven by sequences of ultrafast laser pulses ({\it all optical control}). Our logical bits are Coulomb-correlated electron-hole pairs (excitons) in a four-level scheme selectively addressed by laser pulses with different polarization. A universal set of single and two-qubit gates is generated by adiabatic change of the Rabi frequencies of the lasers and by exploiting the dipole coupling between excitons.
Recent experiments have measured the signatures of the Kondo effect in the zero-field thermopower of strongly correlated quantum dots [Svilans {\em et al.,} Phys. Rev. Lett. {\bf 121}, 206801 (2018); Dutta {\em et al.,} Nano Lett. {\bf 19}, 506 (2019)]. They confirm the predicted Kondo-induced sign change in the thermopower, upon increasing the temperature through a gate-voltage dependent value $T_{1}\gtrsim T_{\rm K}$, where $T_{\rm K}$ is the Kondo temperature. Here, we use the numerical renormalization group (NRG) method to investigate the effect of a finite magnetic field $B$ on the thermo…
We propose a protocol for perfect quantum state transfer that is resilient to a broad class of realistic experimental imperfections, including noise sources that could be modelled either as independent Markovian baths or as certain forms of spatially correlated environments. We highlight interesting connections between the fidelity of state transfer and quantum stochastic resonance effects. The scheme is flexible enough to act as an effective entangling gate for the generation of genuine multipartite entanglement in a control-limited setting. Possible experimental implementations using superco…
We develop holographic quantum simulation techniques to prepare correlated electronic ground states in quantum matrix product state (qMPS) form, using far fewer qubits than the number of orbitals represented. Our approach starts with a holographic technique to prepare a compressed approximation to electronic mean-field ground-states, known as fermionic Gaussian matrix product states (GMPS), with a polynomial reduction in qubit- and (in select cases gate-) resources compared to existing techniques. Correlations are then introduced by augmenting the GMPS circuits in a variational technique which…
We study efficient quantum error correction schemes for the fully correlated channel on an $n$-qubit system with error operators that assume the form $σ_x^{\otimes n}$, $σ_y^{\otimes n}$, $σ_z^{\otimes n}$. Previous schemes are improved to facilitate implementation. In particular, when $n$ is odd and equals $2k+1$, we describe a quantum error correction scheme using one arbitrary qubit $σ$ to protect the data state $ρ$ in a $2k$-qubit system. The encoding operation $σ\otimes ρ\mapsto Φ(σ\otimes ρ)$ only requires $3k$ CNOT gates (each with one control bit and one target bit). After the encoded …
We discuss the realization of a universal set of ultrafast single- and two-qubit operations with superconducting quantum circuits and investigate the most relevant physical and technical limitations that arise when pushing for faster and faster gates. With the help of numerical optimization techniques, we establish a fundamental bound on the minimal gate time, which is determined independently of the qubit design solely by its nonlinearity. In addition, important practical restrictions arise from the finite qubit transition frequency and the limited bandwidth of the control pulses. We show tha…
We study the problem of finding the best approximate circuit that is the closest (in some pertinent metric) to a target circuit, and which satisfies a number of hardware constraints, like gate alphabet and connectivity. We look at the problem in the CNOT+rotation gate set from a mathematical programming standpoint, offering contributions both in terms of understanding the mathematics of the problem and its efficient solution. Among the results that we present, we are able to derive a 14-CNOT 4-qubit Toffoli decomposition from scratch, and show that the Quantum Shannon Decomposition can be comp…
We theoretically demonstrate a counter-intuitive phenomenon in optical interferometry with a thermal source: the emergence of second-order interference between two pairs of correlated optical paths even if the time delay imprinted by each path in one pair with respect to each path in the other pair is much larger than the source coherence time. This fundamental effect could be useful for experimental simulations of small-scale quantum circuits and of $100\%$-visibility correlations typical of entangled states of a large number of qubits, with possible applications in high-precision metrology a…
