Searcharxiv⌕ Search

arXiv subjects

William J. Munro

Publications and source records attributed to William J. Munro.

At least 127 records · Page 7Linked to original sources

Coherent coupling of a superconducting flux-qubit to an electron spin ensemble in diamond

Electron-spin nitrogen-vacancy color centers in diamond are a natural candidate to act as a quantum memory for superconducting qubits because of their large collective coupling and long coherence times. We report here the first demonstration of strong coupling and coherent exchange of a single quantum of energy between a flux-qubit and an ensemble of nitrogen-vacancy color centers.

quant-ph↗

Layer by layer generation of cluster states

Cluster states can be used to perform measurement-based quantum computation. The cluster state is a useful resource, because once it has been generated only local operations and measurements are needed to perform universal quantum computation. In this paper, we explore techniques for quickly and deterministically building a cluster state. In particular we consider generating cluster states on a qubus quantum computer, a computational architecture which uses a continuous variable ancilla to generate interactions between qubits. We explore several techniques for building the cluster, with the number of operations required depending on whether we allow the ability to destroy previously created controlled-phase links between qubits. In the case where we can not destroy these links, we show how to create an n x m cluster using just 3nm -2n -3m/2 + 3 operations. This gives more than a factor of 2 saving over a naive method. Further savings can be obtained if we include the ability to destroy links, in which case we only need (8nm-4n-4m-8)/3 operations. Unfortunately the latter scheme is more complicated so choosing the correct order to interact the qubits is considerably more difficult. A half way scheme, that keeps a modular generation but saves additional operations over never destroying links requires only 3nm-2n-2m+4 operations. The first scheme and the last scheme are the most practical for building a cluster state because they split up the generation into the repetition of simple sections.

quant-ph↗

Quantum Tagging: Authenticating Location via Quantum Information and Relativistic Signalling Constraints

We define the task of {\it quantum tagging}, that is, authenticating the classical location of a classical tagging device by sending and receiving quantum signals from suitably located distant sites, in an environment controlled by an adversary whose quantum information processing and transmitting power is unbounded. We define simple security models for this task and briefly discuss alternatives. We illustrate the pitfalls of naive quantum cryptographic reasoning in this context by describing several protocols which at first sight appear unconditionally secure but which, as we show, can in fact be broken by teleportation-based attacks. We also describe some protocols which cannot be broken by these specific attacks, but do not prove they are unconditionally secure. We review the history of quantum tagging protocols, which we first discussed in 2002 and described in a 2006 patent (for an insecure protocol). The possibility has recently been reconsidered by other authors. All the more recently discussed protocols of which we are aware were either previously considered by us in 2002-3 or are variants of schemes then considered, and all are provably insecure.

quant-ph↗

Reduce, reuse, recycle, for robust cluster state generation

Efficient generation of cluster states is crucial for engineering large-scale measurement-based quantum computers. Hybrid matter-optical systems offer a robust, scalable path to this goal. Such systems have an ancilla which acts as a bus connecting the qubits. We show that by generating smaller cluster "Lego bricks", reusing one ancilla per brick, the cluster can be produced with maximal efficiency, requiring fewer than half the operations compared with no bus reuse. By reducing the time required to prepare sections of the cluster, bus reuse more than doubles the size of the computational workspace that can be used before decoherence effects dominate. A row of buses in parallel provides fully scalable cluster state generation requiring only 20 CPhase gates per bus use.

quant-ph↗

Ancilla-based quantum simulation

We consider simulating the BCS Hamiltonian, a model of low temperature superconductivity, on a quantum computer. In particular we consider conducting the simulation on the qubus quantum computer, which uses a continuous variable ancilla to generate interactions between qubits. We demonstrate an O(N^3) improvement over previous work conducted on an NMR computer [PRL 89 057904 (2002) & PRL 97 050504 (2006)] for the nearest neighbour and completely general cases. We then go on to show methods to minimise the number of operations needed per time step using the qubus in three cases; a completely general case, a case of exponentially decaying interactions and the case of fixed range interactions. We make these results controlled on an ancilla qubit so that we can apply the phase estimation algorithm, and hence show that when N \geq 5, our qubus simulation requires significantly less operations that a similar simulation conducted on an NMR computer.

quant-ph↗

Integration of highly probabilistic sources into optical quantum architectures: perpetual quantum computation

