arXiv subjects

John A. Smolin

Publications and source records attributed to John A. Smolin.

At least 37 records · Page 2Linked to original sources

arXiv2013

Characterization of addressability by simultaneous randomized benchmarking

The control and handling of errors arising from cross-talk and unwanted interactions in multi-qubit systems is an important issue in quantum information processing architectures. We introduce a benchmarking protocol that provides information about the amount of addressability present in the system and implement it on coupled superconducting qubits. The protocol consists of randomized benchmarking each qubit individually and then simultaneously, and the amount of addressability is related to the difference of the average gate fidelities of those experiments. We present the results on two similar samples with different amounts of cross-talk and unwanted interactions, which agree with predictions based on simple models for the amount of residual coupling.

quant-ph↗

arXiv2012

Entanglement of two superconducting qubits in a waveguide cavity via monochromatic two-photon excitation

We report a system where fixed interactions between non-computational levels make bright the otherwise forbidden two-photon 00 --> 11 transition. The system is formed by hand selection and assembly of two discrete component transmon-style superconducting qubits inside a rectangular microwave cavity. The application of a monochromatic drive tuned to this transition induces two-photon Rabi-like oscillations between the ground and doubly-excited states via the Bell basis. The system therefore allows all-microwave two-qubit universal control with the same techniques and hardware required for single qubit control. We report Ramsey-like and spin echo sequences with the generated Bell states, and measure a two-qubit gate fidelity of 90% (unconstrained) and 86% (maximum likelihood estimator).

quant-ph↗

arXiv2012

Quantum Communications Made Easy: Deterministic Models of Bosonic Channels

Information theory establishes the ultimate limits on performance for noisy communication systems [Shannon48]. An accurate model of a physical communication device must include quantum effects, but typically including these makes the theory intractable. As a result communication capacities are not known, even for transmission between two users connected by an electromagnetic waveguide subject to gaussian noise. Here we present an exactly solvable model of communications with a fully quantum electromagnetic field. This allows us to find explicit expressions for all the point-to-point capacities of a noisy quantum channel, with implications for quantum key distribution, and fiber optical communications. We also develop a theory of quantum communication networks by solving some rudimentary quantum networks for broadcasting and multiple access. When possible, we compare the predictions of our new model with those of the orthodox quantum gaussian model and in all cases we find capacities in agreement to within a constant number of bits. Thus, in the limit of high signal to noise ratios our simple model captures the relevant physics of gaussian models while remaining amenable to detailed analysis,

quant-ph↗

arXiv2012

Process verification of two-qubit quantum gates by randomized benchmarking

We implement a complete randomized benchmarking protocol on a system of two superconducting qubits. The protocol consists of randomizing over gates in the Clifford group, which experimentally are generated via an improved two-qubit cross-resonance gate implementation and single-qubit unitaries. From this we extract an optimal average error per Clifford of 0.0936. We also perform an interleaved experiment, alternating our optimal two-qubit gate with random two-qubit Clifford gates, to obtain a two-qubit gate error of 0.0653. We compare these values with a two-qubit gate error of ~0.12 obtained from quantum process tomography, which is likely limited by state preparation and measurement errors.

quant-ph↗

arXiv2012

Self-Consistent Quantum Process Tomography

Quantum process tomography is a necessary tool for verifying quantum gates and diagnosing faults in architectures and gate design. We show that the standard approach of process tomography is grossly inaccurate in the case where the states and measurement operators used to interrogate the system are generated by gates that have some systematic error, a situation all but unavoidable in any practical setting. These errors in tomography can not be fully corrected through oversampling or by performing a larger set of experiments. We present an alternative method for tomography to reconstruct an entire library of gates in a self-consistent manner. The essential ingredient is to define a likelihood function that assumes nothing about the gates used for preparation and measurement. In order to make the resulting optimization tractable we linearize about the target, a reasonable approximation when benchmarking a quantum computer as opposed to probing a black-box function.

quant-ph↗

arXiv2012

Superconducting qubit in waveguide cavity with coherence time approaching 0.1ms

We report a superconducting artificial atom with an observed quantum coherence time of T2*=95us and energy relaxation time T1=70us. The system consists of a single Josephson junction transmon qubit embedded in an otherwise empty copper waveguide cavity whose lowest eigenmode is dispersively coupled to the qubit transition. We attribute the factor of four increase in the coherence quality factor relative to previous reports to device modifications aimed at reducing qubit dephasing from residual cavity photons. This simple device holds great promise as a robust and easily produced artificial quantum system whose intrinsic coherence properties are sufficient to allow tests of quantum error correction.

