15 September 2021 in Physical Review X
Suppressing noise in physical systems is of fundamental importance. As quantum computers mature, quantum error correcting codes (QECs) will be adopted in order to suppress errors to any desired level. However in the noisy, intermediate-scale quantum (NISQ) era, the complexity and scale required to adopt even the smallest QEC is prohibitive: a single logical qubit needs to be encoded into many thousands of physical qubits. Here we show that, for the crucial case of estimating expectation values of observables (key to almost all NISQ algorithms) one can indeed achieve an effective exponential suppression. We take independently prepared circuit outputs to create a state whose symmetries prevent errors from contributing bias to the expected value. The approach is very well suited for current and near-term quantum devices as it is modular in the main computation and requires only a shallow circuit that bridges the copies immediately prior to measurement. Using no more than four circuit copies, we confirm error suppression below for circuits consisting of several hundred noisy gates (2-qubit gate error 0.5%) in numerical simulations validating our approach.
1 August 2020 in New Journal of Physics
Quantum technologies exploit entanglement to enhance various tasks beyond their classical limits including computation, communication and measurements. Quantum metrology aims to increase the precision of a measured quantity that is estimated in the presence of statistical errors using entangled quantum states. We present a novel approach for finding (near) optimal states for metrology in the presence of noise, using variational techniques as a tool for efficiently searching the high-dimensional space of quantum states, which would be classically intractable. We comprehensively explore systems consisting of up to 9 qubits and find new highly entangled states that are not symmetric under permutations and non-trivially outperform previously known states up to a constant factor 2. We consider a range of environmental noise models; while passive quantum states cannot achieve a fundamentally superior scaling (as established by prior asymptotic results) we do observe a significant absolute quantum advantage. We finally outline a possible experimental setup for variational quantum metrology which can be implemented in near-term hardware.
10 August 2021 in PRX Quantum
We consider metric-aware quantum algorithms that use a quantum computer to efficiently estimate both a matrix and a vector object. For example, the recently introduced quantum natural gradient approach uses the Fisher matrix as a metric tensor to correct the gradient vector for the codependence of the circuit parameters. We rigorously characterize and upper bound the number of measurements required to determine an iteration step to a fixed precision, and propose a general approach for optimally distributing samples between matrix and vector entries. Finally, we establish that the number of circuit repetitions needed for estimating the quantum Fisher information matrix is asymptotically negligible for an increasing number of iterations and qubits.
26 October 2022 in Physical Review Applied
Any architecture for practical quantum computing must be scalable. An attractive approach is to create multiple cores, computing regions of fixed size that are well spaced but interlinked with communication channels. This exploded architecture can relax the demands associated with a single monolithic device: the complexity of control, cooling and power infrastructure, as well as the difficulties of crosstalk suppression and near-perfect component yield. Here we explore interlinked multicore architectures through analytic and numerical modeling. While elements of our analysis are relevant to diverse platforms, our focus is on semiconductor electron spin systems in which numerous cores may exist on a single chip within a single fridge. We model shuttling and microwave-based interlinks and estimate the achievable fidelities, finding values that are encouraging but markedly inferior to intracore operations. We therefore introduce optimized entanglement purification to enable high-fidelity communication, finding that is a very realistic goal. We then assess the prospects for quantum advantage using such devices in the noisy intermediate-scale quantum era and beyond: we simulate recently proposed exponentially powerful error mitigation schemes in the multicore environment and conclude that these techniques impressively suppress imperfections in both the inter- and intracore operations.
1 December 2021 in New Journal of Physics
Although near-term quantum devices have no comprehensive solution for correcting errors, numerous techniques have been proposed for achieving practical value. Two works have recently introduced the very promising error suppression by derangements (ESD) and virtual distillation (VD) techniques. The approach exponentially suppresses errors and ultimately allows one to measure expectation values in the pure state as the dominant eigenvector of the noisy quantum state. Interestingly this dominant eigenvector is, however, different than the ideal computational state and it is the aim of the present work to comprehensively explore the following fundamental question: how significantly different are these two pure states? The motivation for this work is two-fold. First, comprehensively understanding the effect of this coherent mismatch is of fundamental importance for the successful exploitation of noisy quantum devices. As such, the present work rigorously establishes that in practically relevant scenarios the coherent mismatch is exponentially less severe than the incoherent decay of the fidelity—where the latter can be suppressed exponentially via the ESD/VD technique. Second, the above question is closely related to central problems in mathematics, such as bounding eigenvalues of a sum of two matrices (Weyl inequalities)—solving of which was a major breakthrough. The present work can be viewed as a first step towards extending the Weyl inequalities to eigenvectors of a sum of two matrices—and completely resolves this problem for the special case of the considered density matrices.
14 December 2022 in Physical Review A
Variational quantum algorithms are promising tools whose efficacy depends on their optimization method. For noise-free unitary circuits, the quantum generalization of natural gradient descent has been introduced and shown to be equivalent to imaginary time evolution: the approach is effective due to a metric tensor reconciling the classical parameter space to the device's Hilbert space. Here we generalize quantum natural gradient to consider arbitrary quantum states (both mixed and pure) via completely positive maps; thus our circuits can incorporate both imperfect unitary gates and fundamentally nonunitary operations such as measurements. We employ the quantum Fisher information (QFI) as the core metric in the space of density operators. A modification of the error suppression by derangements (ESD) and virtual distillation (VD) techniques enables an accurate and experimentally efficient approximation of the QFI via the Hilbert-Schmidt metric tensor using prior results on the dominant eigenvector of noisy quantum states. Our rigorous proof also establishes the fundamental observation that the geometry of typical noisy quantum states is (approximately) identical in either the Hilbert-Schmidt metric or as characterized by the QFI. In numerical simulations of noisy quantum circuits we demonstrate the practicality of our approach and confirm it can significantly outperform other variational techniques.