arXiv subjects

Carlton M. Caves

Publications and source records attributed to Carlton M. Caves.

At least 73 records · Page 4Linked to original sources

arXiv2005

Entanglement and the Power of One Qubit

The "Power of One Qubit" refers to a computational model that has access to only one pure bit of quantum information, along with n qubits in the totally mixed state. This model, though not as powerful as a pure-state quantum computer, is capable of performing some computational tasks exponentially faster than any known classical algorithm. One such task is to estimate with fixed accuracy the normalized trace of a unitary operator that can be implemented efficiently in a quantum circuit. We show that circuits of this type generally lead to entangled states, and we investigate the amount of entanglement possible in such circuits, as measured by the multiplicative negativity. We show that the multiplicative negativity is bounded by a constant, independent of n, for all bipartite divisions of the n+1 qubits, and so becomes, when n is large, a vanishingly small fraction of the maximum possible multiplicative negativity for roughly equal divisions. This suggests that the global nature of entanglement is a more important resource for quantum computation than the magnitude of the entanglement.

quant-ph↗

arXiv2005

Optimal classical-communication-assisted local model of n-qubit Greenberger-Horne-Zeilinger correlations

We present a model, motivated by the criterion of reality put forward by Einstein, Podolsky, and Rosen and supplemented by classical communication, which correctly reproduces the quantum-mechanical predictions for measurements of all products of Pauli operators on an n-qubit GHZ state (or ``cat state''). The n-2 bits employed by our model are shown to be optimal for the allowed set of measurements, demonstrating that the required communication overhead scales linearly with n. We formulate a connection between the generation of the local values utilized by our model and the stabilizer formalism, which leads us to conjecture that a generalization of this method will shed light on the content of the Gottesman-Knill theorem.

quant-ph↗

arXiv2004

Fidelity of Gaussian channels

A noisy Gaussian channel is defined as a channel in which an input field mode is subjected to random Gaussian displacements in phase space. We introduce the quantum fidelity of a Gaussian channel for pure and mixed input states, and we derive a universal scaling law of the fidelity for pure initial states. We also find the maximum fidelity of a Gaussian channel over all input states. Quantum cloning and continuous-variable teleportation are presented as physical examples of Gaussian channels to which the fidelity results can be applied.

quant-ph↗

arXiv2004

Efficient classical-communication-assisted local simulation of n-qubit GHZ correlations

We present a local hidden-variable model supplemented by classical communication that reproduces the quantum-mechanical predictions for measurements of all products of Pauli operators on an n-qubit GHZ state (or "cat state"). The simulation is efficient since the required amount of communication scales linearly with the number of qubits, even though there are Bell-type inequalities for these states for which the amount of violation grows exponentially with n. The structure of our model yields insight into the Gottesman-Knill theorem by demonstrating that, at least in this limited case, the correlations in the set of nonlocal hidden variables represented by the stabilizer generators are captured by an appropriate set of local hidden variables augmented by n-2 bits of classical communication.

quant-ph↗

arXiv2004

Classical phase-space descriptions of continuous-variable teleportation

The nonnegative Wigner function of all quantum states involved in teleportation of Gaussian states using the standard continuous-variable teleportation protocol means that there is a local realistic phase-space description of the process. This includes the coherent states teleported up to now in experiments. We extend the phase-space description to teleportation of non-Gaussian states using the standard protocol and conclude that teleportation of non-Gaussian states with fidelity of 2/3 is a "gold standard" for this kind of teleportation.

quant-ph↗

arXiv2004

Minimal Informationally Complete Measurements for Pure States

We consider measurements, described by a positive-operator-valued measure (POVM), whose outcome probabilities determine an arbitrary pure state of a D-dimensional quantum system. We call such a measurement a pure-state informationally complete (PSI-complete) POVM. We show that a measurement with 2D-1 outcomes cannot be PSI-complete, and then we construct a POVM with 2D outcomes that suffices, thus showing that a minimal PSI-complete POVM has 2D outcomes. We also consider PSI-complete POVMs that have only rank-one POVM elements and construct an example with 3D-2 outcomes, which is a generalization of the tetrahedral measurement for a qubit. The question of the minimal number of elements in a rank-one PSI-complete POVM is left open.

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

Entangling power of the quantum baker's map

We investigate entanglement production in a class of quantum baker's maps. The dynamics of these maps is constructed using strings of qubits, providing a natural tensor-product structure for application of various entanglement measures. We find that, in general, the quantum baker's maps are good at generating entanglement, producing multipartite entanglement amongst the qubits close to that expected in random states. We investigate the evolution of several entanglement measures: the subsystem linear entropy, the concurrence to characterize entanglement between pairs of qubits, and two proposals for a measure of multipartite entanglement. Also derived are some new analytical formulae describing the levels of entanglement expected in random pure states.

quant-ph↗

arXiv2003

Gleason-Type Derivations of the Quantum Probability Rule for Generalized Measurements

We prove a Gleason-type theorem for the quantum probability rule using frame functions defined on positive-operator-valued measures (POVMs), as opposed to the restricted class of orthogonal projection-valued measures used in the original theorem. The advantage of this method is that it works for two-dimensional quantum systems (qubits) and even for vector spaces over rational fields--settings where the standard theorem fails. Furthermore, unlike the method necessary for proving the original result, the present one is rather elementary. In the case of a qubit, we investigate similar results for frame functions defined upon various restricted classes of POVMs. For the so-called trine measurements, the standard quantum probability rule is again recovered.

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

I-concurrence and tangle for isotropic states

We discuss properties of entanglement measures called I-concurrence and tangle. For a bipartite pure state, I-concurrence and tangle are simply related to the purity of the marginal density operators. The I-concurrence (tangle) of a bipartite mixed state is the minimum average I-concurrence (tangle) of ensemble decompositions of pure states of the joint density operator. Terhal and Vollbrecht [Phys. Rev. Lett. 85, 2625 (2000)] have given an explicit formula for the entanglement of formation of isotropic states in arbitrary dimensions. We use their formalism to derive comparable expressions for the I-concurrence and tangle of isotropic states.

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

Local Realistic Model for the Dynamics of Bulk-Ensemble NMR Information Processing

We construct a local realistic hidden-variable model that describes the states and dynamics of bulk-ensemble NMR information processing up to about 12 nuclear spins. The existence of such a model rules out violation of any Bell inequality, temporal or otherwise, in present high-temperature, liquid-state NMR experiments. The model does not provide an efficient description in that the number of hidden variables grows exponentially with the number of nuclear spins.

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

Universal state inversion and concurrence in arbitrary dimensions

Wootters [Phys. Rev. Lett. 80, 2245 (1998)] has given an explicit formula for the entanglement of formation of two qubits in terms of what he calls the concurrence of the joint density operator. Wootters's concurrence is defined with the help of the superoperator that flips the spin of a qubit. We generalize the spin-flip superoperator to a "universal inverter," which acts on quantum systems of arbitrary dimension, and we introduce the corresponding concurrence for joint pure states of (D1 X D2) bipartite quantum systems. The universal inverter, which is a positive, but not completely positive superoperator, is closely related to the completely positive universal-NOT superoperator, the quantum analogue of a classical NOT gate. We present a physical realization of the universal-NOT superoperator.

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↗