arXiv subjects

Earl T. Campbell

Publications and source records attributed to Earl T. Campbell.

65 records · Page 4Linked to original sources

arXiv2011

Catalysis and activation of magic states in fault tolerant architectures

In many architectures for fault tolerant quantum computing universality is achieved by a combination of Clifford group unitary operators and preparation of suitable nonstabilizer states, the so-called magic states. Universality is possible even for some fairly noisy nonstabilizer states, as distillation can convert many noisy copies into fewer purer magic states. Here we propose novel protocols that exploit multiple species of magic states in surprising ways. These protocols provide examples of previously unobserved phenomena that are analogous to catalysis and activation well known in entanglement theory.

quant-ph↗

arXiv2011

Non-adaptive Measurement-based Quantum Computation and Multi-party Bell Inequalities

Quantum correlations exhibit behaviour that cannot be resolved with a local hidden variable picture of the world. In quantum information, they are also used as resources for information processing tasks, such as Measurement-based Quantum Computation (MQC). In MQC, universal quantum computation can be achieved via adaptive measurements on a suitable entangled resource state. In this paper, we look at a version of MQC in which we remove the adaptivity of measurements and aim to understand what computational abilities still remain in the resource. We show that there are explicit connections between this model of computation and the question of non-classicality in quantum correlations. We demonstrate this by focussing on deterministic computation of Boolean functions, in which natural generalisations of the Greenberger-Horne-Zeilinger (GHZ) paradox emerge; we then explore probabilistic computation, via which multipartite Bell Inequalities can be defined. We use this correspondence to define families of multi-party Bell inequalities, which we show to have a number of interesting contrasting properties.

quant-ph↗

arXiv2010

Optimal Entangling Capacity of Dynamical Processes

We investigate the entangling capacity of dynamical operations when provided with local ancilla. A comparison is made between the entangling capacity with and without the assistance of prior entanglement. An analytic solution is found for the log-negativity entangling capacity of two-qubit gates, which equals the entanglement of the Choi matrix isomorphic to the unitary operator. Surprisingly, the availability of prior entanglement does not affect this result; a property we call resource independence of the entangling capacity. We prove several useful upper-bounds on the entangling capacity that hold for general qudit dynamical operations, and for a whole family of entanglement monotones including log-negativity and log-robustness. The log-robustness entangling capacity is shown to be resource independent for general dynamics. We provide numerical results supporting a conjecture that the log-negativity entangling capacity is resource independence for all two-qudit unitaries.

quant-ph↗

arXiv2010

Bound States for Magic State Distillation in Fault-Tolerant Quantum Computation

Magic state distillation is an important primitive in fault-tolerant quantum computation. The magic states are pure non-stabilizer states which can be distilled from certain mixed non-stabilizer states via Clifford group operations alone. Because of the Gottesman-Knill theorem, mixtures of Pauli eigenstates are not expected to be magic state distillable, but it has been an open question whether all mixed states outside this set may be distilled. In this Letter we show that, when resources are finitely limited, non-distillable states exist outside the stabilizer octahedron. In analogy with the bound entangled states, which arise in entanglement theory, we call such states bound states for magic state distillation.

quant-ph↗

arXiv2009

How to exploit local information when distilling entanglement

Distillation protocols enable generation of high quality entanglement even in the presence of noise. Existing protocols ignore the presence of local information in mixed states produced from some noise sources such as photon loss, amplitude damping or thermalization. We propose new protocols that exploit local information in mixed states. Our protocols converge to higher fidelities in fewer rounds, and when local information is significant one of our protocols consistently improves yields by 10 fold or more. We demonstrate that our protocols can be compacted into an entanglement-pumping scheme, allowing quantum computation in distributed systems with a few qubits per location.

quant-ph↗

arXiv2009

An introduction to one-way quantum computing in distributed architectures

