Psychological interventions for mental health disorders in children with chronic physical illness: a systematic review.

Children with chronic physical illness are significantly more likely to develop common psychiatric symptoms than otherwise healthy children. These children therefore warrant effective integrated healthcare yet it is not established whether the known, effective, psychological treatments for symptoms of common childhood mental health disorders work in children with chronic physical illness

Laser-like Instabilities in Quantum Nano-electromechanical Systems

We discuss negative damping regimes in quantum nano-electromechanical systems formed by coupling a mechanical oscillator to a single-electron transistor (normal or superconducting). Using an analogy to a laser with a tunable atom-field coupling, we demonstrate how these effects scale with system parameters. We also discuss the fluctuation physics of both the oscillator and the single-electron transistor in this regime, and the degree to which the oscillator motion is coherent.Comment: 4+ pages, 1 figure; reference to the work of Dykman and Krivoglaz adde

The quantum dynamic capacity formula of a quantum channel

The dynamic capacity theorem characterizes the reliable communication rates of a quantum channel when combined with the noiseless resources of classical communication, quantum communication, and entanglement. In prior work, we proved the converse part of this theorem by making contact with many previous results in the quantum Shannon theory literature. In this work, we prove the theorem with an "ab initio" approach, using only the most basic tools in the quantum information theorist's toolkit: the Alicki-Fannes' inequality, the chain rule for quantum mutual information, elementary properties of quantum entropy, and the quantum data processing inequality. The result is a simplified proof of the theorem that should be more accessible to those unfamiliar with the quantum Shannon theory literature. We also demonstrate that the "quantum dynamic capacity formula" characterizes the Pareto optimal trade-off surface for the full dynamic capacity region. Additivity of this formula simplifies the computation of the trade-off surface, and we prove that its additivity holds for the quantum Hadamard channels and the quantum erasure channel. We then determine exact expressions for and plot the dynamic capacity region of the quantum dephasing channel, an example from the Hadamard class, and the quantum erasure channel.Comment: 24 pages, 3 figures; v2 has improved structure and minor corrections; v3 has correction regarding the optimizatio

Factoring in a Dissipative Quantum Computer

We describe an array of quantum gates implementing Shor's algorithm for prime factorization in a quantum computer. The array includes a circuit for modular exponentiation with several subcomponents (such as controlled multipliers, adders, etc) which are described in terms of elementary Toffoli gates. We present a simple analysis of the impact of losses and decoherence on the performance of this quantum factoring circuit. For that purpose, we simulate a quantum computer which is running the program to factor N = 15 while interacting with a dissipative environment. As a consequence of this interaction randomly selected qubits may spontaneously decay. Using the results of our numerical simulations we analyze the efficiency of some simple error correction techniques.Comment: plain tex, 18 pages, 8 postscript figure

Purifying two-bit quantum gates and joint measurements in cavity QED

Using a cavity QED setup we show how to implement a particular joint measurement on two atoms in a fault tolerant way. Based on this scheme, we illustrate how to realize quantum communication over a noisy channel when local operations are subject to errors. We also present a scheme to perform and purify a universal two-bit gate.Comment: 4 pages RevTeX, 2 figures include

Optimal simulation of two-qubit Hamiltonians using general local operations

We consider the simulation of the dynamics of one nonlocal Hamiltonian by another, allowing arbitrary local resources but no entanglement nor classical communication. We characterize notions of simulation, and proceed to focus on deterministic simulation involving one copy of the system. More specifically, two otherwise isolated systems $A$ and $B$ interact by a nonlocal Hamiltonian $H \neq H_A+H_B$. We consider the achievable space of Hamiltonians $H'$ such that the evolution $e^{-iH't}$ can be simulated by the interaction $H$ interspersed with local operations. For any dimensions of $A$ and $B$, and any nonlocal Hamiltonians $H$ and $H'$, there exists a scale factor $s$ such that for all times $t$ the evolution $e^{-iH'st}$ can be simulated by $H$ acting for time $t$ interspersed with local operations. For 2-qubit Hamiltonians $H$ and $H'$, we calculate the optimal $s$ and give protocols achieving it. The optimal protocols do not require local ancillas, and can be understood geometrically in terms of a polyhedron defined by a partial order on the set of 2-qubit Hamiltonians.Comment: (1) References to related work, (2) protocol to simulate one two-qudit Hamiltonian with another, and (3) other related results added. Some proofs are simplifie

Spherical Code Key Distribution Protocols for Qubits

Recently spherical codes were introduced as potentially more capable ensembles for quantum key distribution. Here we develop specific key creation protocols for the two qubit-based spherical codes, the trine and tetrahedron, and analyze them in the context of a suitably-tailored intercept/resend attack, both in standard form, and a ``gentler'' version whose back-action on the quantum state is weaker. When compared to the standard unbiased basis protocols, BB84 and six-state, two distinct advantages are found. First, they offer improved tolerance of eavesdropping, the trine besting its counterpart BB84 and the tetrahedron the six-state protocol. Second, the key error rate may be computed from the sift rate of the protocol itself, removing the need to sacrifice key bits for this purpose. This simplifies the protocol and improves the overall key rate.Comment: 4 pages revtex, 2 figures; clarified security analysis. Final version for publicatio

A de Finetti representation theorem for infinite dimensional quantum systems and applications to quantum cryptography

According to the quantum de Finetti theorem, if the state of an N-partite system is invariant under permutations of the subsystems then it can be approximated by a state where almost all subsystems are identical copies of each other, provided N is sufficiently large compared to the dimension of the subsystems. The de Finetti theorem has various applications in physics and information theory, where it is for instance used to prove the security of quantum cryptographic schemes. Here, we extend de Finetti's theorem, showing that the approximation also holds for infinite dimensional systems, as long as the state satisfies certain experimentally verifiable conditions. This is relevant for applications such as quantum key distribution (QKD), where it is often hard - or even impossible - to bound the dimension of the information carriers (which may be corrupted by an adversary). In particular, our result can be applied to prove the security of QKD based on weak coherent states or Gaussian states against general attacks.Comment: 11 pages, LaTe

The Parity Bit in Quantum Cryptography

An $n$-bit string is encoded as a sequence of non-orthogonal quantum states. The parity bit of that $n$-bit string is described by one of two density matrices, $\rho_0^{(n)}$ and $\rho_1^{(n)}$, both in a Hilbert space of dimension $2^n$. In order to derive the parity bit the receiver must distinguish between the two density matrices, e.g., in terms of optimal mutual information. In this paper we find the measurement which provides the optimal mutual information about the parity bit and calculate that information. We prove that this information decreases exponentially with the length of the string in the case where the single bit states are almost fully overlapping. We believe this result will be useful in proving the ultimate security of quantum crytography in the presence of noise.Comment: 19 pages, RevTe