arXiv subjects

Kae Nemoto

Publications and source records attributed to Kae Nemoto.

At least 109 records · Page 6Linked to original sources

arXiv2014

Software Pauli Tracking for Quantum Computation

The realisation of large-scale quantum computing is no longer simply a hardware question. The rapid development of quantum technology has resulted in dozens of control and programming problems that should be directed towards the classical computer science and engineering community. One such problem is known as Pauli tracking. Methods for implementing quantum algorithms that are compatible with crucial error correction technology utilise extensive quantum teleportation protocols. These protocols are intrinsically probabilistic and result in correction operators that occur as byproducts of teleportation. These byproduct operators do not need to be corrected in the quantum hardware itself. Instead, byproduct operators are tracked through the circuit and output results reinterpreted. This tracking is routinely ignored in quantum information as it is assumed that tracking algorithms will eventually be developed. In this work we help fill this gap and present an algorithm for tracking byproduct operators through a quantum computation. We formulate this work based on quantum gate sets that are compatible with all major forms of quantum error correction and demonstrate the completeness of the algorithm.

quant-ph↗

arXiv2013

High-threshold topological quantum error correction against biased noise

Quantum information can be protected from decoherence and other errors, but only if these errors are sufficiently rare. For quantum computation to become a scalable technology, practical schemes for quantum error correction that can tolerate realistically high error rates will be necessary. In some physical systems, errors may exhibit a characteristic structure that can be carefully exploited to improve the efficacy of error correction. Here, we describe a scheme for topological quantum error correction to protect quantum information from a dephasing-biased error model, where we combine a repetition code with a topological cluster state. We find that the scheme tolerates error rates of up to 1.37%-1.83% per gate, requiring only short-range interactions in a two-dimensional array.

quant-ph↗

arXiv2013

Photonic architecture for scalable quantum information processing in NV-diamond

Physics and information are intimately connected, and the ultimate information processing devices will be those that harness the principles of quantum mechanics. Many physical systems have been identified as candidates for quantum information processing, but none of them are immune from errors. The challenge remains to find a path from the experiments of today to a reliable and scalable quantum computer. Here, we develop an architecture based on a simple module comprising an optical cavity containing a single negatively-charged nitrogen vacancy centre in diamond. Modules are connected by photons propagating in a fiber-optical network and collectively used to generate a topological cluster state, a robust substrate for quantum information processing. In principle, all processes in the architecture can be deterministic, but current limitations lead to processes that are probabilistic but heralded. We find that the architecture enables large-scale quantum information processing with existing technology.

quant-ph↗

arXiv2013

High fidelity gate operations within the coupled nuclear and electron spins of a nitrogen vacancy center in diamond

In this article we investigate the dynamics of a single negatively charged nitrogen-vacancy center (NV-) coupled to the spin of the nucleus of a 15-nitrogen atom and show that high fidelity gate operations are possible without the need for complicated composite pulse sequences. These operations include both the electron and nuclear spin rotations, as well as an entangling gate between them. These are experimentally realizable gates with current technology of sufficiently high fidelities that they can be used to build graph states for quantum information processing tasks.

quant-ph↗

arXiv2013

Towards Realizing a Quantum Memory for a Superconducting Qubit: Storage and Retrieval of quantum states

We have built a hybrid system composed of a superconducting flux qubit (the processor) and an ensemble of nitrogen-vacancy centers in diamond (the memory) that can be directly coupled to one another and demonstrated how information can be transferred from the flux qubit to the memory, stored and subsequently retrieved. We have established the coherence properties of the memory, and succeeded in creating an entangled state between the processor and memory, demonstrating how the entangled state's coherence is preserved. Our results are a significant step towards using an electron spin ensemble as a quantum memory for superconducting qubits.

cond-mat.mes-hall↗

arXiv2013

Quantum Error Correction for Beginners

