Searcharxiv⌕ Search

arXiv subjects

Easwar Magesan

Publications and source records attributed to Easwar Magesan.

29 records · Page 2Linked to original sources

Implementing a strand of a scalable fault-tolerant quantum computing fabric

Quantum error correction (QEC) is an essential step towards realising scalable quantum computers. Theoretically, it is possible to achieve arbitrarily long protection of quantum information from corruption due to decoherence or imperfect controls, so long as the error rate is below a threshold value. The two-dimensional surface code (SC) is a fault-tolerant error correction protocol} that has garnered considerable attention for actual physical implementations, due to relatively high error thresholds ~1%, and restriction to planar lattices with nearest-neighbour interactions. Here we show a necessary element for SC error correction: high-fidelity parity detection of two code qubits via measurement of a third syndrome qubit. The experiment is performed on a sub-section of the SC lattice with three superconducting transmon qubits, in which two independent outer code qubits are joined to a central syndrome qubit via two linking bus resonators. With all-microwave high-fidelity single- and two-qubit nearest-neighbour entangling gates, we demonstrate entanglement distributed across the entire sub-section by generating a three-qubit Greenberger-Horne-Zeilinger (GHZ) state with fidelity ~94%. Then, via high-fidelity measurement of the syndrome qubit, we deterministically entangle the otherwise un-coupled outer code qubits, in either an even or odd parity Bell state, conditioned on the syndrome state. Finally, to fully characterize this parity readout, we develop a new measurement tomography protocol to obtain a fidelity metric (90% and 91%). Our results reveal a straightforward path for expanding superconducting circuits towards larger networks for the SC and eventually a primitive logical qubit implementation.

quant-ph↗

Investigating the limits of randomized benchmarking protocols

In this paper, we analyze the performance of randomized benchmarking protocols on gate sets under a variety of realistic error models that include systematic rotations, amplitude damping, leakage to higher levels, and 1/f noise. We find that, in almost all cases, benchmarking provides better than a factor-of-two estimate of average error rate, suggesting that randomized benchmarking protocols are a valuable tool for verification and validation of quantum operations. In addition, we derive new models for fidelity decay curves under certain types of non-Markovian noise models such as 1/f and leakage errors. We also show that, provided the standard error of the fidelity measurements is small, only a small number of trials are required for high confidence estimation of gate errors.

quant-ph↗

Experimentally efficient methods for estimating the performance of quantum measurements

Efficient methods for characterizing the performance of quantum measurements are important in the experimental quantum sciences. Ideally, one requires both a physically relevant distinguishability measure between measurement operations and a well-defined experimental procedure for estimating the distinguishability measure. Here, we propose the average measurement fidelity and error between quantum measurements as distinguishability measures. We present protocols for obtaining bounds on these quantities that are both estimable using experimentally accessible quantities and scalable in the size of the quantum system. We explain why the bounds should be valid in large generality and illustrate the method via numerical examples.

quant-ph↗

Compressing measurements in quantum dynamic parameter estimation

We present methods that can provide an exponential savings in the resources required to perform dynamic parameter estimation using quantum systems. The key idea is to merge classical compressive sensing techniques with quantum control methods to efficiently estimate time-dependent parameters in the system Hamiltonian. We show that incoherent measurement bases and, more generally, suitable random measurement matrices can be created by performing simple control sequences on the quantum system. Since random measurement matrices satisfying the restricted isometry property can be used to reconstruct any sparse signal in an efficient manner, and many physical processes are approximately sparse in some basis, these methods can potentially be useful in a variety of applications such as quantum sensing and magnetometry. We illustrate the theoretical results throughout the presentation with various practically relevant numerical examples.

quant-ph↗

Reconstructing the Profile of Time-Varying Magnetic Fields With Quantum Sensors

