Ever since its discovery, quantum mechanics has remained an intensely active field, and its real-world applications continue to unfold rapidly. In 1982, Richard Feynman proposed a new type of computer operating directly under quantum mechanics laws: – the quantum computer \cite{Feynman1982}. Compared with the classical computer, whose information is encoded in “bits”, the quantum computer, whose information is encoded in “quantum bits”, or “qubits”, will be able to perform calculations exponentially faster for such problems as factoring large integers into primes and simulating complicated quantum systems. Due to their extremely powerful calculation speeds and abilities, quantum computers have been the long-pursued dreams for both experimentalists and theorists in many research groups, government agencies, industrial companies, etc., and the fast-paced developments in their architecture and speed continue to make them more and more attractive. There are two principal models of quantum computing: the circuit model and the measurement-based model. The circuit model is similar to a traditional computer where there are inputs, gates and outputs. The measurement-based model is different, as it is crucially based on the cluster state, a type of highly entangled quantum state. In this new model, quantum computing begins with an initial cluster state and then carries out calculations by physical measurements of the cluster state itself along with feedforward. Thus, the cluster state serves as the material and resource for the entire set of calculations, and it is an extremely important part of measurement-based quantum computing. This thesis will discuss an experimental and theoretical work that holds the world record for the largest entangled cluster state ever created whose 60 qumodes (optical versions of qubits) are all available simultaneously. Moreover, the entangled state we created is not random, and it is a cluster state which meets the specific requirements for implementing quantum computing. In the race to build a practical quantum computer, the ability to create such a large cluster state is paramount. Also, our creative optical method to generate massive entanglement advances many other methods due to its high efficiency, super-compactness and large scalability. The entanglement proceeds from interfering multiple EPR entangled pairs, which are generated from the down-converting process of a nonlinear crystal in an optical parametric oscillator, into a very long dual-rail wire cluster state. Moreover, many copies of the same state can easily be obtained by merely adjusting the frequencies of the pump lasers. These cluster states serve as building blocks of the universal quantum computer, and also are, in their own right, important resources for studying and exploring quantum mechanics in large systems.
Ever since its discovery, quantum mechanics has remained an intensely active field, and its real-world applications continue to unfold rapidly. In 1982, Richard Feynman proposed a new type of computer operating directly under quantum mechanics laws: – the quantum computer \cite{Feynman1982}. Compared with the classical computer, whose information is encoded in “bits”, the quantum computer, whose information is encoded in “quantum bits”, or “qubits”, will be able to perform calculations exponentially faster for such problems as factoring large integers into primes and simulating complicated quantum systems. Due to their extremely powerful calculation speeds and abilities, quantum computers have been the long-pursued dreams for both experimentalists and theorists in many research groups, government agencies, industrial companies, etc., and the fast-paced developments in their architecture and speed continue to make them more and more attractive. There are two principal models of quantum computing: the circuit model and the measurement-based model. The circuit model is similar to a traditional computer where there are inputs, gates and outputs. The measurement-based model is different, as it is crucially based on the cluster state, a type of highly entangled quantum state. In this new model, quantum computing begins with an initial cluster state and then carries out calculations by physical measurements of the cluster state itself along with feedforward. Thus, the cluster state serves as the material and resource for the entire set of calculations, and it is an extremely important part of measurement-based quantum computing. This thesis will discuss an experimental and theoretical work that holds the world record for the largest entangled cluster state ever created whose 60 qumodes (optical versions of qubits) are all available simultaneously. Moreover, the entangled state we created is not random, and it is a cluster state which meets the specific requirements for implementing quantum computing. In the race to build a practical quantum computer, the ability to create such a large cluster state is paramount. Also, our creative optical method to generate massive entanglement advances many other methods due to its high efficiency, super-compactness and large scalability. The entanglement proceeds from interfering multiple EPR entangled pairs, which are generated from the down-converting process of a nonlinear crystal in an optical parametric oscillator, into a very long dual-rail wire cluster state. Moreover, many copies of the same state can easily be obtained by merely adjusting the frequencies of the pump lasers. These cluster states serve as building blocks of the universal quantum computer, and also are, in their own right, important resources for studying and exploring quantum mechanics in large systems.
A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of these systems to a large number of qubits, essential for practical applications such as the Shor algorithm, represents a formidable challenge. Most of the current experiments are designed to implement sequences of highly controlled interactions between selected particles (qubits), thereby following models of a quantum computer as a (sequential) network of quantum logic gates. Here we propose a different model of a scalable quantum computer. In our model, the entire resource for the quantum computation is provided initially in form of a specific entangled state (a so-called cluster state) of a large number of qubits. Information is then written onto the cluster, processed, and read out form the cluster by one-particle measurements only. The entangled state of the cluster thus serves as a universal substrate for any quantum computation. Cluster states can be created efficiently in any system with a quantum Ising-type interaction (at very low temperatures) between two-state particles in a lattice configuration.
Quantum computing promises exponential speedup for particular computational tasks, such as integer factoring, which bears importance for encryption technology, and quantum simulation, which holds vast scientific potential. Comparing with the traditional circuit-based quantum computers, one-way quantum computers are experimentally appealing because it requires only local measurements on an entangled resource called a cluster state. In this thesis, I first review the fundamental theory of one-way quantum computing and its experimental implementation using the quantum optical frequency comb. After that, I present two novel schemes for generating ultra-scalable cluster states with rich structures that can be used for universal quantum computing.
When it comes to practical quantum computing, the two main challenges are circumventing decoherence (devastating quantum errors due to interactions with the environmental bath) and achieving scalability (as many qubits as needed for a real-life, game-changing computation). We show that using, in lieu of qubits, the "qumodes" represented by the resonant fields of the quantum optical frequency comb of an optical parametric oscillator allows one to create bona fide, large scale quantum computing processors, pre-entangled in a cluster state. We detail our recent demonstration of 60-qumode entanglement (out of an estimated 3000) and present an extension to combining this frequency-tagged with time-tagged entanglement, in order to generate an arbitrarily large, universal quantum computing processor.
Quantum technology is a fundamentally new way of harnessing Nature and it has potential for a truly revolutionary innovation and promise the next generation of products with exciting and astounding properties that will affect our lives profoundly. They will have a great influence in defence, aerospace, energy and telecommunications sectors. If this process is to continue in the future, new, quantum technology must replace or supplement what we have now. In particular, Quantum Information Technology can support entirely new modes of information processing based on so called quantum bits or qubits. Its eventual impact may be as great as or greater than that of its classical predecessor. There is almost daily progress in developing promising technologies for realizing quantum information processing with various advantages over its classical counterpart. Logic gates and wires are becoming smaller, and soon they will be made out of only a handful of atoms. Photons are unsurpassed as qubits in terms of decoherence times, mobility, and achievability of high-fidelity single-qubit operations. Thus far, entanglement experiments in optics have been very clean, and an optical quantum processor would obviously have an advantage in connecting to a quantum “network” (no need to convert between stationary and flying qubits). All-optical quantum computing became feasible when, in 2001, a breakthrough known as the KLM (Knill-Laflamme-Milburn) scheme showed that scalable quantum computing is possible using only single-photon sources, detectors, and linear optical circuits. This scheme relies on quantum interference with auxiliary photons at a beam splitter and single-photon detection to induce not-deterministic interactions. Nowadays, the limits of the original KLM linear optics quantum computing proposal, as well as the more recent cluster and graph-state approaches, in addition to various nonlinear optical approaches are explored, but several challenges must be overcome. The most important issues are the practical scalability of quantum circuits, the ability to perform quantum logic gates with error rates below the fault-tolerant threshold and their incorporation into large-scale quantum circuits with realistic physical resources and single-photon detectors packed on an optical chip. Optical integrated circuits offer great potential for realizing previously unfeasible large-scale quantum circuits. However, this architecture suffers not only of the overhead of multiple sources, detectors and ancillary qubits, but it needs to maintain the complete coherence between single photons in which qubits are encoded. The idea to reduce the overhead due to multiple single photon sources with very high degree of reciprocal coherence exploits the possibility to encode the whole state space in a complex optical circuit based on Multiple Rail (MR) Architecture: a particular state in input is encoded in the quantum superposition of a coherent light beam trough the different waveguides, so that it is possible to reproduce the mathematical and physical aspects of quantum entanglement in classical beams of light. Multiple Rail Architecture provides the realization of so called Classical or, better, Intra-System Entanglement. In practics a reconfigurable optical matrix of interconnected MachZehnder provides the representation of the complex Hilbert-Schmidt space where the quantum operation lives. This integrated system on chip can be both Photonics and/or Plasmonics. By exploiting this idea we are able to obtain all the universal quantum gates as SWAP, CNOT, CPHASE, TOFFOLI for two qubits and for multiqubits cases. The most important goal is the possibility to perform deterministic Bell measurements: in usual optical schemes the probability of success of Bell measurements is ½, while the novel architecture provides the possibility to discriminate all Bell states, so that the teleportation can become completely deterministic.
It was Richard Feynman who first proposed, in 1982, the far-reaching concept of \na ”quantum computer”—a device more powerful than classical computers. The idea \nof a quantum computer is to employ the fascinating and often counterintuitive \nlaws of quantum mechanics to process information. It is far from obvious that \nthe proposed concept of a quantum computer is more powerful than its classical \ncounterpart, it was only in 1994 when Peter Shor theoretically demonstrated the \nexistence of a quantum algorithm for factorizing integers into prime factors \nthat runs in polynomial time unlike its classical counterpart which works in \nsub-exponential time. The factorization of integers into prime factors is the \nbasis of asymmetric cryptography. These early theoretical results lunched an \nimmense interest of the scientific community. Already during ’90s, the first \nproposals for the physical implementation of quantum computation emerged. Ever \nsince, many experimental groups around the world pursued different physical \nimplementations of quantum bits (qubits). The first decade of the new century \nsaw a steady improvement in the control and decoherence time (the time over \nwhich the information carried by the qubit is lost) for various qubits by many \norders of magnitude. The natural next step in this context is to answer the \nquestion of how to scale the system up to include many qubits and thus build a \nquantum computer? One of the main parts of this thesis addresses exactly this \nquestion, namely the question of architecture and scalability of future quantum \ncomputer. \n \nAmong various different physical realizations of qubits, the idea of using \nelectron spins trapped in electrostatic semiconductor quantum dots as the \nbuilding blocks of a quantum computer (the so-called spin qubits), put forward \nby Daniel Loss and David DiVincenzo in 1997, triggered tremendous interest in \nscientific community. Nevertheless, the implementation of the original \nLoss-DiVincenzo proposal posed a considerable technical challenge. It used \nquantum tunneling between qubits to enable their communication with each other, \nand thus required that the qubits to be placed very close to each other. This \nrequirement not only leaves little \nspace for the placement of the vast amount of gates and wirings needed to define \nthe electrostatic quantum dots, but also makes it challenging to control the \nlocal magnetic field needed for single-qubit operations. For these reasons, no \nsystem with more than a couple of spin qubits has been \nsuccessfully implemented thus far. In the first part of this thesis, we leap \nover this long-standing problem with an entirely different strategy of using \nmetallic floating gates or ferromagnets to couple together qubits that are \nseparated over a long distance. Our scheme works for any type of \nspin qubits, including the qubits based on nitrogen-vacancy center (NV-center) \nin diamond and technologically very important silicon qubits. \n \nThe main topic of this thesis is related to quantum computer. Still, quite \nunexpectedly, some of the ideas we employed in order to tackle the problem of \nquantum computer scalability can be utilized in a completely different field of \nresearch, namely, in the field of magnetic field sensing. Qubit are not only a \nnecessary ingredient of quantum computer but they also provide a way to measure \nvery accurately magnetic fields. The magnetometer build upon the qubit based on \nNV-center, so-called NV-magnetometer, emerged in recent years as most sensitive \nmagnetic moment sensor. These magnetometers are able to detect about hundred \nnuclear spins within a minute of acquisition time. In the second part of this \nthesis, we propose an entirely novel experimental realization of \nNV-magnetometers which increases present NV-center sensitivities by four orders \nof magnitude at room temperature. This unprecedented amplification of \nsensitivity will render magnetometers capable of detecting individual nuclear \nspins. This amplification is achieved by introducing a ferromagnetic particle \nbetween the nuclear spin that needs to be detected and the NV-magnetometer. Our \nsetup, in contrast to existing schemes, is particularly advantageous because, \ndue to the large amplification of sensitivity, the nuclear spin need not lie \nwithin a few nanometers of the surface but rather can be detectable at a \ndistance of 30 nm. With these novelties, our scheme provides chemically \nsensitive spin detection under ambient conditions allowing nanoscale resolution \nof nuclear magnetic moments in biological systems—the holy grail of nuclear \nmagneticresonance. \n \nIn the last part of the thesis we focus our attention to a new direction in \nquantum computer implementation that deals with topological quantum computer \nintroduced by Alexei Kitaev in 1997; in this approach the idea is to use \nquasiparticles with ”fractional” statistics and to perform the single- and \ntwo-qubit gates by merely exchanging these quasiparticles. Additionally, \ninformation in this system is stored non-locally thus it mitigates the problem \nof decoherence caused by local noise from the environment. Majorana fermions are \none of the most well known examples of such excitations. We analyze transport \nsignatures of different topological states in one-dimensional systems, like \nMajorana fermions and fractionally charged states. We envision an Aharonov-Bohm \nsetup wherein conductance measurement provides a clear signature of presence of \nfractionally charged fermionic states, since oscillations with double period \nemerge in this case. Additionally, we propose a very simple setup that enables \nexistence of degenerate mid-gap states, so-called Tamm-Shockley states that are \ncharacterized by fractional charge and discuss possible ways of detecting these \nstates experimentally. \n
The last two decades have witnessed the rapid growth of quantum information processing as an active field of multidisciplinary science and technology. Tremendous theoretical and experimental progress has been made in quantum communication and quantum computation, and it seems clear that some of this progress will soon result in practical applications outside the laboratory. Quantum computation aims to build a quantum computer and to explore the origins and limits of quantum computing power. The original circuit model of a quantum computer, due to Deutsch, has a strong formal similarity with the circuit model of a classical computer. Both models depict a computation as processing via the wiring of a number of fiducial gates, each of which dynamically couples a small number of input (qu)bits in a controlled manner. In other words, unitary evolution is the basic mechanism of information processing in the circuit model of quantum computers. Starting with a given fixed state of many qubits, measurement based quantum computation (MBQC) processes information by applying a sequence of measurements to designated qubits in designated bases. This is remarkable, given the probabilistic nature of quantum measurement and the murky physical status of the dynamics of 'wavefunction collapse'. The final result of the computation is determined from the classical data of all the measurement outcomes. There exist two principle models: the teleportation based model and the 'one-way quantum computer' of 'cluster state computation'. The formalism of cluster states has proven to be a powerful way of describing the essential entanglement resources needed to perform quantum information processing. Unlike the circuit model, the MBQC models have no natural classical counterpart. There are a number of physical architectures for which measurements on the relevant systems are more easily performed than controlled unitary evolution. Moreover, it appears the MBQC models can offer novel computational benefits, especially regarding issues of fault-tolerance and parallelizability of algorithms. As a result, the theory of MBQC is now shaping the latest experimental proposals across the full spectrum of quantum information processing technologies. Naturally, understanding the scope of measurement based quantum computation is also yielding many insights into what is necessary (as opposed to merely sufficient) for us to harness the power of quantum computers. Quantum communication aims to offer efficient and secure ways of information exchange, directly based on quantum mechanics. Photons serve as natural information carriers, owing to their robustness against decoherence. A major problem for photonic communication systems is due to photon loss. It turns out that this difficulty can be overcome by the quantum repeater, a measurement-based technique. The basic idea is to divide the transmission channel into many segments and perform some quantum measurement on each segment. Additional measurement-based protocols and technologies have also been demonstrated to improve the quality of quantum communication, such as entanglement swapping and purification. The articles in this invited Focus Issue cover topics both in measurement-based quantum communication and computation, but the emphasis is given to quantum computation. A significant number of articles deal with the preparation of cluster states, the experimental realization of a one-way quantum computer, and the associated efficiency and benefits. We hope that you will find that some of these new results are of interest to you, and further hope that the issue will increase your interest in this interdisciplinary research field if you are a non-expert. Focus on Measurement-Based Quantum Information Processing Contents A proof-of-principle experiment of eliminating photon-loss errors in cluster states Wei-Bo Gao, Xiao-Qi Zhou, Jin Zhang, Tao Yang and Jian-Wei Pan Continuous variable multipartite entanglement and optical implementations of quantum communication networks Yimin Lian, Changde Xie and Kunchi Peng Generalized flow and determinism in measurement-based quantum computation Daniel E Browne, Elham Kashefi, Mehdi Mhalla and Simon Perdrix The entanglement of the four-photon cluster state C Schmid, N Kiesel, W Wieczorek and H Weinfurter Optical zeno gate: bounds for fault tolerant operation Patrick M Leung and Timothy C Ralph Towards experimental entanglement connection with atomic ensembles in the single excitation regime Julien Laurat, Chin-wen Chou, Hui Deng, Kyung Soo Choi, Daniel Felinto, Hugues de Riedmatten and H J Kimble Towards minimal resources of measurement-based quantum computation Simon Perdrix Experimental realization of a quantum game on a one-way quantum computer Robert Prevedel, Andre Stefanov, Philip Walther and Anton Zeilinger Fundamentals of universality in one-way quantum computation M Van den Nest, W Dur, A Miyake and H J Briegel Loss tolerant linear optical quantum memory by measurement-based quantum computing Michael Varnava, Daniel E Browne and Terry Rudolph Graph state generation with noisy mirror-inverting spin chains Stephen R Clark, Alexander Klein, Martin Bruderer and Dieter Jaksch One-way quantum computing in adecoherence-free subspace M S Tame, M Paternostro and M S Kim Cluster state preparation using gates operating at arbitrary success probabilities K Kieling, D Gross and J Eisert Topological fault-tolerance in cluster state quantum computation R Raussendorf, J Harrington and K Goyal Strategies for the preparation of large cluster states using non-deterministic gates Peter P Rohde and Sean D Barrett A repeat-until-success quantum computing scheme A Beige, Y L Lim and L C Kwek Efficient growth of complex graph states via imperfect path erasure Earl T Campbell, Joseph Fitzsimons, Simon C Benjamin and Pieter Kok Investigation of a single-photon source based on quantum interference T B Pittman, J D Franson and B C Jacobs Entanglement and local information access for graph states Damian Markham, Akimasa Miyake and Shashank Virmani The efficiencies of generating cluster states with weak nonlinearities Sebastien G R Louis, Kae Nemoto, W J Munro and T P Spiller A direct approach to fault-tolerance in measurement-based quantum computation via teleportation Marcus Silva, Vincent Danos, Elham Kashefi and Harold Ollivier Experimental ancilla-assisted qubit transmission against correlated noise T Yamamoto, R Nagase, J Shimamura, S K Ozdemir, M Koashi and N Imoto Terry Rudolph, Imperial College, London, UK Jian-Wei Pan, University of Science and Technology of China, Hefei, People's Republic of China and Universitat Heidelberg, Germany