Searcharxiv⌕ Search

arXiv subjects

William J. Munro

Publications and source records attributed to William J. Munro.

At least 109 records · Page 6Linked to original sources
arXiv2015

Optimal Trotterization in universal quantum simulators under faulty control

Universal quantum simulation may provide insights into those many-body systems that cannot be described classically, and that cannot be efficiently simulated with current technology. The Trotter formula, which decomposes a desired unitary time evolution of the simulator into a stroboscopic sequence of repeated elementary evolutions, is a key algorithmic component which makes quantum simulation of dynamics tractable. The Trotter number $n$ sets the timescale on which a computer running this algorithm is switched from one elementary evolution to another. In the ideal case, the precision of the simulation can be arbitrarily controlled by increasing $n$. We study a more realistic scenario where each gate is applied imperfectly. The resultant tradeoff in errors leads to an ultimate limit on the precision of the simulation. We calculate the optimum Trotter number $n^*$ that achieves this limit, which is the minimum statistical distance from the actual simulation to the ideal one.

quant-ph↗
arXiv2015

Spin Amplification with Inhomogeneous Broadening

A long-lived qubit is usually well-isolated from all other systems and the environments, and so is not easy to couple with measurement apparatus. It is sometimes difficult to implement reliable projective measurements on such a qubit. One potential solution is spin amplification with many ancillary qubits. Here, we propose a spin amplification technique, where the ancillary qubits state change depending on the state of the target qubit. The technique works even in the presence of inhomogeneous broadening. We show that fast and accurate amplification is possible even if the coupling and frequency of the ancillary qubits is inhomogeneous. Since our scheme is robust against realistic imperfections, this could provide a new mechanism for reading out a single spin that could not have been measured using the previous approaches.

quant-ph↗
arXiv2014

Robust entanglement-based magnetic field sensor beyond the standard quantum limit

Recently, there have been significant developments in entanglement-based quantum metrology. However, entanglement is fragile against experimental imperfections, and quantum sensing to beat the standard quantum limit in scaling has not yet been achieved in realistic systems. Here, we show that it is possible to overcome such restrictions so that one can sense a magnetic field with an accuracy beyond the standard quantum limit even under the effect of decoherence, by using a realistic entangled state that can be easily created even with current technology. Our scheme could pave the way for the realizations of practical entanglement-based magnetic field sensors.

quant-ph↗
arXiv2014

Measurement-device-independent quantum key distribution with all-photonic adaptive Bell measurement

The time-reversed version of entanglement-based quantum key distribution (QKD), called measurement-device-independent QKD (mdiQKD), was originally introduced to close arbitrary security loopholes of measurement devices. Here we show that the mdiQKD has another advantage which should be distinguished from the entanglement-based QKD. In particular, an all-photonic adaptive Bell measurement, based on the concept of quantum repeaters, can be installed solely in the mdiQKD, which leads to a square root improvement in the key rate. This Bell measurement also provides a similar improvement in the single-photon-based entanglement generation of quantum repeaters.

quant-ph↗
arXiv2014

Will boson-sampling ever disprove the Extended Church-Turing thesis?

Boson-sampling is a highly simplified, but non-universal, approach to implementing optical quantum computation. It was shown by Aaronson and Arkhipov that this protocol cannot be efficiently classically simulated unless the polynomial hierarchy collapses, which would be a shocking result in computational complexity theory. Based on this, numerous authors have made the claim that experimental boson-sampling would provide evidence against, or disprove, the Extended Church-Turing thesis -- that any physically realisable system can be efficiently simulated on a Turing machine. We argue against this claim on the basis that, under a general, physically realistic independent error model, boson-sampling does not implement a provably hard computational problem in the asymptotic limit of large systems.

quant-ph↗
arXiv2014

Improving the coherence time of a quantum system via a coupling with an unstable system

Here, we propose a counter-intuitive use of a hybrid system where the coherence time of a quantum system is actually improved via a coupling with an unstable system. If we couple a two-level system with a single NV center, then a dark state of the NV center naturally forms after the hybridization. We show that this dark state becomes robust against environmental fluctuations due to the coupling even when the coherence time of the two-level system is much shorter than that of the NV center. Our proposal opens a new way to use a quantum hybrid system for the realization of robust quantum information processing

quant-ph↗
arXiv2014

Coherent control of an NV$^-$ center with one adjacent 13C

We investigate the theoretically achievable fidelities when coherently controlling an effective three qubit system consisting of a negatively charged nitrogen vacancy (NV$^-$) center in diamond with an additional nearby carbon $^{13}$C spin $I_{\text{C}}=1/2$ via square radio and microwave frequency pulses in different magnetic field regimes. Such a system has potentially interesting applications in quantum information related tasks such as distributed quantum computation or quantum repeater schemes. We find that the best fidelities can be achieved in an intermediate magnetic field regime. However, with only square pulses it will be challenging to reach the fidelity threshold(s) predicted by current models of fault-tolerant quantum computing.

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

An on-chip coupled resonator optical waveguide single-photon buffer

Integrated quantum optical circuits are now seen as one of the most promising approaches with which to realize single photon quantum information processing. Many of the core elements for such circuits have been realized including sources, gates and detectors. However, a significant missing function necessary for photonic information processing on-chip is a buffer, where single photons are stored for a short period of time to facilitate circuit synchronization. Here we report an on-chip single photon buffer based on coupled resonator optical waveguides (CROW) consisting of 400 high-Q photonic crystal line defect nanocavities. By using the CROW, a pulsed single photon was successfully buffered for 150 ps with 50-ps tunability while maintaining its non-classical properties. Furthermore, we showed that our buffer preserves entanglement by storing and retrieving one photon from a time-bin entangled state. This is a significant step towards an all-optical integrated quantum information processor.

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

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

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↗
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

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

Quantum metrology with entangled coherent states

We present an improved phase estimation scheme employing entangled coherent states and demon- strate that the states give the smallest variance in the phase parameter in comparison to NOON, BAT and "optimal" states under perfect and lossy conditions. As these advantages emerge for very modest particle numbers, the optical version of entangled coherent state metrology is achievable with current technology.

quant-ph↗