arXiv subjects

Marcus P. da Silva

Publications and source records attributed to Marcus P. da Silva.

31 records · Page 2Linked to original sources

arXiv2019

AC flux sweet spots in parametrically-modulated superconducting qubits

The ubiquitous presence of $1/f$ flux noise was a significant barrier to long-coherence in superconducting qubits until the development of qubits that could operate in static, flux noise insensitive configurations commonly referred to as `sweet-spots'. Several proposals for entangling gates in superconducting qubits tune the flux bias away from these spots, thus reintroducing the dephasing problem to varying degrees. Here we revisit one such proposal, where interactions are parametrically activated by rapidly modulating the flux bias of the qubits around these sweet-spots, and study the effect of modulation on the sensitivity to flux noise. We explicitly calculate how dephasing rates depend on different components of the flux-noise spectrum, and show that, while these parametric gates are insensitive to $1/f$ flux noise, dephasing rates are increased under modulation, and dominated by white noise. Remarkably, we find that simple filtering of the flux control signal allows for entangling gates to operate in a novel sweet-spot for dephasing under flux modulation. This sweet spot, which we dub the AC sweet spot, is insensitive to $1/f$ flux noise, and much less sensitive to white noise in the control electronics, allowing for interactions of quality that is limited only by higher order effects and other sources of noise.

quant-ph↗

arXiv2018

Analytical modeling of parametrically-modulated transmon qubits

Building a scalable quantum computer requires developing appropriate models to understand and verify its complex quantum dynamics. We focus on superconducting quantum processors based on transmons for which full numerical simulations are already challenging at the level of qubytes. It is thus highly desirable to develop accurate methods of modeling qubit networks that do not rely solely on numerical computations. Using systematic perturbation theory to large orders in the transmon regime, we derive precise analytic expressions of the transmon parameters. We apply our results to the case of parametrically-modulated transmons to study recently-implemented parametrically-activated entangling gates.

quant-ph↗

arXiv2016

Robust Extraction of Tomographic Information via Randomized Benchmarking

We describe how randomized benchmarking can be used to reconstruct the unital part of any trace-preserving quantum map, which in turn is sufficient for the full characterization of any unitary evolution, or more generally, any unital trace-preserving evolution. This approach inherits randomized benchmarking's robustness to preparation, measurement, and gate imperfections, therefore avoiding systematic errors caused by these imperfections. We also extend these techniques to efficiently estimate the average fidelity of a quantum map to unitary maps outside of the Clifford group. The unitaries we consider correspond to large circuits commonly used as building blocks to achieve scalable, universal, and fault-tolerant quantum computation. Hence, we can efficiently verify all such subcomponents of a circuit-based universal quantum computer. In addition, we rigorously bound the time and sampling complexities of randomized benchmarking procedures, proving that the required non-linear estimation problem can be solved efficiently.

quant-ph↗

arXiv2015

Demonstration of quantum advantage in machine learning

The main promise of quantum computing is to efficiently solve certain problems that are prohibitively expensive for a classical computer. Most problems with a proven quantum advantage involve the repeated use of a black box, or oracle, whose structure encodes the solution. One measure of the algorithmic performance is the query complexity, i.e., the scaling of the number of oracle calls needed to find the solution with a given probability. Few-qubit demonstrations of quantum algorithms, such as Deutsch-Jozsa and Grover, have been implemented across diverse physical systems such as nuclear magnetic resonance, trapped ions, optical systems, and superconducting circuits. However, at the small scale, these problems can already be solved classically with a few oracle queries, and the attainable quantum advantage is modest. Here we solve an oracle-based problem, known as learning parity with noise, using a five-qubit superconducting processor. Running classical and quantum algorithms on the same oracle, we observe a large gap in query count in favor of quantum processing. We find that this gap grows by orders of magnitude as a function of the error rates and the problem size. This result demonstrates that, while complex fault-tolerant architectures will be required for universal quantum computing, a quantum advantage already emerges in existing noisy systems

quant-ph↗

arXiv2015

Optimal Measurements for Symmetric Quantum States with Applications to Optical Communication

The minimum probability of error (MPE) measurement discriminates between a set of candidate quantum states with the minimum average error probability allowed by quantum mechanics. Conditions for a measurement to be MPE were derived by Yuen, Kennedy and Lax (YKL). MPE measurements have been found for states that form a single orbit under a group action, i.e., there is a transitive group action on the states in the set. For such state sets, termed geometrically uniform (GU) by Forney, it was shown that the `pretty good measurement' (PGM) attains the MPE. Even so, evaluating the actual probability of error (and other performance metrics) attained by the PGM on a GU set involves inverting large matrices, and is not easy in general. Our first contribution is a formula for the MPE and conditional probabilities of GU sets, using group representation theory. Next, we consider sets of pure states that have multiple orbits under the group action. Such states are termed compound geometrically uniform (CGU). MPE measurements for general CGU sets are not known. In this paper, we show how our representation-theoretic description of optimal measurements for GU sets naturally generalizes to the CGU case. We show how to compute the MPE measurement for CGU sets by reducing the problem to solving a few simultaneous equations. The number of equations depends on the sizes of the multiplicity space of irreducible representations. For many common group representations (such as those of several practical good linear codes), this is much more tractable than solving large semi-definite programs---which is what is needed to solve the YKL conditions numerically for arbitrary state sets. We show how to evaluate MPE measurements for CGU states for some examples relevant to quantum-limited classical optical communication.

