Increasing the Dimensionality of Quantum Walks Using Multiple Walkers

Quantum computer promises to outperform classical computer fundamentally, due to its quantum superposition. Any operations to N qubits can be decomposed into several single-qubit operations and two-qubit controlled-NOT (CNOT) operations in theory. Linear optical quantum computing (LOQC) is one of the most prominent physical quantum systems, which has the advantage of long coherent time and convenience in implementing single qubit operations. However, the realization of two-qubit CNOT gate is the greatest challenge for LOQC, because two photons cannot directly interact with each other by nature. KLM protocol proves the feasibility of LOQC and spurs quantity of research on schematic design and experimental demonstration of CNOT gates by using linear quantum optics system. These researches are very important and nontrivial for LOQC, and this paper gives an overview of different schemes of the proposed CNOT gates and the experimental demonstration.

Quantum Walks are unitary processes describing the evolution of an initially localized wavefunction on a lattice potential. The complexity of the dynamics increases significantly when several indistinguishable quantum walkers propagate on the same lattice simultaneously, as these develop non-trivial spatial correlations that depend on the particle’s quantum statistics, mutual interactions, initial positions, and the lattice potential. We show that even in the simplest case of a quantum walk on a one dimensional graph, these correlations can be shaped to yield a complete set of compact quantum logic operations. We provide detailed recipes for implementing quantum logic on one-dimensional quantum walks in two general cases. For non-interacting bosons—such as photons in waveguide lattices—we find high-fidelity probabilistic quantum gates that could be integrated into linear optics quantum computation schemes. For interacting quantum-walkers on a one-dimensional lattice—a situation that has recently been demonstrated using ultra-cold atoms—we find deterministic logic operations that are universal for quantum information processing. The suggested implementation requires minimal resources and a level of control that is within reach using recently demonstrated techniques. Further work is required to address error-correction.

Linear optics quantum computing (LOQC) is a leading candidate for the implementation of large scale quantum computers. Here quantum information is encoded into the quantum states of light and computation proceeds via a linear optics network. It is well known that in such schemes there are stringent requirements on the spatio-temporal structure of photons -- they must be completely indistinguishable and of very high purity. We show that in the Boson-sampling model for LOQC these conditions may be significantly relaxed. We present evidence that by increasing the size of the system we can implement a computationally hard algorithm even if our photons have arbitrarily low fidelity and purity. These relaxed conditions make Boson-sampling LOQC within reach of present-day technology.

Quantum information has been witnessing great science value and latent application since 1980's. The research work presented here consist of mainly two important parts: manipulations of multiphoton entanglement and atomic ensembles based quantum memory. In first part, the experimental technique multi-photon entanglement is further developed to study fundamental issues in quantum mechanics, remarkable applications to quantum communication and quantum computation. Specifically, we have demonstrated a bit-flip error-free transfer of quantum information, violation of Bell's inequality beyond Tsirelson's bound, teleportation of a two-qubit composite system, as well as the one-way computing by two-photon-four-qubit cluster state. To overcome un-scalability problem due to probabilistic feature in linear optical quantum information processing, we investigated in the second part the physics of atomic ensembles based quantum memory. We show that theoretically, entanglement between distant locations can be deterministically generated. The experimental work has thoroughly developed the necessary techniques and we have achieved deterministic single photon source, and interference of the photons from independent atomic ensembles, teleportation between photonic and atomic qubits, a novel way to create a robust entanglement between an atomic and a photonic qubit, and memory based entanglement swapping. We believe, the developed techniques here would dramatically facilitate progresses in many fields including global quantum communication, linear optical quantum computation and the foundations of quantum mechanics etc.

We present a scheme for linear optical quantum computation that is highly robust to imperfect single photon sources and inefficient detectors. In particular we show that if the product of the detector efficiency with the source efficiency is greater than 2/3, then efficient linear optical quantum computation is possible. This high threshold is achieved within the cluster state paradigm for quantum computation.

