arXiv subjects

Robin Blume-Kohout

Publications and source records attributed to Robin Blume-Kohout.

At least 73 records · Page 4Linked to original sources

arXiv2016

Bayes estimator for multinomial parameters and Bhattacharyya distances

We derive the Bayes estimator for the parameters of a multinomial distribution under two loss functions ($1-B$ and $1-B^2$) that are based on the Bhattacharyya coefficient $B(\vec{p},\vec{q}) = \sum{\sqrt{p_kq_k}}$. We formulate a non-commutative generalization relevant to quantum probability theory as an open problem. As an example application, we use our solution to find minimax estimators for a binomial parameter under Bhattacharyya loss ($1-B^2$).

math.ST↗

arXiv2016

Optimization of a solid-state electron spin qubit using Gate Set Tomography

State of the art qubit systems are reaching the gate fidelities required for scalable quantum computation architectures. Further improvements in the fidelity of quantum gates demands characterization and benchmarking protocols that are efficient, reliable and extremely accurate. Ideally, a benchmarking protocol should also provide information on how to rectify residual errors. Gate Set Tomography (GST) is one such protocol designed to give detailed characterization of as-built qubits. We implemented GST on a high-fidelity electron-spin qubit confined by a single $^{31}$P atom in $^{28}$Si. The results reveal systematic errors that a randomized benchmarking analysis could measure but not identify, whereas GST indicated the need for improved calibration of the length of the control pulses. After introducing this modification, we measured a new benchmark average gate fidelity of $99.942(8)\%$, an improvement on the previous value of $99.90(2)\%$. Furthermore, GST revealed high levels of non-Markovian noise in the system, which will need to be understood and addressed when the qubit is used within a fault-tolerant quantum computation scheme.

cond-mat.mes-hall↗

arXiv2015

The Promise of Quantum Simulation

Quantum simulation promises to be one of the primary application of quantum computers, should one be constructed. This article briefly summarizes the history quantum simulation in light of the recent result of Wang and coworkers demonstrating calculation of the ground and excited states for a HeH+ molecule, and concludes with a discussion of why this and other recent progress in the field suggests that quantum simulation of quantum chemistry has a bright future.

quant-ph↗

arXiv2015

Minimax quantum tomography: the ultimate bounds on accuracy

A minimax estimator has the minimum possible error ("risk") in the worst case. We construct the first minimax estimators for quantum state tomography with relative entropy risk. The minimax risk of non-adaptive tomography scales as $O(1/\sqrt{N})$, in contrast to that of classical probability estimation which is $O(1/N)$. We trace this deficiency to sampling mismatch: future observations that determine risk may come from a different sample space than the past data that determine the estimate. This makes minimax estimators very biased, and we propose a computationally tractable alternative with similar behavior in the worst case, but superior accuracy on most states.

quant-ph↗

arXiv2014

Microwave-driven coherent operations of a semiconductor quantum dot charge qubit

A most intuitive realization of a qubit is a single electron charge sitting at two well-defined positions, such as the left and right sides of a double quantum dot. This qubit is not just simple but also has the potential for high-speed operation, because of the strong coupling of electric fields to the electron. However, charge noise also couples strongly to this qubit, resulting in rapid dephasing at nearly all operating points, with the exception of one special 'sweet spot'. Fast dc voltage pulses have been used to manipulate semiconductor charge qubits, but these previous experiments did not achieve high-fidelity control, because dc gating requires excursions away from the sweet spot. Here, by using resonant ac microwave driving, we achieve coherent manipulation of a semiconductor charge qubit, demonstrating a Rabi frequency of up to 2GHz, a value approaching the intrinsic qubit frequency of 4.5GHz. Z-axis rotations of the qubit are well-protected at the sweet spot, and by using ac gating, we demonstrate the same protection for rotations about arbitrary axes in the X-Y plane of the qubit Bloch sphere. We characterize operations on the qubit using two independent tomographic approaches: standard process tomography and a newly developed method known as gate set tomography. Both approaches show that this qubit can be operated with process fidelities greater than 86% with respect to a universal set of unitary single-qubit operations.

cond-mat.mes-hall↗

arXiv2014

On the Optimal Choice of Spin-Squeezed States for Detecting and Characterizing a Quantum Process