Quantum error correction (QEC) and fault-tolerant quantum computation represent one of the most vital theoretical aspect of quantum information processing. It was well known from the early developments of this exciting field that the fragility of coherent quantum systems would be a catastrophic obstacle to the development of large scale quantum computers. The introduction of quantum error correction in 1995 showed that active techniques could be employed to mitigate this fatal problem. However, quantum error correction and fault-tolerant computation is now a much larger field and many new codes, techniques, and methodologies have been developed to implement error correction for large scale quantum algorithms. In response, we have attempted to summarize the basic aspects of quantum error correction and fault-tolerance, not as a detailed guide, but rather as a basic introduction. This development in this area has been so pronounced that many in the field of quantum information, specifically researchers who are new to quantum information or people focused on the many other important issues in quantum computation, have found it difficult to keep up with the general formalisms and methodologies employed in this area. Rather than introducing these concepts from a rigorous mathematical and computer science framework, we instead examine error correction and fault-tolerance largely through detailed examples, which are more relevant to experimentalists today and in the near future.

quant-ph↗

arXiv2013

Quantum communication without the necessity of quantum memories

Quantum physics is known to allow for completely new ways to create, manipulate and store information. Quantum communication - the ability to transmit quantum information - is a primitive necessary for any quantum internet. At its core, quantum communication generally requires the formation of entangled links between remote locations. The performance of these links is limited by the classical signaling time between such locations - necessitating the need for long lived quantum memories. Here we present the design of a communications network which neither requires the establishment of entanglement between remote locations nor the use of long-lived quantum memories. The rate at which quantum data can be transmitted along the network is only limited by the time required to perform efficient local gate operations. Our scheme thus potentially provides higher communications rates than previously thought possible.

quant-ph↗

arXiv2013

Hybrid-system approach to fault-tolerant quantum communication

We present a layered hybrid-system approach to quantum communication that involves the distribution of a topological cluster state throughout a quantum network. Photon loss and other errors are suppressed by optical multiplexing and entanglement purification. The scheme is scalable to large distances, achieving an end-to-end rate of 1 kHz with around 50 qubits per node. We suggest a potentially suitable implementation of an individual node composed of erbium spins (single atom or ensemble) coupled via flux qubits to a microwave resonator, allowing for deterministic local gates, stable quantum memories, and emission of photons in the telecom regime.

quant-ph↗

arXiv2013

Classification of Spin-Nematic Squeezing in Spin-1 Collective Atomic Systems

In spin-1 collective atomic systems, the spin and nematic-tensor operators constitute the su(3) Lie algebra whose su(2) subalgebras are shown to give two distinct classes of squeezing which are unitarily equivalent to spin squeezing and spin-nematic squeezing. We explicitly construct a unitary operator that generates an arbitrary squeezed spin-nematic state from an arbitrary Fock state. In particular, we demonstrate that squeezed spin states can be generated from a polar state and that squeezed spin-nematic sates can be generated from a fully spin-polarized state.

quant-ph↗

arXiv2013

Towards a complete, continuous, Wigner function for an ensemble of spins or qubits

We present a new quasi-probability distribution function for ensembles of spin-half particles or qubits that has many properties in common with Wigner's original function for systems of continuous variables. We show that this function provides clear and intuitive graphical representation of a wide variety of states, including Fock states, spin-coherent states, squeezed states, superpositions and statistical mixtures. Unlike previous attempts to represent ensembles of spins/qubits, this distribution is capable of simultaneously representing several angular momentum shells.

quant-ph↗

arXiv2013

Synthesis of Topological Quantum Circuits

Topological quantum computing has recently proven itself to be a very powerful model when considering large- scale, fully error corrected quantum architectures. In addition to its robust nature under hardware errors, it is a software driven method of error corrected computation, with the hardware responsible for only creating a generic quantum resource (the topological lattice). Computation in this scheme is achieved by the geometric manipulation of holes (defects) within the lattice. Interactions between logical qubits (quantum gate operations) are implemented by using particular arrangements of the defects, such as braids and junctions. We demonstrate that junction-based topological quantum gates allow highly regular and structured implementation of large CNOT (controlled-not) gate networks, which ultimately form the basis of the error corrected primitives that must be used for an error corrected algorithm. We present a number of heuristics to optimise the area of the resulting structures and therefore the number of the required hardware resources.