We propose a scheme for efficient cluster state quantum computation by using imperfect polarization-entangled photon-pair sources, linear optical elements and inefficient non-photon-number-resolving detectors. The efficiency threshold for loss tolerance in our scheme requires the product of source and detector efficiencies should be >1/2 - the best known figure. This figure applies to uncorrelated loss. We further find that the loss threshold is unaffected by correlated loss in the photon pair source. Our approach sheds new light on efficient linear optical quantum computation with imperfect experimental conditions.

A basic experiment on 2-bit quantum calculations related to the Deutsch–Jozsa algorithm on a linear optical quantum computer using a liquid crystal (LC) device as a linear optical element was investigated. By controlling the phase of each of the two split laser beams and checking the number of photons at the output, it is possible to determine if the input bits are “not equal” or “not uniform.” The phase of the laser light was controlled using an LC device and a half-wave plate, and changes in the interference state of the output light and the number of photons were observed. The voltage application to the LC device is set at the input bit. As a result, the interference state changed according to the input bit, and changes in the number of photons were observed.

Entangled photons are a crucial resource for linear optical quantum communication and quantum computation. Besides the remarkable progress of photon state engineering using atomic memories (Kimble (2008); Yuan et al. (2008)) the majority of current experiments is based on the production of photon pairs in the process of spontaneous parametric down-conversion (SPDC), where the entangled photon pair is concluded from post-selection of randomly occurring coincidences. Here we present new insights into the heralded generation of photon states (Barz et al. (2010); Wagenknecht et al. (2010)) that are maximally entangled in polarization (Schrodinger (1935)) with linear optics and standard photon detection from SPDC (Kwiat et al. (1995)). We utilize the down-conversion state corresponding to the generation of three pairs of photons, where the coincident detection of four auxiliary photons unambiguously heralds the successful preparation of the entangled state (Śliwa & Banaszek (2003)). This controlled generation of entangled photon states is a significant step towards the applicability of a linear optics quantum network (Nielsen & Chuang (2000)), in particular for entanglement distribution (Bennett et al. (1996)), entanglement swapping (Kaltenbaek et al. (2009); Pan et al. (1998)), quantum teleportation (Bouwmeester et al. (1997)), quantum cryptography (Bennett & Brassard (1984); Ekert (1991); Jennewein et al. (2000)) and scalable approaches towards photonics-based quantum computing schemes (Browne & Rudolph (2004); Gottesman & Chuang (1999); Knill et al. (2001)).

A quantum walks assisted algorithm for peptide and protein folding prediction

The creation of specified quantum states is important for most, if not all, applications in quantum computation and communication. The quality of the state preparation is therefore an essential ingredient in any assessment of a quantum-state gun. We show that the fidelity, under the standard definitions is not sufficient to assess quantum sources, and we propose a new measure of suitability that necessarily depends on the application for the source. We consider the performance of single-photon guns in the context of quantum key distribution (QKD) and linear optical quantum computation. Single-photon sources for QKD need radically different properties than sources for quantum computing. Furthermore, the suitability for single-photon guns is discussed explicitly in terms of experimentally accessible criteria.

We propose a scheme to implement fermionic quantum SWAP and Fredkin gates for spin qubits with the aid of charge detection. The scheme is deterministic without the need of qubit—qubit interaction, and the proposed setups consist of simple polarizing beam splitters, single-spin rotations, and charge detectors. Compared with linear optics quantum computation, this charge-measurement-based qubit scheme greatly enhances the success probability for implementing quantum SWAP and Fredkin gates and greatly simplifies the experimental realization of scalable quantum computers with noninteracting electrons.

Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. We investigate the performance of continuous-time quantum walks as a tool for finding spin glass ground states, a problem that serves as a useful model for realistic optimization problems. By performing detailed numerics, we uncover significant ways in which solving spin glass problems differs from applying quantum walks to the search problem. Importantly, unlike for the search problem, parameters such as the hopping rate of the quantum walk do not need to be set precisely for the spin glass ground state problem. Heuristic values of the hopping rate determined from the energy scales in the problem Hamiltonian are sufficient for obtaining a better quantum advantage than for search. We uncover two general mechanisms that provide the quantum advantage: matching the driver Hamiltonian to the encoding in the problem Hamiltonian, and an energy redistribution principle that ensures a quantum walk will find a lower energy state in a short timescale. This makes it practical to use quantum walks for solving hard problems, and opens the door for a range of applications on suitable quantum hardware.