Quantum systems have shown great promise for precision metrology thanks to advances in their control. This has allowed not only the sensitive estimation of external parameters but also the reconstruction of their temporal profile. In particular, quantum control techniques and orthogonal function theory have been applied to the reconstruction of the complete profiles of time-varying magnetic fields. Here, we provide a detailed theoretical analysis of the reconstruction method based on the Walsh functions, highlighting the relationship between the orthonormal Walsh basis, sensitivity of field reconstructions, data compression techniques, and dynamical decoupling theory. Specifically, we show how properties of the Walsh basis and a detailed sensitivity analysis of the reconstruction protocol provide a method to characterize the error between the reconstructed and true fields. In addition, we prove various results about the negligibility function on binary sequences which lead to data compression techniques in the Walsh basis and a more resource-efficient reconstruction protocol. The negligibility proves a fruitful concept to unify the information content of Walsh functions and their dynamical decoupling power, which makes the reconstruction method robust against noise.

quant-ph↗

Modeling quantum noise for efficient testing of fault-tolerant circuits

Understanding fault-tolerant properties of quantum circuits is important for the design of large-scale quantum information processors. In particular, simulating properties of encoded circuits is a crucial tool for investigating the relationships between the noise model, encoding scheme, and threshold value. For general circuits and noise models, these simulations quickly become intractable in the size of the encoded circuit. We introduce methods for approximating a noise process by one which allows for efficient Monte Carlo simulation of properties of encoded circuits. The approximations are as close to the original process as possible without overestimating their ability to preserve quantum information, a key property for obtaining more honest estimates of threshold values. We numerically illustrate the method with various physically relevant noise models.

quant-ph↗

Gate fidelity fluctuations and quantum process invariants

We characterize the quantum gate fidelity in a state-independent manner by giving an explicit expression for its variance. The method we provide can be extended to calculate all higher order moments of the gate fidelity. Using these results we obtain a simple expression for the variance of a single qubit system and deduce the asymptotic behavior for large-dimensional quantum systems. Applications of these results to quantum chaos and randomized benchmarking are discussed.

quant-ph↗

Characterizing Quantum Gates via Randomized Benchmarking

We describe and expand upon the scalable randomized benchmarking protocol proposed in Phys. Rev. Lett. 106, 180504 (2011) which provides a method for benchmarking quantum gates and estimating the gate-dependence of the noise. The protocol allows the noise to have weak time and gate-dependence, and we provide a sufficient condition for the applicability of the protocol in terms of the average variation of the noise. We discuss how state preparation and measurement errors are taken into account and provide a complete proof of the scalability of the protocol. We establish a connection in special cases between the error rate provided by this protocol and the error strength measured using the diamond norm distance.

quant-ph↗

Depolarizing behavior of quantum channels in higher dimensions

The paper analyzes the behavior of quantum channels, particularly in large dimensions, by proving various properties of the quantum gate fidelity. Many of these properties are of independent interest in the theory of distance measures on quantum operations. A non-uniqueness result for the gate fidelity is proven, a consequence of which is the existence of non-depolarizing channels that produce a constant gate fidelity on pure states. Asymptotically, the gate fidelity associated with any quantum channel is shown to converge to that of a depolarizing channel. Methods for estimating the minimum of the gate fidelity are also presented.

quant-ph↗

Robust randomized benchmarking of quantum processes

We describe a simple randomized benchmarking protocol for quantum information processors and obtain a sequence of models for the observable fidelity decay as a function of a perturbative expansion of the errors. We are able to prove that the protocol provides an efficient and reliable estimate of an average error-rate for a set operations (gates) under a general noise model that allows for both time and gate-dependent errors. We determine the conditions under which this estimate remains valid and illustrate the protocol through numerical examples.

quant-ph↗

Experimentally scalable protocol for identification of correctable codes

The task of finding a correctable encoding that protects against some physical quantum process is in general hard. Two main obstacles are that an exponential number of experiments are needed to gain complete information about the quantum process, and known algorithmic methods for finding correctable encodings involve operations on exponentially large matrices. However, we show that in some cases it is possible to find such encodings with only partial information about the quantum process. Such useful partial information can be systematically extracted by averaging the channel under the action of a set of unitaries in a process known as "twirling". In this paper we prove that correctable encodings for a twirled channel are also correctable for the original channel. We investigate the particular case of twirling over the set of Pauli operators and qubit permutations, and show that the resulting quantum operation can be characterized experimentally in a scalable manner. We also provide a postprocessing scheme for finding unitarily correctable codes for these twirled channels which does not involve exponentially large matrices.

quant-ph↗