Quantum metrology uses quantum states with no classical counterpart to measure a physical quantity with extraordinary sensitivity or precision. Most metrology schemes measure a single parameter of a dynamical process by probing it with a specially designed quantum state. The success of such a scheme usually relies on the process belonging to a particular one-parameter family. If this assumption is violated, or if the goal is to measure more than one parameter, a different quantum state may perform better. In the most extreme case, we know nothing about the process and wish to learn everything. This requires quantum process tomography, which demands an informationally-complete set of probe states. It is very convenient if this set is group-covariant -- i.e., each element is generated by applying an element of the quantum system's natural symmetry group to a single fixed fiducial state. In this paper, we consider metrology with 2-photon ("biphoton") states, and report experimental studies of different states' sensitivity to small, unknown collective SU(2) rotations ("SU(2) jitter"). Maximally entangled N00N states are the most sensitive detectors of such a rotation, yet they are also among the worst at fully characterizing an a-priori unknown process. We identify (and confirm experimentally) the best SU(2)-covariant set for process tomography; these states are all less entangled than the N00N state, and are characterized by the fact that they form a 2-design.

quant-ph↗

arXiv2013

Adaptive quantum state tomography improves accuracy quadratically

We introduce a simple protocol for adaptive quantum state tomography, which reduces the worst-case infidelity between the estimate and the true state from $O(N^{-1/2})$ to $O(N^{-1})$. It uses a single adaptation step and just one extra measurement setting. In a linear optical qubit experiment, we demonstrate a full order of magnitude reduction in infidelity (from $0.1%$ to $0.01%$) for a modest number of samples ($N=3\times10^4$).

quant-ph↗

arXiv2013

Robust, self-consistent, closed-form tomography of quantum logic gates on a trapped ion qubit

We introduce and demonstrate experimentally: (1) a framework called "gate set tomography" (GST) for self-consistently characterizing an entire set of quantum logic gates on a black-box quantum device; (2) an explicit closed-form protocol for linear-inversion gate set tomography (LGST), whose reliability is independent of pathologies such as local maxima of the likelihood; and (3) a simple protocol for objectively scoring the accuracy of a tomographic estimate without reference to target gates, based on how well it predicts a set of testing experiments. We use gate set tomography to characterize a set of Clifford-generating gates on a single trapped-ion qubit, and compare the performance of (i) standard process tomography; (ii) linear gate set tomography; and (iii) maximum likelihood gate set tomography.

quant-ph↗

arXiv2013

Adiabatic quantum optimization with the wrong Hamiltonian

Analog models of quantum information processing, such as adiabatic quantum computation and analog quantum simulation, require the ability to subject a system to precisely specified Hamiltonians. Unfortunately, the hardware used to implement these Hamiltonians will be imperfect and limited in its precision. Even small perturbations and imprecisions can have profound effects on the nature of the ground state. Here we consider an imperfect implementation of adiabatic quantum optimization and show that, for a widely applicable random control noise model, quantum stabilizer encodings are able to reduce the effective noise magnitude and thus improve the likelihood of a successful computation or simulation. This reduction builds upon two design principles: summation of equivalent logical operators to increase the energy scale of the encoded optimization problem, and the inclusion of a penalty term comprising the sum of the code stabilizer elements. We illustrate our findings with an Ising ladder and show that classical repetition coding drastically increases the probability that the ground state of a perturbed model is decodable to that of the unperturbed model, while using only realistic two-body interaction. Finally, we note that the repetition encoding is a special case of quantum stabilizer encodings, and show that this in principle allows us to generalize our results to many types of analog quantum information processing, albeit at the expense of many-body interactions.

quant-ph↗

arXiv2013

Unification and limitations of error suppression techniques for adiabatic quantum computing

While adiabatic quantum computation (AQC) possesses some intrinsic robustness to noise, it is expected that a form of error control will be necessary for large scale computations. Error control ideas developed for circuit-model quantum computation do not transfer easily to the AQC model and to date there have been two main proposals to suppress errors during an AQC implementation: energy gap protection and dynamical decoupling. Here we show that these two methods are fundamentally related and may be analyzed within the same formalism. We analyze the effectiveness of such error suppression techniques and identify critical constraints on the performance of error suppression in AQC, suggesting that error suppression by itself is insufficient for fault-tolerant, large-scale AQC and that a form of error correction is needed. This manuscript has been superseded by the articles, "Error suppression and error correction in adiabatic quantum computation I: techniques and challenges," arXiv:1307.5893, and "Error suppression and error correction in adiabatic quantum computation II: non-equilibrium dynamics," arXiv:1307.5892.

quant-ph↗

arXiv2013

When quantum tomography goes wrong: drift of quantum sources and other errors

The principle behind quantum tomography is that a large set of observations -- many samples from a "quorum" of distinct observables -- can all be explained satisfactorily as measurements on a single underlying quantum state or process. Unfortunately, this principle may not hold. When it fails, any standard tomographic estimate should be viewed skeptically. Here we propose a simple way to test for this kind of failure using Akaike's Information Criterion (AIC). We point out that the application of this criterion in a quantum context, while still powerful, is not as straightforward as it is in classical physics. This is especially the case when future observables differ from those constituting the quorum.