In this paper we introduce a design for an optical topological cluster state computer constructed exclusively from a single quantum component. Unlike previous efforts we eliminate the need for on demand, high fidelity photon sources and detectors and replace them with the same device utilised to create photon/photon entanglement. This introduces highly probabilistic elements into the optical architecture while maintaining complete specificity of the structure and operation for a large scale computer. Photons in this system are continually recycled back into the preparation network, allowing for a arbitrarily deep 3D cluster to be prepared using a comparatively small number of photonic qubits and consequently the elimination of high frequency, deterministic photon sources.

quant-ph↗

Tunable photon-assisted bleaching of three-level systems for noise filtration

Electromagnetically-induced transparency (EIT) exploits quantum coherence to burn subnatural linewidth holes within a spectral line. We investigate the less explored properties of EIT to effect absorptive nonlinear processes without restrictions on the relative intensities of pump and probe fields. We show that a three-level medium under imperfect EIT conditions can generate a form of bleaching that is qualitatively similar to two-state saturable absorption. This scheme has the advantages of greater sensitivity to signal intensity and controllability over its bleaching intensity level post-fabrication. Such effects could prove useful for noise filtration at very low light levels.

quant-ph↗

A superconducting qubit as a quantum transformer routing entanglement between a microscopic quantum memory and a macroscopic resonator

We demonstrate experimentally the creation and measurement of an entangled state between a microscopic two level system and a macroscopic superconducting resonator where their indirect interaction is mediated by an artificial atom, a superconducting persistent current qubit (PCQB). We show that the microscopic two level system, formed by a defect in an oxide layer, exhibits an order of magnitude longer dephasing time than the PCQB, while the dephasing time of the entangled states between the microscopic two level system and macroscopic superconducting resonator is significantly longer than the dephasing time in the persistent current qubits. This demonstrates the possibility that a qubit of moderate coherence properties can be used in practice to address low decoherence quantum memories by connecting them to macroscopic circuit QED quantum buses, leading future important implications for quantum information processing tasks.

cond-mat.supr-con↗

Quantum Analogue Computing

We briefly review what a quantum computer is, what it promises to do for us, and why it is so hard to build one. Among the first applications anticipated to bear fruit is quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data is encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the Hilbert space of the (logical) qubits in the quantum computer. This type of direct correspondence is how data is encoded in a classical analogue computer. There is no binary encoding, and increasing precision becomes exponentially costly: an extra bit of precision doubles the size of the computer. This has important consequences for both the precision and error correction requirements of quantum simulation, and significant open questions remain about its practicality. It also means that the quantum version of analogue computers, continuous variable quantum computers (CVQC) becomes an equally efficient architecture for quantum simulation. Lessons from past use of classical analogue computers can help us to build better quantum simulators in future.

quant-ph↗

Pulse shaping by coupled-cavities: Single photons and qudits

Dynamic coupling of cavities to a quantum network is of major interest to distributed quantum information processing schemes based on cavity quantum electrodynamics. This can be achieved by active tuning a mediating atom-cavity system. In particular, we consider the dynamic coupling between two coupled cavities, each interacting with a two-level atom, realized by tuning one of the atoms. One atom-field system can be controlled to become maximally and minimally coupled with its counterpart, allowing high fidelity excitation confinement, Q-switching and reversible state transport. As an application, we first show that simple tuning can lead to emission of near-Gaussian single-photon pulses that is significantly different from the usual exponential decay in a passive cavity-based system. The influences of cavity loss and atomic spontaneous emission are studied in detailed numerical simulations, showing the practicality of these schemes within the reach of current experimental technology in solid-state environment. We then show that when the technique is employed to an extended coupled-cavity scheme involving a multi-level atom, arbitrary temporal superposition of single photons can be engineered in a deterministic way.

quant-ph↗

Constructing 2D and 3D cluster states with photonic modules

Large scale quantum information processing (QIP) and distributed quantum computation require the ability to perform entangling operations on a large number of qubits. We describe a new photonic module which prepares, deterministically, photonic cluster states using an atom in a cavity as an ancilla. Based on this module we design a network for constructing 2D cluster states and then we extend the architecture to 3D topological cluster states. Advantages of our design include a passive switching mechanism and the possibility of using global control pulses for the atoms in the cavity. The architecture described here is well suited for integrated photonic circuits on a chip and could be used as a basis of a future quantum optical processor or in a quantum repeater node.

quant-ph↗

Hybrid hypercomputing: towards a unification of quantum and classical computation

