Searcharxiv⌕ Search

arXiv subjects

Ruediger Schack

Publications and source records attributed to Ruediger Schack.

At least 37 records · Page 2Linked to original sources
arXiv2005

Classical predictability and coarse-grained evolution of the quantum baker's map

We investigate how classical predictability of the coarse-grained evolution of the quantum baker's map depends on the character of the coarse-graining. Our analysis extends earlier work by Brun and Hartle [Phys. Rev. D 60, 123503 (1999)] to the case of a chaotic map. To quantify predictability, we compare the rate of entropy increase for a family of coarse-grainings in the decoherent histories formalism. We find that the rate of entropy increase is dominated by the number of scales characterising the coarse-graining.

quant-ph↗
arXiv2004

Hypothesis elimination on a quantum computer

Hypothesis elimination is a special case of Bayesian updating, where each piece of new data rules out a set of prior hypotheses. We describe how to use Grover's algorithm to perform hypothesis elimination for a class of probability distributions encoded on a register of qubits, and establish a lower bound on the required computational resources.

quant-ph↗
arXiv2004

State preparation based on Grover's algorithm in the presence of global information about the state

In a previous paper [quant-ph/0408045] we described a quantum algorithm to prepare an arbitrary state of a quantum register with arbitrary fidelity. Here we present an alternative algorithm which uses a small number of quantum oracles encoding the most significant bits of the absolute value of the complex amplitudes, and a small number of oracles encoding the most significant bits of the phases. The algorithm given here is considerably simpler than the one described in [quant-ph/0408045], on the assumption that a sufficient amount of knowledge about the distribution of the absolute values of the complex amplitudes is available.

quant-ph↗
arXiv2004

A simple necessary decoherence condition for a set of histories

Within the decoherent histories formulation of quantum mechanics, we investigate necessary conditions for decoherence of arbitrarily long histories. We prove that fine-grained histories of arbitrary length decohere for all classical initial states if and only if the unitary evolution preserves classicality of states (using a natural formal definition of classicality). We give a counterexample showing that this equivalence does not hold for coarse-grained histories.

quant-ph↗
arXiv2003

A de Finetti Representation Theorem for Quantum Process Tomography

In quantum process tomography, it is possible to express the experimenter's prior information as a sequence of quantum operations, i.e., trace-preserving completely positive maps. In analogy to de Finetti's concept of exchangeability for probability distributions, we give a definition of exchangeability for sequences of quantum operations. We then state and prove a representation theorem for such exchangeable sequences. The theorem leads to a simple characterization of admissible priors for quantum process tomography and solves to a Bayesian's satisfaction the problem of an unknown quantum operation.

quant-ph↗
arXiv2003

Information dynamics in cavity QED

A common experimental setup in cavity quantum electrodynamics (QED) consists of a single two-level atom interacting with a single mode of the electromagnetic field inside an optical cavity. The cavity is externally driven and the output is continuously monitored via homodyne measurements. We derive formulas for the optimal rates at which these measurements provide information about (i) the quantum state of the system composed of atom and electromagnetic field, and (ii) the coupling strength between atom and field. We find that the two information rates are anticorrelated.

quant-ph↗
arXiv2002

Quantum theory from four of Hardy's axioms

In a recent paper [e-print quant-ph/0101012], Hardy has given a derivation of "quantum theory from five reasonable axioms." Here we show that Hardy's first axiom, which identifies probability with limiting frequency in an ensemble, is not necessary for his derivation. By reformulating Hardy's assumptions, and modifying a part of his proof, in terms of Bayesian probabilities, we show that his work can be easily reconciled with a Bayesian interpretation of quantum probability.

quant-ph↗
arXiv2002

Conditions for compatibility of quantum state assignments

Suppose N parties describe the state of a quantum system by N possibly different density operators. These N state assignments represent the beliefs of the parties about the system. We examine conditions for determining whether the N state assignments are compatible. We distinguish two kinds of procedures for assessing compatibility, the first based on the compatibility of the prior beliefs on which the N state assignments are based and the second based on the compatibility of predictive measurement probabilities they define. The first procedure leads to a compatibility criterion proposed by Brun, Finkelstein, and Mermin [BFM, Phys. Rev. A 65, 032315 (2002)]. The second procedure leads to a hierarchy of measurement-based compatibility criteria which is fundamentally different from the corresponding classical situation. Quantum mechanically none of the measurement-based compatibility criteria is equivalent to the BFM criterion.

quant-ph↗
arXiv2001

Quantum probabilities as Bayesian probabilities

In the Bayesian approach to probability theory, probability quantifies a degree of belief for a single trial, without any a priori connection to limiting frequencies. In this paper we show that, despite being prescribed by a fundamental law, probabilities for individual quantum systems can be understood within the Bayesian approach. We argue that the distinction between classical and quantum probabilities lies not in their definition, but in the nature of the information they encode. In the classical world, maximal information about a physical system is complete in the sense of providing definite answers for all possible questions that can be asked of the system. In the quantum world, maximal information is not complete and cannot be completed. Using this distinction, we show that any Bayesian probability assignment in quantum mechanics must have the form of the quantum probability rule, that maximal information about a quantum system leads to a unique quantum-state assignment, and that quantum theory provides a stronger connection between probability and measured frequency than can be justified classically. Finally we give a Bayesian formulation of quantum-state tomography.