quant-ph↗

arXiv2012

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↗

arXiv2012

Robust error bars for quantum tomography

In quantum tomography, a quantum state or process is estimated from the results of measurements on many identically prepared systems. Tomography can never identify the state or process exactly. Any point estimate is necessarily "wrong" -- at best, it will be close to the true state. Making rigorous, reliable statements about the system requires region estimates. In this article, I present a procedure for assigning likelihood ratio (LR) confidence regions, an elegant and powerful generalization of error bars. In particular, LR regions are almost optimally powerful -- i.e., they are as small as possible.

quant-ph↗

arXiv2012

Ideal state discrimination with an O(1)-qubit quantum computer

We show how to optimally discriminate between K distinct quantum states, of which N copies are available, using one-at-a-time interactions with each of the N copies. While this task (famously) requires joint measurements on all N copies, we show that it can be solved with one-at-a-time "coherent measurements" performed by an apparatus with log(K) qubits of quantum memory. We apply the same technique to optimal discrimination between K distinct N-particle matrix product states of bond dimension D, using a coherent measurement apparatus with log(K) + log(D) qubits of memory.

quant-ph↗

arXiv2012

Estimating the bias of a noisy coin

Optimal estimation of a coin's bias using noisy data is surprisingly different from the same problem with noiseless data. We study this problem using entropy risk to quantify estimators' accuracy. We generalize the "add Beta" estimators that work well for noiseless coins, and we find that these hedged maximum-likelihood (HML) estimators achieve a worst-case risk of O(N^{-1/2}) on noisy coins, in contrast to O(1/N) in the noiseless case. We demonstrate that this increased risk is unavoidable and intrinsic to noisy coins, by constructing minimax estimators (numerically). However, minimax estimators introduce extreme bias in return for slight improvements in the worst-case risk. So we introduce a pointwise lower bound on the minimum achievable risk as an alternative to the minimax criterion, and use this bound to show that HML estimators are pretty good. We conclude with a survey of scientific applications of the noisy coin model in social science, physical science, and quantum information science.

math.ST↗

arXiv2011

The curious nonexistence of Gaussian 2-designs

2-designs -- ensembles of quantum pure states whose 2nd moments equal those of the uniform Haar ensemble -- are optimal solutions for several tasks in quantum information science, especially state and process tomography. We show that Gaussian states cannot form a 2-design for the continuous-variable (quantum optical) Hilbert space L2(R). This is surprising because the affine symplectic group HWSp (the natural symmetry group of Gaussian states) is irreducible on the symmetric subspace of two copies. In finite dimensional Hilbert spaces, irreducibility guarantees that HWSp-covariant ensembles (such as mutually unbiased bases in prime dimensions) are always 2-designs. This property is violated by continuous variables, for a subtle reason: the (well-defined) HWSp-invariant ensemble of Gaussian states does not have an average state because the averaging integral does not converge. In fact, no Gaussian ensemble is even close (in a precise sense) to being a 2-design. This surprising difference between discrete and continuous quantum mechanics has important implications for optical state and process tomography.

quant-ph↗

arXiv2010

Information preserving structures: A general framework for quantum zero-error information

Quantum systems carry information. Quantum theory supports at least two distinct kinds of information (classical and quantum), and a variety of different ways to encode and preserve information in physical systems. A system's ability to carry information is constrained and defined by the noise in its dynamics. This paper introduces an operational framework, using information-preserving structures to classify all the kinds of information that can be perfectly (i.e., with zero error) preserved by quantum dynamics. We prove that every perfectly preserved code has the same structure as a matrix algebra, and that preserved information can always be corrected. We also classify distinct operational criteria for preservation (e.g., "noiseless", "unitarily correctible", etc.) and introduce two new and natural criteria for measurement-stabilized and unconditionally preserved codes. Finally, for several of these operational critera, we present efficient (polynomial in the state-space dimension) algorithms to find all of a channel's information-preserving structures.

quant-ph↗

arXiv2010

Entanglement verification with finite data

Suppose an experimentalist wishes to verify that his apparatus produces entangled quantum states. A finite amount of data cannot conclusively demonstrate entanglement, so drawing conclusions from real-world data requires statistical reasoning. We propose a reliable method to quantify the weight of evidence for (or against) entanglement, based on a likelihood ratio test. Our method is universal in that it can be applied to any sort of measurements. We demonstrate the method by applying it to two simulated experiments on two qubits. The first measures a single entanglement witness, while the second performs a tomographically complete measurement.

quant-ph↗