The "quantum walk" has emerged recently as a paradigmatic process for the dynamic simulation of complex quantum systems, entanglement production and quantum computation. Hitherto, photonic implementations of quantum walks have mainly been based on multipath interferometric schemes in real space. We report the experimental realization of a discrete quantum walk taking place in the orbital angular momentum space of light, both for a single photon and for two simultaneous photons. In contrast to previous implementations, the whole process develops in a single light beam, with no need of interferometers; it requires optical resources scaling linearly with the number of steps; and it allows flexible control of input and output superposition states. Exploiting the latter property, we explored the system band structure in momentum space and the associated spin-orbit topological features by simulating the quantum dynamics of Gaussian wavepackets. Our demonstration introduces a novel versatile photonic platform for quantum simulations.

Quantum information technology has been developing rapidly in last two decades. Very recently, quite a few optical quantum key distribution networks have been reported, enabling preliminary practical applications in secure information transfer. Meanwhile, a number of significant progresses based on quantum network have also been made in the research of linear optical quantum computing, simulation and metrology. However, on the way towards large-scale optical quantum network serious problems occur. On the one hand, the distance of fiber-based quantum communication is limited, due to intrinsic fiber loss and decreasing of entanglement quality caused by the noisy environment. On the other hand, the probabilistic feature of single and entangled photon sources would also cause an exponentially increasing overhead for large-scale quantum network. To solve the above problems, quantum repeaters and/or transmission of optical quantum bits over free space channel can be efficiently exploited for future wide-area realization of quantum communication. In addition, memory built-in quantum repeaters would also enable scalable linear optical quantum computing, simulation and high precision measurement. In this talk I will present some recent experiments from our group, including eight-photon entanglement, topological quantum error-correction, quantum repeater and efficient and long-lived quantum memory, and entanglement distribution and quantum teleportation over 100km-scale free-space quantum channels. These experiments show the promising future possibility towards scalable quantum network with photons and atoms.

Adiabatic quantum computing (AQC) is a model of computation that uses quantum mechanical processes operating under adiabatic conditions. As a form of universal quantum computation, AQC employs the principles of superposition, tunneling, and entanglement that manifest in quantum physical systems. The AQC model of quantum computing is distinguished by the use of dynamical evolution that is slow with respect to the time and energy scales of the underlying physical systems. This adiabatic condition enforces the promise that the quantum computational state will remain well-defined and controllable thus enabling the development of new algorithmic approaches. Several notable algorithms developed within the AQC model include methods for solving unstructured search and combinatorial optimization problems. In an idealized setting, the asymptotic complexity analyses of these algorithms indicate computational speed-ups may be possible relative to state-of-the-art conventional methods. However, the presence of non-ideal conditions, including non-adiabatic dynamics, residual thermal excitations, and physical noise complicate the assessment of the potential computational performance. A relaxation of the adiabatic condition is captured in the complementary computational heuristic of quantum annealing, which accommodates physical systems operating at finite temperature and in open environments. While quantum annealing (QA) provides a more accurate model for the behavior of actual quantum physical systems, the possibility of non-adiabatic effects obscures a clear separation with conventional computing complexity. A series of technological advances in the control of quantum physical systems have enabled experimental AQC and QA. Prominent examples include demonstrations using superconducting electronics, which encode quantum information in the magnetic flux induced by a weak current operating at cryogenic temperatures. A family of devices developed specifically for unconstrained optimization problems has been applied to solve problems in specific domains including logistics, finance, material science, machine learning, and numerical analysis. An accompanying infrastructure has also developed to support these experimental demonstrations and to enable access of a broader community of users. Although AQC is most commonly applied in superconducting technologies, alternative approaches include optically trapped neutral atoms and ion-trap systems. The significant progress in the understanding of AQC has revealed several open topics that continue to motivate research into this model of quantum computation. Foremost is the development of methods for fault-tolerant operation that will ensure the scalability of AQC for solving large-scale problems. In addition, unequivocal experimental demonstrations that differentiate the computational power of AQC and its variants from conventional computing approaches are needed. This will also require advances in the fabrication and control of quantum physical systems under the adiabatic restrictions.