quant-ph↗

arXiv2012

Requirements for fault-tolerant factoring on an atom-optics quantum computer

Quantum information processing and its associated technologies has reached an interesting and timely stage in their development where many different experiments have been performed establishing the basic building blocks. The challenge moving forward is to scale up to larger sized quantum machines capable of performing tasks not possible today. This raises a number of interesting questions like: How big will these machines need to be? how many resources will they consume? This needs to be urgently addressed. Here we estimate the resources required to execute Shor's factoring algorithm on a distributed atom-optics quantum computer architecture. We determine the runtime and requisite size of the quantum computer as a function of the problem size and physical error rate. Our results suggest that once experimental accuracy reaches levels below the fault-tolerant threshold, further optimisation of computational performance and resources is largely an issue of how the algorithm and circuits are implemented, rather than the physical quantum hardware

quant-ph↗

arXiv2012

Photon phonon entanglement in coupled optomechanical arrays

We consider an array of three optomechanical cavities coupled either reversibly or irreversibly to each other and calculate the amount of entanglement between the different optical and mechanical modes. We show the composite system exhibits intercavity photon-phonon entanglement.

quant-ph↗

arXiv2012

Programming a Topological Quantum Computer

Topological quantum computing has recently proven itself to be a powerful computational model when constructing viable architectures for large scale computation. The topological model is constructed from the foundation of a error correction code, required to correct for inevitable hardware faults that will exist for a large scale quantum device. It is also a measurement based model of quantum computation, meaning that the quantum hardware is responsible only for the construction of a large, computationally universal quantum state. This quantum state is then strategically consumed, allowing for the realisation of a fully error corrected quantum algorithm. The number of physical qubits needed by the quantum hardware and the amount of time required to implement an algorithm is dictated by the manner in which this universal quantum state is consumed. In this paper we examine the problem of algorithmic optimisation in the topological lattice and introduce the required elements that will be needed when designing a classical software package to compile and implement a large scale algorithm on a topological quantum computer.

quant-ph↗

arXiv2012

Path Selection for Quantum Repeater Networks

Quantum networks will support long-distance quantum key distribution (QKD) and distributed quantum computation, and are an active area of both experimental and theoretical research. Here, we present an analysis of topologically complex networks of quantum repeaters composed of heterogeneous links. Quantum networks have fundamental behavioral differences from classical networks; the delicacy of quantum states makes a practical path selection algorithm imperative, but classical notions of resource utilization are not directly applicable, rendering known path selection mechanisms inadequate. To adapt Dijkstra's algorithm for quantum repeater networks that generate entangled Bell pairs, we quantify the key differences and define a link cost metric, seconds per Bell pair of a particular fidelity, where a single Bell pair is the resource consumed to perform one quantum teleportation. Simulations that include both the physical interactions and the extensive classical messaging confirm that Dijkstra's algorithm works well in a quantum context. Simulating about three hundred heterogeneous paths, comparing our path cost and the total work along the path gives a coefficient of determination of 0.88 or better.

quant-ph↗

arXiv2012

Quantum metrology for non-linear phase shifts with entangled coherent states

We investigate the phase enhancement of quantum states subject to non-linear phase shifts. The optimal phase estimation of even entangled coherent states (ECSs) is shown to be better than that of NOON states and of odd ECS states with the same average particle number and non-linearity exponent k. We investigate the creation of approximate ECSs (AECSs) from a squeezed vacuum with current optical technology methods and find that a pure AECS is even slightly better than an even ECS for large . We also examine simple but physically relevant cases of loss in the non-linear interferometer arm, for a fixed .

quant-ph↗

arXiv2011

SU(N)-symmetric quasi-probability distribution functions

We present a set of N-dimensional functions, based on generalized SU(N)-symmetric coherent states, that represent finite-dimensional Wigner functions, Q-functions, and P-functions. We then show the fundamental properties of these functions and discuss their usefulness for analyzing N-dimensional pure and mixed quantum states.

quant-ph↗

arXiv2011

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↗