quant-ph↗

arXiv2012

Complete universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits

We use quantum process tomography to characterize a full universal set of all-microwave gates on two superconducting single-frequency single-junction transmon qubits. All extracted gate fidelities, including those for Clifford group generators, single-qubit pi/4 and pi/8 rotations, and a two-qubit controlled-NOT, exceed 95% (98%), without (with) accounting for state preparation and measurement errors. Furthermore, we introduce a process map representation in the Pauli basis which is visually efficient and informative. This high-fidelity gate set serves as another critical building block towards scalable architectures of superconducting qubits for error correction schemes.

quant-ph↗

arXiv2011

Nonlinear spectroscopy of superconducting anharmonic resonators

We formulate a model for the steady state response of a nonlinear quantum oscillator structure, such as those used in a variety of superconducting qubit experiments, when excited by a steady, but not necessarily small, ac tone. We show that this model can be derived directly from a circuit description of some recent qubit experiments in which the state of the qubit is read out directly, without a SQUID magnetometer. The excitation profile has a rich structure depending on the detuning of the tone from the small-signal resonant frequency, on the degree of damping, and on the excitation amplitude. We explore two regions in detail: First, at high damping there is a trough in the excitation response as a function of detuning, near where the classical Duffing bifurcation occurs. This trough has been understood as a classical interference between two metastable responses with opposite phase. We use Wigner function studies to show that while this picture is roughly correct, there are also more quantum mechanical aspects to this feature. Second, at low damping we study the emergence of sharp, discrete spectral features from a continuum response. We show that these the structures, associated with discrete transitions between different excited-state eigenstates of the oscillator, provide an interesting example of a quantum Fano resonance. The trough in the Fano response evolves continuously from the "classical" trough at high damping.

quant-ph↗

arXiv2011

Maximum Likelihood, Minimum Effort

We provide an efficient method for computing the maximum likelihood mixed quantum state (with density matrix $ρ$) given a set of measurement outcome in a complete orthonormal operator basis subject to Gaussian noise. Our method works by first changing basis yielding a candidate density matrix $μ$ which may have nonphysical (negative) eigenvalues, and then finding the nearest physical state under the 2-norm. Our algorithm takes at worst $O(d^4)$ for the basis change plus $O(d^3)$ for finding $ρ$ where $d$ is the dimension of the quantum state. In the special case where the measurement basis is strings of Pauli operators, the basis change takes only $O(d^3)$ as well. The workhorse of the algorithm is a new linear-time method for finding the closest probability distribution (in Euclidean distance) to a set of real numbers summing to one.

quant-ph↗

arXiv2011

Detecting Incapacity

Using unreliable or noisy components for reliable communication requires error correction. But which noise processes can support information transmission, and which are too destructive? For classical systems any channel whose output depends on its input has the capacity for communication, but the situation is substantially more complicated in the quantum setting. We find a generic test for incapacity based on any suitable forbidden transformation---a protocol for communication with a channel passing our test would also allow us to implement the associated forbidden transformation. Our approach includes both known quantum incapacity tests---positive partial transposition (PPT) and antidegradability (no cloning)---as special cases, putting them both on the same footing. We also find a physical principle explaining the nondistillability of PPT states: Any protocol for distilling entanglement from such a state would also give a protocol for implementing the forbidden time-reversal operation.

quant-ph↗

arXiv2011

A simple all-microwave entangling gate for fixed-frequency superconducting qubits

We demonstrate an all-microwave two-qubit gate on superconducting qubits which are fixed in frequency at optimal bias points. The gate requires no additional subcircuitry and is tunable via the amplitude of microwave irradiation on one qubit at the transition frequency of the other. We use the gate to generate entangled states with a maximal extracted concurrence of 0.88 and quantum process tomography reveals a gate fidelity of 81%.

quant-ph↗

arXiv2011

Gaussian bosonic synergy: quantum communication via realistic channels of zero quantum capacity

As with classical information, error-correcting codes enable reliable transmission of quantum information through noisy or lossy channels. In contrast to the classical theory, imperfect quantum channels exhibit a strong kind of synergy: there exist pairs of discrete memoryless quantum channels, each of zero quantum capacity, which acquire positive quantum capacity when used together. Here we show that this "superactivation" phenomenon also occurs in the more realistic setting of optical channels with attenuation and Gaussian noise. This paves the way for its experimental realization and application in real-world communications systems.