quant-ph↗
arXiv2001

Decoherence and linear entropy increase in the quantum baker's map

We show that the coarse-grained quantum baker's map exhibits a linear entropy increase at an asymptotic rate given by the Kolmogorov-Sinai entropy of the classical chaotic baker's map. The starting point of our analysis is a symbolic representation of the map on a string of $N$ qubits, i.e., an $N$-bit register of a quantum computer. To coarse-grain the quantum evolution, we make use of the decoherent histories formalism. As a byproduct, we show that the condition of medium decoherence holds asymptotically for the coarse-grained quantum baker's map.

quant-ph↗
arXiv2001

Conditional evolution in single-atom cavity QED

We consider a typical setup of cavity QED consisting of a two-level atom interacting strongly with a single resonant electromagnetic field mode inside a cavity. The cavity is resonantly driven and the output undergoes continuous homodyne measurements. We derive an explicit expression for the state of the system conditional on a discrete photocount record. This expression takes a particularly simple form if the system is initially in the steady state. As a byproduct, we derive a general formula for the steady state that had been conjectured before in the strong driving limit.

quant-ph↗
arXiv2001

Unknown Quantum States: The Quantum de Finetti Representation

We present an elementary proof of the quantum de Finetti representation theorem, a quantum analogue of de Finetti's classical theorem on exchangeable probability assignments. This contrasts with the original proof of Hudson and Moody [Z. Wahrschein. verw. Geb. 33, 343 (1976)], which relies on advanced mathematics and does not share the same potential for generalization. The classical de Finetti theorem provides an operational definition of the concept of an unknown probability in Bayesian probability theory, where probabilities are taken to be degrees of belief instead of objective states of nature. The quantum de Finetti theorem, in a closely analogous fashion, deals with exchangeable density-operator assignments and provides an operational definition of the concept of an ``unknown quantum state'' in quantum-state tomography. This result is especially important for information-based interpretations of quantum mechanics, where quantum states, like probabilities, are taken to be states of knowledge rather than states of nature. We further demonstrate that the theorem fails for real Hilbert spaces and discuss the significance of this point.

quant-ph↗
arXiv2000

Entanglement purification of unknown quantum states

A concern has been expressed that ``the Jaynes principle can produce fake entanglement'' [R. Horodecki et al., Phys. Rev. A {\bf 59}, 1799 (1999)]. In this paper we discuss the general problem of distilling maximally entangled states from $N$ copies of a bipartite quantum system about which only partial information is known, for instance in the form of a given expectation value. We point out that there is indeed a problem with applying the Jaynes principle of maximum entropy to more than one copy of a system, but the nature of this problem is classical and was discussed extensively by Jaynes. Under the additional assumption that the state $ρ^{(N)}$ of the $N$ copies of the quantum system is exchangeable, one can write down a simple general expression for $ρ^{(N)}$. We show how to modify two standard entanglement purification protocols, one-way hashing and recurrence, so that they can be applied to exchangeable states. We thus give an explicit algorithm for distilling entanglement from an unknown or partially known quantum state.

quant-ph↗
arXiv2000

Quantum Bayes rule

We state a quantum version of Bayes's rule for statistical inference and give a simple general derivation within the framework of generalized measurements. The rule can be applied to measurements on N copies of a system if the initial state of the N copies is exchangeable. As an illustration, we apply the rule to N qubits. Finally, we show that quantum state estimates derived via the principle of maximum entropy are fundamentally different from those obtained via the quantum Bayes rule.

quant-ph↗
arXiv2000

Quantum authentication and key distribution using catalysis

Starting from Barnum's recent proposal to use entanglement and catalysis for quantum secure identification [quant-ph/9910072], we describe a protocol for quantum authentication and authenticated quantum key distribution. We argue that our scheme is secure even in the presence of an eavesdropper who has complete control over both classical and quantum channels.

quant-ph↗
arXiv2000

A Simple Algorithm for Local Conversion of Pure States

We describe an algorithm for converting one bipartite quantum state into another using only local operations and classical communication, which is much simpler than the original algorithm given by Nielsen [Phys. Rev. Lett. 83, 436 (1999)]. Our algorithm uses only a single measurement by one of the parties, followed by local unitary operations which are permutations in the local Schmidt bases.

quant-ph↗
arXiv2000

Preparation information and optimal decompositions for mixed quantum states

Consider a joint quantum state of a system and its environment. A measurement on the environment induces a decomposition of the system state. Using algorithmic information theory, we define the preparation information of a pure or mixed state in a given decomposition. We then define an optimal decomposition as a decomposition for which the average preparation information is minimal. The average preparation information for an optimal decomposition characterizes the system-environment correlations. We discuss properties and applications of the concepts introduced above and give several examples.

quant-ph↗