83 citations · 157 across the 4 of their papers we have counts for
5 papers · 1 filter
Catalysis and activation of magic states in fault tolerant architectures
Earl T. Campbell
In many architectures for fault tolerant quantum computing universality is achieved by a combination of Clifford group unitary operators and preparation of suitable nonstabilizer s…
Measurement based entanglement under conditions of extreme photon loss
Earl T. Campbell, Simon C. Benjamin
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…
Distributed quantum information processing with minimal local resources
Earl T. Campbell
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…
Efficient growth of complex graph states via imperfect path erasure
Earl T. Campbell, Joseph Fitzsimons, Simon C. Benjamin +1
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 c…
Adaptive strategies for graph state growth in the presence of monitored errors
Earl T. Campbell, Joseph Fitzsimons, Simon C. Benjamin +1
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 me…