arXiv subjects

C. M. Caves

Publications and source records attributed to C. M. Caves.

12 recordsLinked to original sources

arXiv2017

Quantum Estimation of Parameters of Classical Spacetimes

We describe a quantum limit to measurement of classical spacetimes. Specifically, we formulate a quantum Cramer-Rao lower bound for estimating the single parameter in any one-parameter family of spacetime metrics. We employ the locally covariant formulation of quantum field theory in curved spacetime, which allows for a manifestly background-independent derivation. The result is an uncertainty relation that applies to all globally hyperbolic spacetimes. Among other examples, we apply our method to detection of gravitational waves using the electromagnetic field as a probe, as in laser-interferometric gravitational-wave detectors. Other applications are discussed, from terrestrial gravimetry to cosmology.

quant-ph↗

arXiv2012

Optimal Quantum Estimation for Gravitation

Here we describe the quantum limit to measurement of the classical gravitational field. Specifically, we write down the optimal quantum Cramer-Rao lower bound, for any single parameter describing a metric for spacetime. The standard time-energy and Heisenberg uncertainty relations are shown to be special cases of the uncertainty relation for the spacetime metric. Four key examples are given, describing quantum limited estimation for: acceleration, black holes, gravitational waves and cosmology. We employ the locally covariant formulation of quantum field theory in curved spacetime, which allows for a manifestly spacetime independent derivation. The result is an uncertainty relation applicable to all causal spacetime manifolds.

gr-qc↗

arXiv2000

Shifts on a finite qubit string: A class of quantum baker's maps

We present two complementary ways in which Saraceno's symmetric version of the quantum baker's map can be written as a shift map on a string of quantum bits. One of these representations leads naturally to a family of quantizations of the baker's map.

quant-ph↗

arXiv2000

Qudit Entanglement

We consider the separability of various joint states of D-dimensional quantum systems, which we call "qudits." We derive two main results: (i) the separability condition for a two-qudit state that is a mixture of the maximally mixed state and a maximally entangled state; (ii) lower and upper bounds on the size of the neighorhood of separable states surrounding the maximally mixed state for N qudits.

quant-ph↗

arXiv1999

Quantum Probability from Decision Theory?

In a recent paper (quant-ph/9906015), Deutsch claims to derive the "probabilistic predictions of quantum theory" from the "non-probabilistic axioms of quantum theory" and the "non-probabilistic part of classical decision theory." We show that his derivation fails because it includes hidden probabilistic assumptions.

quant-ph↗

arXiv1999

Explicit product ensembles for separable quantum states

We present a general method for constructing pure-product-state representations for density operators of $N$ quantum bits. If such a representation has nonnegative expansion coefficients, it provides an explicit separable ensemble for the density operator. We derive the condition for separability of a mixture of the Greenberger-Horne-Zeilinger state with the maximally mixed state.

quant-ph↗

arXiv1999

Classical model for bulk-ensemble NMR quantum computation

We present a classical model for bulk-ensemble NMR quantum computation: the quantum state of the NMR sample is described by a probability distribution over the orientations of classical tops, and quantum gates are described by classical transition probabilities. All NMR quantum computing experiments performed so far with three quantum bits can be accounted for in this classical model. After a few entangling gates, the classical model suffers an exponential decrease of the measured signal, whereas there is no corresponding decrease in the quantum description. We suggest that for small numbers of quantum bits, the quantum nature of NMR quantum computation lies in the ability to avoid an exponential signal decrease.

quant-ph↗

arXiv1998

Separability of very noisy mixed states and implications for NMR quantum computing

We give a constructive proof that all mixed states of N qubits in a sufficiently small neighborhood of the maximally mixed state are separable. The construction provides an explicit representation of any such state as a mixture of product states. We give upper and lower bounds on the size of the neighborhood, which show that its extent decreases exponentially with the number of qubits. We also discuss the implications of the bounds for NMR quantum computing.

quant-ph↗

arXiv1995

Noncommuting mixed states cannot be broadcast

We show that, given a general mixed state for a quantum system, there are no physical means for {\it broadcasting\/} that state onto two separate quantum systems, even when the state need only be reproduced marginally on the separate systems. This result generalizes and extends the standard no-cloning theorem for pure states.

quant-ph↗

arXiv1995

Information-theoretic characterization of quantum chaos

Hypersensitivity to perturbation is a criterion for chaos based on the question of how much information about a perturbing environment is needed to keep the entropy of a Hamiltonian system from increasing. We demonstrate numerically that hypersensitivity to perturbation is present in the following quantum maps: the quantum kicked top, the quantum baker's map, the quantum lazy baker's map, and the quantum sawtooth and cat maps.

chao-dyn↗

arXiv1995

Chaos for Liouville probability densities

Using the method of symbolic dynamics, we show that a large class of classical chaotic maps exhibit exponential hypersensitivity to perturbation, i.e., a rapid increase with time of the information needed to describe the perturbed time evolution of the Liouville density, the information attaining values that are exponentially larger than the entropy increase that results from averaging over the perturbation. The exponential rate of growth of the ratio of information to entropy is given by the Kolmogorov-Sinai entropy of the map. These findings generalize and extend results obtained for the baker's map [R. Schack and C. M. Caves, Phys. Rev. Lett. 69, 3413 (1992)].

chao-dyn↗

arXiv1993

Hypersensitivity to Perturbations in the Quantum Baker's Map

We analyze a randomly perturbed quantum version of the baker's transformation, a prototype of an area-conserving chaotic map. By numerically simulating the perturbed evolution, we estimate the information needed to follow a perturbed Hilbert-space vector in time. We find that the Landauer erasure cost associated with this information grows very rapidly and becomes much larger than the maximum statistical entropy given by the logarithm of the dimension of Hilbert space. The quantum baker's map thus displays a hypersensitivity to perturbations that is analogous to behavior found earlier in the classical case. This hypersensitivity characterizes ``quantum chaos'' in a way that is directly relevant to statistical physics.

chao-dyn↗