This review provides a gentle introduction to one-way quantum computing in distributed architectures. One-way quantum computation shows significant promise as a computational model for distributed systems, particularly those architectures which rely on probabilistic entangling operations. We review the theoretical underpinnings of one-way quantum computation and discuss the practical issues related to exploiting the one-way model in distributed architectures.

quant-ph↗

arXiv2009

On the Structure of Protocols for Magic State Distillation

We present a theorem that shows that all useful protocols for magic state distillation output states with a fidelity that is upper-bounded by those generated by a much smaller class of protocols. This reduced class consists of the protocols where multiple copies of a state are projected onto a stabilizer codespace and the logical qubit is then decoded.

quant-ph↗

arXiv2008

Measurement based entanglement under conditions of extreme photon loss

The act of measuring optical emissions from two remote qubits can entangle them. By demanding that a photon from each qubit reaches the detectors, one can ensure than no photon was lost. But the failure rate then rises quadratically with loss probability. In [1] this resulted in 30 successes per billion attempts. We describe a means to exploit the low grade entanglement heralded by the detection of a lone photon: A subsequent perfect operation is quickly achieved by consuming this noisy resource. We require only two qubits per node, and can tolerate both path length variation and loss asymmetry. The impact of photon loss upon the failure rate is then linear; realistic high-loss devices can gain orders of magnitude in performance and thus support QIP.

quant-ph↗

arXiv2007

Distributed quantum information processing with minimal local resources

We present a protocol for growing graph states, the resource for one-way quantum computing, when the available entanglement mechanism is highly imperfect. The distillation protocol is frugal in its use of ancilla qubits, requiring only a single ancilla qubit when the noise is dominated by one Pauli error, and two for a general noise model. The protocol works with such scarce local resources by never post-selecting on the measurement outcomes of purification rounds. We find that such a strategy causes fidelity to follow a biased random walk, and that a target fidelity is likely to be reached more rapidly than for a comparable post-selecting protocol. An analysis is presented of how imperfect local operations limit the attainable fidelity. For example, a single Pauli error rate of 20% can be distilled down to $\sim 10$ times the imperfection in local operations.

quant-ph↗

arXiv2007

Efficient growth of complex graph states via imperfect path erasure

Given a suitably large and well connected (complex) graph state, any quantum algorithm can be implemented purely through local measurements on the individual qubits. Measurements can also be used to create the graph state: Path erasure techniques allow one to entangle multiple qubits by determining only global properties of the qubits. Here, this powerful approach is extended by demonstrating that even imperfect path erasure can produce the required graph states with high efficiency. By characterizing the degree of error in each path erasure attempt, one can subsume the resulting imperfect entanglement into an extended graph state formalism. The subsequent growth of the improper graph state can be guided, through a series of strategic decisions, in such a way as to bound the growth of the error and eventually yield a high-fidelity graph state. As an implementation of these techniques, we develop an analytic model for atom (or atom-like) qubits in mismatched cavities, under the double-heralding entanglement procedure of Barrett and Kok [Phys. Rev. A 71, 060310 (2005)]. Compared to straightforward postselection techniques our protocol offers a dramatic improvement in growing complex high-fidelity graph states.

quant-ph↗

arXiv2007

Adaptive strategies for graph state growth in the presence of monitored errors

Graph states (or cluster states) are the entanglement resource that enables one-way quantum computing. They can be grown by projective measurements on the component qubits. Such measurements typically carry a significant failure probability. Moreover, they may generate imperfect entanglement. Here we describe strategies to adapt growth operations in order to cancel incurred errors. Nascent states that initially deviate from the ideal graph states evolve toward the desired high fidelity resource without impractical overheads. Our analysis extends the diagrammatic language of graph states to include characteristics such as tilted vertices, weighted edges, and partial fusion, which arise from experimental imperfections. The strategies we present are relevant to parity projection schemes such as optical `path erasure' with distributed matter qubits.

quant-ph↗