arXiv subjects
Publications and source records attributed to Leong Chuan Kwek.
We present a protocol for generating entanglement over long distances in a two-dimensional quantum network based on the surface error-correction code. This protocol requires a fixed number of quantum memories at each node of the network and tolerates error rates of up to 1.67% in the quantum channels.
The observation that concepts from quantum information has generated many alternative indicators of quantum phase transitions hints that quantum phase transitions possess operational significance with respect to the processing of quantum information. Yet, studies on whether such transitions lead to quantum phases that differ in their capacity to process information remain limited. Here We show that there exist quantum phase transitions that cause a distinct qualitative change in our ability to simulate certain quantum systems under perturbation of an external field by local operations and classical communication. In particular, we show that in certain quantum phases of the XY model, adiabatic perturbations of the external magnetic field can be simulated by local spin operations, whereas the resulting effect within other phases results in coherent non-local interactions. We discuss the potential implications to adiabatic quantum computation, where a computational advantage exists only when adiabatic perturbation results in coherent multi-body interactions.
Universal quantum computation can be achieved by simply performing single-qubit measurements on a highly entangled resource state, such as cluster states. Cai, Miyake, Dür, and Briegel recently constructed a ground state of a two-dimensional quantum magnet by combining multiple Affleck-Kennedy-Lieb-Tasaki quasichains of mixed spin-3/2 and spin-1/2 entities and by mapping pairs of neighboring spin-1/2 particles to individual spin-3/2 particles [Phys. Rev. A 82, 052309 (2010)]. They showed that this state enables universal quantum computation by single-spin measurements. Here, we give an alternative understanding of how this state gives rise to universal measurement-based quantum computation: by local operations, each quasichain can be converted to a 1D cluster state and entangling gates between two neighboring logical qubits can be implemented by single-spin measurements. We further argue that a 2D cluster state can be distilled from the Cai-Miyake-Dür-Briegel state.
Measurement-based quantum computing (MBQC) is a model of quantum computing that proceeds by sequential measurements of individual spins in an entangled resource state. However, it remains a challenge to produce efficiently such resource states. Would it be possible to generate these states by simply cooling a quantum many-body system to its ground state? Cluster states, the canonical resource states for MBQC, do not occur naturally as unique ground states of physical systems. This inherent hurdle has led to a significant effort to identify alternative resource states that appear as ground states in spin lattices. Recently, some interesting candidates have been identified with various valence-bond-solid (VBS) states. In this review, we provide a pedagogical introduction to recent progress regarding MBQC with VBS states as possible resource states. This study has led to an interesting interdisciplinary research area at the interface of quantum information science and condensed matter physics.
Measurement-based quantum computation utilizes an initial entangled resource state and proceeds with subsequent single-qubit measurements. It is implicitly assumed that the interactions between qubits can be switched off so that the dynamics of the measured qubits do not affect the computation. By proposing a model spin Hamiltonian, we demonstrate that measurement-based quantum computation can be achieved on a thermal state with always-on interactions. Moreover, computational errors induced by thermal fluctuations can be corrected and thus the computation can be executed fault-tolerantly if the temperature is below a threshold value.
When cavity photons couple to an optical fiber with a continuum of modes, they usually leak out within a finite amount of time. However, if the fiber is about one meter long and linked to a mirror, photons bounce back and forth within the fiber on a much faster time scale. As a result, {\em dynamical decoupling} prevents the cavity photons from entering the fiber. In this paper we use the simultaneous dynamical decoupling of a large number of distant cavities from the fiber modes of linear optics networks to mediate effective cavity-cavity interactions in a huge variety of configurations. Coherent cavity networks with complete connectivity can be created with potential applications in quantum computing and simulation of the complex interaction Hamiltonians of biological systems.
We show that long-distance steady-state quantum correlations (entanglement) between pairs of cavity-atom systems in an array of lossy and driven coupled resonators can be established and controlled. The maximal of entanglement for any pair is achieved when their corresponding direct coupling is much smaller than their individual couplings to the third party. This effect is reminiscent of the coherent trapping of the $Λ-$type three-level atoms using two classical coherent fields. Different geometries for coherent control are considered. For finite temperature, the steady state of the coupled lossy atom-cavity arrays with driving fields is in general not a thermal state. Using an appropriate distance measure for quantum states, we find that the change rate of the degree of thermalization with respect to the driving strength is consistent with the entanglement of the system.
For two-path interferometers, the which-path predictability $\mathcal{P}$ and the fringe visibility $\mathcal{V}$ are familiar quantities that are much used to talk about wave-particle duality in a quantitative way. We discuss several candidates that suggest themselves as generalizations $P$ of $ mathcal{P}$ for multi-path interferometers, and treat the case of three paths in considerable detail. To each choice for the \emph{path knowledge} $P$, the \emph{interference strength} $V$ -- the corresponding generalization of $\mathcal{V}$ -- is found by a natural, operational procedure. In experimental terms it amounts to finding those equal-weight superpositions of the path amplitudes which maximize $P$ for the emerging intensities. Mathematically speaking, one needs to identify a certain optimal one among the Fourier transforms of the state of the interfering quantum object. Wave-particle duality is manifest, inasmuch as P=1 implies V=0 and V=1 implies P=0, whatever definition is chosen. The possible values of the pair $(P,V)$ are restricted to an area with corners at $(P,V)=(0,0)$, $(P,V)=(1,0)$, and $(P,V)=(0,1)$, with the shape of the border line from $(1,0)$ to $(0,1)$ depending on the particular choice for $P$ and the induced definition of $V$.
We introduce an architecture for robust and scalable quantum computation using both stationary qubits (e.g. single photon sources made out of trapped atoms, molecules, ions, quantum dots, or defect centers in solids) and flying qubits (e.g. photons). Our scheme solves some of the most pressing problems in existing non-hybrid proposals, which include the difficulty of scaling conventional stationary qubit approaches, and the lack of practical means for storing single photons in linear optics setups. We combine elements of two previous proposals for distributed quantum computing, namely the efficient photon-loss tolerant build up of cluster states by Barrett and Kok [Phys. Rev. A 71, 060310(R) (2005)] with the idea of Repeat-Until-Success (RUS) quantum computing by Lim et al. [Phys. Rev. Lett. 95, 030505 (2005)]. This idea can be used to perform eventually deterministic two-qubit logic gates on spatially separated stationary qubits via photon pair measurements. Under non-ideal conditions, where photon loss is a possibility, the resulting gates can still be used to build graph states for one-way quantum computing. In this paper, we describe the RUS method, present possible experimental realizations, and analyse the generation of graph states.
We demonstrate the possibility to perform distributed quantum computing using only single photon sources (atom-cavity-like systems), linear optics and photon detectors. The qubits are encoded in stable ground states of the sources. To implement a universal two-qubit gate, two photons should be generated simultaneously and pass through a linear optics network, where a measurement is performed on them. Gate operations can be repeated until a success is heralded without destroying the qubits at any stage of the operation. In contrast to other schemes, this does not require explicit qubit-qubit interactions, a priori entangled ancillas nor the feeding of photons into photon sources.
The methods of quantum cryptography enable one to have perfectly secure communication lines, whereby the laws of quantum physics protect the privacy of the data exchanged. Each quantum-cryptography scheme has its own security criteria that need to be met in a practical implementation. We find, however, that the generally accepted criteria are flawed for a whole class of such schemes.
Examples of geometric phases abound in many areas of physics. They offer both fundamental insights into many physical phenomena and lead to interesting practical implementations. One of them, as indicated recently, might be an inherently fault-tolerant quantum computation. This, however, requires to deal with geometric phases in the presence of noise and interactions between different physical subsystems. Despite the wealth of literature on the subject of geometric phases very little is known about this very important case. Here we report the first experimental study of geometric phases for mixed quantum states. We show how different they are from the well understood, noiseless, pure-state case.
We present a protocol for quantum cryptography in which the data obtained for mismatched bases are used in full for the purpose of quantum state tomography. Eavesdropping on the quantum channel is seriously impeded by requiring that the outcome of the tomography is consistent with unbiased noise in the channel. We study the incoherent eavesdropping attacks that are still permissible and establish under which conditions a secure cryptographic key can be generated. The whole analysis is carried out for channels that transmit quantum systems of any finite dimension.