arXiv subjects

Robin Blume-Kohout

Publications and source records attributed to Robin Blume-Kohout.

86 records · Page 5Linked to original sources

arXiv2010

Hedged maximum likelihood estimation

This paper proposes and analyzes a new method for quantum state estimation, called hedged maximum likelihood (HMLE). HMLE is a quantum version of Lidstone's Law, also known as the "add beta" rule. A straightforward modification of maximum likelihood estimation (MLE), it can be used as a plugin replacement for MLE. The HMLE estimate is a strictly positive density matrix, slightly less likely than the ML estimate, but with much better behavior for predictive tasks. Single-qubit numerics indicate that HMLE beats MLE, according to several metrics, for nearly all "true" states. For nearly-pure states, MLE does slightly better, but neither method is optimal.

quant-ph↗

arXiv2009

Streaming universal distortion-free entanglement concentration

This paper presents a streaming (sequential) protocol for universal entanglement concentration at the Shannon bound. Alice and Bob begin with N identical (but unknown) two-qubit pure states, each containing E ebits of entanglement. They each run a reversible algorithm on their qubits, and end up with Y perfect EPR pairs, where Y = NE +- O(\sqrt N). Our protocol is streaming, so the N input systems are fed in one at a time, and perfect EPR pairs start popping out almost immediately. It matches the optimal block protocol exactly at each stage, so the average yield after n inputs is = nE - O(log n). So, somewhat surprisingly, there is no tradeoff between yield and lag -- our protocol optimizes both. In contrast, the optimal N-qubit block protocol achieves the same yield, but since no EPR pairs are produced until the entire input block is read, its lag is O(N). Finally, our algorithm runs in O(log N) space, so a lot of entanglement can be efficiently concentrated using a very small (e.g., current or near-future technology) quantum processor. Along the way, we find an optimal streaming protocol for extracting randomness from classical i.i.d. sources and a more space-efficient implementation of the Schur transform.

quant-ph↗

arXiv2007

The structure of preserved information in quantum processes

We introduce a general operational characterization of information-preserving structures (IPS) -- encompassing noiseless subsystems, decoherence-free subspaces, pointer bases, and error-correcting codes -- by demonstrating that they are isometric to fixed points of unital quantum processes. Using this, we show that every IPS is a matrix algebra. We further establish a structure theorem for the fixed states and observables of an arbitrary process, which unifies the Schrodinger and Heisenberg pictures, places restrictions on physically allowed kinds of information, and provides an efficient algorithm for finding all noiseless and unitarily noiseless subsystems of the process.

quant-ph↗

arXiv2007

Quantum Darwinism in quantum Brownian motion: the vacuum as a witness