quant-ph↗

arXiv2009

Unextendible maximally entangled bases

We introduce the notion of the unextendible maximally entangled basis (UMEB), a set of orthonormal maximally entangled states in d \times d consisting of fewer that d^2 vectors which have no additional maximally entangled vectors orthogonal to all of them. We prove that UMEBs don't not exist for d=2 and give an explicit constructions for a 6-member UMEB with d=3 and a 12-member UMEB with d=4.

quant-ph↗

arXiv2009

Can closed timelike curves or nonlinear quantum mechanics improve quantum state discrimination or help solve hard problems?

We study the power of closed timelike curves (CTCs) and other nonlinear extensions of quantum mechanics for distinguishing nonorthogonal states and speeding up hard computations. If a CTC-assisted computer is presented with a labeled mixture of states to be distinguished--the most natural formulation--we show that the CTC is of no use. The apparent contradiction with recent claims that CTC-assisted computers can perfectly distinguish nonorthogonal states is resolved by noting that CTC-assisted evolution is nonlinear, so the output of such a computer on a mixture of inputs is not a convex combination of its output on the mixture's pure components. Similarly, it is not clear that CTC assistance or nonlinear evolution help solve hard problems if computation is defined as we recommend, as correctly evaluating a function on a labeled mixture of orthogonal inputs.

quant-ph↗

arXiv2009

Extensive nonadditivity of privacy

Quantum information theory establishes the ultimate limits on communication and cryptography in terms of channel capacities for various types of information. The private capacity is particularly important because it quantifies achievable rates of quantum key distribution. We study the power of quantum channels with limited private capacity, focusing on channels that dephase in random bases. These display extensive nonadditivity of private capacity: a channel with 2 log d input qubits has a private capacity less than 2, but when used together with a second channel with zero private capacity the joint capacity jumps to (1/2)log d. In contrast to earlier work which found nonadditivity vanishing as a fraction of input size or conditional on unproven mathematical assumptions, this provides a natural setting manifesting nonadditivity of privacy of the strongest possible sort.

quant-ph↗

arXiv2009

High performance single-error-correcting quantum codes for amplitude damping

We construct families of high performance quantum amplitude damping codes. All of our codes are nonadditive and most modestly outperform the best possible additive codes in terms of encoded dimension. One family is built from nonlinear error-correcting codes for classical asymmetric channels, with which we systematically construct quantum amplitude damping codes with parameters better than any prior construction known for any block length n > 7 except n=2^r-1. We generalize this construction to employ classical codes over GF(3) with which we numerically obtain better performing codes up to length 14. Because the resulting codes are of the codeword stabilized (CWS) type, easy encoding and decoding circuits are available.

quant-ph↗

arXiv2008

The quantum capacity with symmetric side channels

We present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have no capacity on their own. This family of assistance channels, which we call symmetric side channels, consists of all channels mapping symmetrically to their output and environment. The bound seems to be quite tight, and for degradable quantum channels it coincides with the unassisted channel capacity. Using this symmetric side channel capacity, we find new upper bounds on the capacity of the depolarizing channel. We also briefly indicate an analogous notion for distilling entanglement using the same class of (one-way) channels, yielding one of the few entanglement measures that is monotonic under local operations with one-way classical communication (1-LOCC), but not under the more general class of local operations with classical communication (LOCC).

quant-ph↗

arXiv2008

Structured Codes Improve the Bennett-Brassard-84 Quantum Key Rate

A central goal in information theory and cryptography is finding simple characterizations of optimal communication rates subject to various restrictions and security requirements. Ideally, the optimal key rate for a quantum key distribution (QKD) protocol would be given by {\em single-letter formula} involving a simple optimization over a single use of an effective channel. We explore the possibility of such a formula for one of the simplest and most widely used QKD protocols--Bennett-Brassard-84 (BB84) with one way classical post-processing. We show that a conjectured single-letter key-rate formula is false, uncovering a deep ignorance about asymptotically good private codes and pointing towards unfortunate complications in the theory of QKD. These complications are not without benefit--with added complexity comes better key rates than previously thought possible. We improve the threshold for secure key generation from a bit error rate of 0.124 to 0.129.

quant-ph↗