We investigate the computational power and unified resource use of hybrid quantum-classical computations, such as teleportation and measurement-based computing. We introduce a physically causal and local graphical calculus for quantum information theory, which enables high-level intuitive reasoning about quantum information processes. The graphical calculus defines a local information flow in a computation which satisfies conditions for physical causality. We show how quantum and classical processing units can now be formally integrated, and give an analysis of the joint resources used in a typical measurement-based computation. Finally, we discuss how this picture may be used to give a high-level unified model for hybrid quantum computing.

quant-ph↗

Generalized Toffoli gates using qudit catalysis

We present quantum networks for a n-qubit controlled gate C^{n-1}(U) which use a higher dimensional (qudit) ancilla as a catalyser. In its simplest form the network has only n two-particle gates (qubit-qudit) -- this is the minimum number of two-body interactions needed to couple all n+1 subsystems (n qubits plus one ancilla). This class of controlled gates includes the generalised Toffoli gate C^{n-1}(X) on n qubits, which plays an important role in several quantum algorithms and error correction. A particular example implementing this model is given by the dispersive limit of a generalised Jaynes-Cummings Hamiltonian of an effective spin-s interacting with a cavity mode.

quant-ph↗

Architectural design for a topological cluster state quantum computer

The development of a large scale quantum computer is a highly sought after goal of fundamental research and consequently a highly non-trivial problem. Scalability in quantum information processing is not just a problem of qubit manufacturing and control but it crucially depends on the ability to adapt advanced techniques in quantum information theory, such as error correction, to the experimental restrictions of assembling qubit arrays into the millions. In this paper we introduce a feasible architectural design for large scale quantum computation in optical systems. We combine the recent developments in topological cluster state computation with the photonic module, a simple chip based device which can be used as a fundamental building block for a large scale computer. The integration of the topological cluster model with this comparatively simple operational element addresses many significant issues in scalable computing and leads to a promising modular architecture with complete integration of active error correction exhibiting high fault-tolerant thresholds.

quant-ph↗

Updating Quantum Cryptography Report ver. 1

Quantum cryptographic technology (QCT) is expected to be a fundamental technology for realizing long-term information security even against as-yet-unknown future technologies. More advanced security could be achieved using QCT together with contemporary cryptographic technologies. To develop and spread the use of QCT, it is necessary to standardize devices, protocols, and security requirements and thus enable interoperability in a multi-vendor, multi-network, and multi-service environment. This report is a technical summary of QCT and related topics from the viewpoints of 1) consensual establishment of specifications and requirements of QCT for standardization and commercialization and 2) the promotion of research and design to realize New-Generation Quantum Cryptography.

quant-ph↗

High speed quantum gates with cavity quantum electrodynamics

Cavity quantum electrodynamic schemes for quantum gates are amongst the earliest quantum computing proposals. Despite continued progress, and the dramatic recent demonstration of photon blockade, there are still issues with optimal coupling and gate operation involving high-quality cavities. Here we show dynamic control techniques that allow scalable cavity-QED based quantum gates, that use the full bandwidth of the cavities. When applied to quantum gates, these techniques allow an order of magnitude increase in operating speed, and two orders of magnitude reduction in cavity Q, over passive cavity-QED architectures. Our methods exploit Stark shift based Q-switching, and are ideally suited to solid-state integrated optical approaches to quantum computing.

quant-ph↗

Quantum Repeater with Encoding

We propose a new approach to implement quantum repeaters for long distance quantum communication. Our protocol generates a backbone of encoded Bell pairs and uses the procedure of classical error correction during simultaneous entanglement connection. We illustrate that the repeater protocol with simple Calderbank-Shor-Steane (CSS) encoding can significantly extend the communication distance, while still maintaining a fast key generation rate.

quant-ph↗

Spectral Effects of Fast Response Cross Kerr Non-Linearity on Quantum Gate

According to idealized models, a strong Kerr non-linearity may be used to build optical quantum gates for optical quantum information processing by inducing conditional phase shifts on quantum states. Recently, Shapiro (PRA 73, 062305 (2006)) argued that for a Kerr medium with non-instantaneous but fast response, essentially no phase shift is induced on two-single-photon input states, and thus a quantum gate build from such a medium cannot work. Here we show that a fast response Kerr medium induces some but very little phase shifts on a two-single-photon input state, and it is insufficient for high fidelity quantum computation. We point out that this is caused by the medium imparting spectral entanglement to the input photons. We further show that a way to circumvent this problem and achieve a high fidelity gate, is to engineer the dispersion properties of the medium to give a dominant spectral effect over the non-instantaneous response, in addition to satisfying a phase matching condition.

quant-ph↗