We study quantum Darwinism -- the redundant recording of information about a decohering system by its environment -- in zero-temperature quantum Brownian motion. An initially nonlocal quantum state leaves a record whose redundancy increases rapidly with its spatial extent. Significant delocalization (e.g., a Schroedinger's Cat state) causes high redundancy: many observers can measure the system's position without perturbing it. This explains the objective (i.e. classical) existence of einselected, decoherence-resistant pointer states of macroscopic objects.

quant-ph↗

arXiv2006

Optimal, reliable estimation of quantum states

Accurately inferring the state of a quantum device from the results of measurements is a crucial task in building quantum information processing hardware. The predominant state estimation procedure, maximum likelihood estimation (MLE), generally reports an estimate with zero eigenvalues. These cannot be justified. Furthermore, the MLE estimate is incompatible with error bars, so conclusions drawn from it are suspect. I propose an alternative procedure, Bayesian mean estimation (BME). BME never yields zero eigenvalues, its eigenvalues provide a bound on their own uncertainties, and it is the most accurate procedure possible. I show how to implement BME numerically, and how to obtain natural error bars that are compatible with the estimate. Finally, I briefly discuss the differences between Bayesian and frequentist estimation techniques.

quant-ph↗

arXiv2006

Accurate quantum state estimation via "Keeping the experimentalist honest"

In this article, we derive a unique procedure for quantum state estimation from a simple, self-evident principle: an experimentalist's estimate of the quantum state generated by an apparatus should be constrained by honesty. A skeptical observer should subject the estimate to a test that guarantees that a self-interested experimentalist will report the true state as accurately as possible. We also find a non-asymptotic, operational interpretation of the quantum relative entropy function.

quant-ph↗

arXiv2005

Quantum Darwinism: Entanglement, branches, and the emergent classicality of redundantly stored quantum information

We lay a comprehensive foundation for the study of redundant information storage in decoherence processes. Redundancy has been proposed as a prerequisite for objectivity, the defining property of classical objects. We consider two ensembles of states for a model universe consisting of one system and many environments: the first consisting of arbitrary states, and the second consisting of ``singly-branching'' states consistent with a simple decoherence model. Typical states from the random ensemble do not store information about the system redundantly, but information stored in branching states has a redundancy proportional to the environment's size. We compute the specific redundancy for a wide range of model universes, and fit the results to a simple first-principles theory. Our results show that the presence of redundancy divides information about the system into three parts: classical (redundant); purely quantum; and the borderline, undifferentiated or ``nonredundant,'' information.

quant-ph↗

arXiv2004

A simple example of "Quantum Darwinism": Redundant information storage in many-spin environments

As quantum information science approaches the goal of constructing quantum computers, understanding loss of information through decoherence becomes increasingly important. The information about a system that can be obtained from its environment can facilitate quantum control and error correction. Moreover, observers gain most of their information indirectly, by monitoring (primarily photon) environments of the "objects of interest." Exactly how this information is inscribed in the environment is essential for the emergence of "the classical" from the quantum substrate. In this paper, we examine how many-qubit (or many-spin) environments can store information about a single system. The information lost to the environment can be stored redundantly, or it can be encoded in entangled modes of the environment. We go on to show that randomly chosen states of the environment almost always encode the information so that an observer must capture a majority of the environment to deduce the system's state. Conversely, in the states produced by a typical decoherence process, information about a particular observable of the system is stored redundantly. This selective proliferation of "the fittest information" (known as Quantum Darwinism) plays a key role in choosing the preferred, effectively classical observables of macroscopic systems. The developing appreciation that the environment functions not just as a garbage dump, but as a communication channel, is extending our understanding of the environment's role in the quantum-classical transition beyond the traditional paradigm of decoherence.

quant-ph↗

arXiv2003

Symmetric Informationally Complete Quantum Measurements

We consider the existence in arbitrary finite dimensions d of a POVM comprised of d^2 rank-one operators all of whose operator inner products are equal. Such a set is called a ``symmetric, informationally complete'' POVM (SIC-POVM) and is equivalent to a set of d^2 equiangular lines in C^d. SIC-POVMs are relevant for quantum state tomography, quantum cryptography, and foundational issues in quantum mechanics. We construct SIC-POVMs in dimensions two, three, and four. We further conjecture that a particular kind of group-covariant SIC-POVM exists in arbitrary dimensions, providing numerical results up to dimension 45 to bolster this claim.

quant-ph↗

arXiv2003

Exponential speed-up with a single bit of quantum information: Testing the quantum butterfly effect

We present an efficient quantum algorithm to measure the average fidelity decay of a quantum map under perturbation using a single bit of quantum information. Our algorithm scales only as the complexity of the map under investigation, so for those maps admitting an efficient gate decomposition, it provides an exponential speed up over known classical procedures. Fidelity decay is important in the study of complex dynamical systems, where it is conjectured to be a signature of quantum chaos. Our result also illustrates the role of chaos in the process of decoherence.

quant-ph↗

arXiv2003

Decoherence from a Chaotic Environment: An Upside Down "Oscillator" as a Model

Chaotic evolutions exhibit exponential sensitivity to initial conditions. This suggests that even very small perturbations resulting from weak coupling of a quantum chaotic environment to the position of a system whose state is a non-local superposition will lead to rapid decoherence. However, it is also known that quantum counterparts of classically chaotic systems lose exponential sensitivity to initial conditions, so this expectation of enhanced decoherence is by no means obvious. We analyze decoherence due to a "toy" quantum environment that is analytically solvable, yet displays the crucial phenomenon of exponential sensitivity to perturbations. We show that such an environment, with a single degree of freedom, can be far more effective at destroying quantum coherence than a heat bath with infinitely many degrees of freedom. This also means that the standard "quantum Brownian motion" model for a decohering environment may not be as universally applicable as it once was conjectured to be.

quant-ph↗

arXiv2003

Physical-resource demands for scalable quantum computation

The primary resource for quantum computation is Hilbert-space dimension. Whereas Hilbert space itself is an abstract construction, the number of dimensions available to a system is a physical quantity that requires physical resources. Avoiding a demand for an exponential amount of these resources places a fundamental constraint on the systems that are suitable for scalable quantum computation. To be scalable, the number of degrees of freedom in the computer must grow nearly linearly with the number of qubits in an equivalent qubit-based quantum computer.

quant-ph↗

arXiv2002

Climbing Mount Scalable: Physical-Resource Requirements for a Scalable Quantum Computer

The primary resource for quantum computation is Hilbert-space dimension. Whereas Hilbert space itself is an abstract construction, the number of dimensions available to a system is a physical quantity that requires physical resources. Avoiding a demand for an exponential amount of these resources places a fundamental constraint on the systems that are suitable for scalable quantum computation. To be scalable, the effective number of degrees of freedom in the computer must grow nearly linearly with the number of qubits in an equivalent qubit-based quantum computer.

quant-ph↗

arXiv2002

Compatibility of quantum states

We introduce a measure of the compatibility between quantum states--the likelihood that two density matrices describe the same object. Our measure is motivated by two elementary requirements, which lead to a natural definition. We list some properties of this measure, and discuss its relation to the problem of combining two observers' states of knowledge.

quant-ph↗