quant-ph↗

arXiv2015

Demonstration of Robust Quantum Gate Tomography via Randomized Benchmarking

Typical quantum gate tomography protocols struggle with a self-consistency problem: the gate operation cannot be reconstructed without knowledge of the initial state and final measurement, but such knowledge cannot be obtained without well-characterized gates. A recently proposed technique, known as randomized benchmarking tomography (RBT), sidesteps this self-consistency problem by designing experiments to be insensitive to preparation and measurement imperfections. We implement this proposal in a superconducting qubit system, using a number of experimental improvements including implementing each of the elements of the Clifford group in single `atomic' pulses and custom control hardware to enable large overhead protocols. We show a robust reconstruction of several single-qubit quantum gates, including a unitary outside the Clifford group. We demonstrate that RBT yields physical gate reconstructions that are consistent with fidelities obtained by randomized benchmarking.

quant-ph↗

arXiv2014

Efficient measurement of quantum gate error by interleaved randomized benchmarking

We describe a scalable experimental protocol for obtaining estimates of the error rate of individual quantum computational gates. This protocol, in which random Clifford gates are interleaved between a gate of interest, provides a bounded estimate of the average error of the gate under test so long as the average variation of the noise affecting the full set of Clifford gates is small. This technique takes into account both state preparation and measurement errors and is scalable in the number of qubits. We apply this protocol to a superconducting qubit system and find gate errors that compare favorably with the gate errors extracted via quantum process tomography.

quant-ph↗

arXiv2013

Tomography via Correlation of Noisy Measurement Records

We present methods and results of shot-by-shot correlation of noisy measurements to extract entangled state and process tomography in a superconducting qubit architecture. We show that averaging continuous values, rather than counting discrete thresholded values, is a valid tomographic strategy and is in fact the better choice in the low signal-to-noise regime. We show that the effort to measure $N$-body correlations from individual measurements scales exponentially with $N$, but with sufficient signal-to-noise the approach remains viable for few-body correlations. We provide a new protocol to optimally account for the transient behavior of pulsed measurements. Despite single-shot measurement fidelity that is less than perfect, we demonstrate appropriate processing to extract and verify entangled states and processes.

quant-ph↗

arXiv2012

Achieving minimum-error discrimination of an arbitrary set of laser-light pulses

Laser light is widely used for communication and sensing applications, so the optimal discrimination of coherent states--the quantum states of light emitted by a laser--has immense practical importance. However, quantum mechanics imposes a fundamental limit on how well different coher- ent states can be distinguished, even with perfect detectors, and limits such discrimination to have a finite minimum probability of error. While conventional optical receivers lead to error rates well above this fundamental limit, Dolinar found an explicit receiver design involving optical feedback and photon counting that can achieve the minimum probability of error for discriminating any two given coherent states. The generalization of this construction to larger sets of coherent states has proven to be challenging, evidencing that there may be a limitation inherent to a linear-optics-based adaptive measurement strategy. In this Letter, we show how to achieve optimal discrimination of any set of coherent states using a resource-efficient quantum computer. Our construction leverages a recent result on discriminating multi-copy quantum hypotheses (arXiv:1201.6625) and properties of coherent states. Furthermore, our construction is reusable, composable, and applicable to designing quantum-limited processing of coherent-state signals to optimize any metric of choice. As illustrative examples, we analyze the performance of discriminating a ternary alphabet, and show how the quantum circuit of a receiver designed to discriminate a binary alphabet can be reused in discriminating multimode hypotheses. Finally, we show our result can be used to achieve the quantum limit on the rate of classical information transmission on a lossy optical channel, which is known to exceed the Shannon rate of all conventional optical receivers.

quant-ph↗

arXiv2012

First-order sidebands in circuit QED using qubit frequency modulation

Sideband transitions have been shown to generate controllable interaction between superconducting qubits and microwave resonators. Up to now, these transitions have been implemented with voltage drives on the qubit or the resonator, with the significant disadvantage that such implementations only lead to second-order sideband transitions. Here we propose an approach to achieve first-order sideband transitions by relying on controlled oscillations of the qubit frequency using a flux-bias line. Not only can first-order transitions be significantly faster, but the same technique can be employed to implement other tunable qubit-resonator and qubit-qubit interactions. We discuss in detail how such first-order sideband transitions can be used to implement a high fidelity controlled-NOT operation between two transmons coupled to the same resonator.

quant-ph↗

arXiv2011

Practical experimental certification of computational quantum gates via twirling

Due to the technical difficulty of building large quantum computers, it is important to be able to estimate how faithful a given implementation is to an ideal quantum computer. The common approach of completely characterizing the computation process via quantum process tomography requires an exponential amount of resources, and thus is not practical even for relatively small devices. We solve this problem by demonstrating that twirling experiments previously used to characterize the average fidelity of quantum memories efficiently can be easily adapted to estimate the average fidelity of the experimental implementation of important quantum computation processes, such as unitaries in the Clifford group, in a practical and efficient manner with applicability in current quantum devices. Using this procedure, we demonstrate state-of-the-art coherent control of an ensemble of magnetic moments of nuclear spins in a single crystal solid by implementing the encoding operation for a 3 qubit code with only a 1% degradation in average fidelity discounting preparation and measurement errors. We also highlight one of the advances that was instrumental in achieving such high fidelity control.

quant-ph↗

arXiv2011

Practical characterization of quantum devices without tomography

Quantum tomography is the main method used to assess the quality of quantum information processing devices, but its complexity presents a major obstacle for the characterization of even moderately large systems. The number of experimental settings required to extract complete information about a device grows exponentially with its size, and so does the running time for processing the data generated by these experiments. Part of the problem is that tomography generates much more information than is usually sought. Taking a more targeted approach, we develop schemes that enable (i) estimating the fidelity of an experiment to a theoretical ideal description, (ii) learning which description within a reduced subset best matches the experimental data. Both these approaches yield a significant reduction in resources compared to tomography. In particular, we demonstrate that fidelity can be estimated from a number of simple experimental settings that is independent of the system size, removing an important roadblock for the experimental study of larger quantum information processing units.

quant-ph↗

arXiv2010

Schemes for the observation of photon correlation functions in circuit QED with linear detectors

Correlations are important tools in the characterization of quantum fields. They can be used to describe statistical properties of the fields, such as bunching and anti-bunching, as well as to perform field state tomography. Here we analyse experiments by Bozyigit et al. [arXiv:1002.3738] where correlation functions can be observed using the measurement records of linear detectors (i.e. quadrature measurements), instead of relying on intensity or number detectors. We also describe how large amplitude noise introduced by these detectors can be quantified and subtracted from the data. This enables, in particular, the observation of first- and second-order coherence functions of microwave photon fields generated using circuit quantum-electrodynamics and propagating in superconducting transmission lines under the condition that noise is sufficiently low.

quant-ph↗