In this work we discuss linear-optical quantum computing (LOQC). At first, we analyse the basic concepts of quantum optics, such as quantization of the eletromagnetic field, Fock state representation and linear-optical elements. We also discuss what is quantum computing and what resources are necessary to build a quantum computer, hopefully one that can solve problems beyond the capabilities of our current computational devices. We also discuss the measurement-based model of quantum
computing, which is especially suited for a linear-optical implementation. Finally, we join this two branches of physics. We discuss how to store quantum information, or quantum bits, in the state of the eletromagnetic field and how to can generate the necesssary dynamics on these states
In this work we discuss linear-optical quantum computing (LOQC). At first, we analyse the basic concepts of quantum optics, such as quantization of the eletromagnetic field, Fock state representation and linear-optical elements. We also discuss what is quantum computing and what resources are necessary to build a quantum computer, hopefully one that can solve problems beyond the capabilities of our current computational devices. We also discuss the measurement-based model of quantum
computing, which is especially suited for a linear-optical implementation. Finally, we join this two branches of physics. We discuss how to store quantum information, or quantum bits, in the state of the eletromagnetic field and how to can generate the necesssary dynamics on these states
Quantum computation is an emergent reality in our era. Several proposals and techniques lead to the quantum hardware development, showing to our generation devices capable to manipulate information provable safe and fast, based on quantum mechanics postulates. Among the techniques used to implement the quantum computer, we highlight the linear optics, which has been a lot of times tested. Using light and its effects, optical devices are used to assembly optical systems. This work proposes an optical system, that’s able to implement the logic functions, AND, OR, NAND and NOR probabilistically. The efficiency has been proven to be of 1/8 using only linear optics and linear optical devices for coherent states encoded qubits.
In this work, we discuss the classical theory of computation, focusing specifically on the so-called computational complexity theory. We develop a theoretical background on this subject which is very useful for discussions on quantum computational supremacy, the main topic of this work, and which is currently researched very actively. It is expected that linear optics without post-selection is not universal for quantum computation, and thus is an insteresting system to try to simulate classically or to search
for evidence of quantum supremacy. To set up this discussion, however, we must first, define what is linear optics, how it can be used for quantum information processing, and how this information can be encoded into photons. It is more usual to address these topics using the circuit model of computation, although the Turing model will also be briefly introduced here. Finally, by the end of this work, all tools introduced can be combined in the study of quantum computational supremacy using other restricted quantum systems.
Optical photons present many interesting aspects in the context of the research for suitable physical representations of quantum bits. Photons are chargeless particles, and do not interact strongly with each other, or even with most matter. They can be guided along long distances with low loss in optical fibers, delayed efficiently using phase shifters, and combined easily using beamsplitters. Photons exhibit typical quantum phenomena, such as the interference produced in two-slit experiments. Furthermore, in principle, photons can be made interact with each other if carefully handled. There are many practical problems with this approach; nevertheless it presents, beyond what has already been noted, an appealing conceptual simplicity.The purpose of this work is to present - at least, in its fundamental principles - a set of optical photon quantum gates that is universal for quantum computation. To do so, we begin by gathering the necessary mathematical and physical tools. We discuss canonical quantization for the electromagnetic field, and we formalize in an abstract context the characteristic properties of every realization of the Fock canonical commutation relationships (CCR). We analize the class of the spaces where it is possible to give such a realization, and that naturally lend themselves to host the physical model of our interest. Once acquired these bases, we turn ourselves to a particular optic system, the Mach-Zehnder interferometer, and we study the general properties of this system and of its essential constituents. At this point we choose a particular encoding of quantum bit and we look at the optical devices just discussed as elements of a quantum circuit. We then discuss the fundamental ideas that may guide the implementation of some important quantum gates: Hadamard gate, π/8 gate and controlled-NOT. We conclude by showing that these three quantum gates form a universal set of gates for quantum computation.
Optical photons present many interesting aspects in the context of the research for suitable physical representations of quantum bits. Photons are chargeless particles, and do not interact strongly with each other, or even with most matter. They can be guided along long distances with low loss in optical fibers, delayed efficiently using phase shifters, and combined easily using beamsplitters. Photons exhibit typical quantum phenomena, such as the interference produced in two-slit experiments. Furthermore, in principle, photons can be made interact with each other if carefully handled. There are many practical problems with this approach; nevertheless it presents, beyond what has already been noted, an appealing conceptual simplicity.The purpose of this work is to present - at least, in its fundamental principles - a set of optical photon quantum gates that is universal for quantum computation. To do so, we begin by gathering the necessary mathematical and physical tools. We discuss canonical quantization for the electromagnetic field, and we formalize in an abstract context the characteristic properties of every realization of the Fock canonical commutation relationships (CCR). We analize the class of the spaces where it is possible to give such a realization, and that naturally lend themselves to host the physical model of our interest. Once acquired these bases, we turn ourselves to a particular optic system, the Mach-Zehnder interferometer, and we study the general properties of this system and of its essential constituents. At this point we choose a particular encoding of quantum bit and we look at the optical devices just discussed as elements of a quantum circuit. We then discuss the fundamental ideas that may guide the implementation of some important quantum gates: Hadamard gate, π/8 gate and controlled-NOT. We conclude by showing that these three quantum gates form a universal set of gates for quantum computation.
This thesis covers several topics in optical quantum computation. A quantum computer is a computational device which is able to manipulate information by performing unitary operations on some physical system whose state can be described as a vector (or mixture of vectors) in a Hilbert space. The basic unit of information, called the qubit, is considered to be a system with two orthogonal states, which are assigned logical values of 0 and 1. Photons make excellent candidates to serve as qubits. They have little interactions with the environment. Many operations can be performed using very simple linear optical devices such as beam splitters and phase shifters. Photons can easily be processed through circuit-like networks. Operations can be performed in very short times. Photons are ideally suited for the long-distance communication of quantum information. The great difficulty in constructing an optical quantum computer is that photons naturally interact weakly with one another. This thesis first gives a brief review of two early approaches to optical quantum computation. It will describe how any discrete unitary operation can be performed using a single photon and a network of beam splitters, and how the Kerr effect can be used to construct a two photon logic gate. Second, this work provides a thorough introduction to the linear optical quantum computer developed by Knill, Laflamme, and Milburn. It then presents this author's results on the reliability of this scheme when implemented using imperfect photon detectors. This author finds that quantum computers of this sort cannot be built using current technology. Third, this dissertation describes a method for constructing a linear optical quantum computer using nearly orthogonal coherent states of light as the qubits. It shows how a universal set of logic operations can be performed, including calculations of the fidelity with which these operations may be accomplished. It discusses methods for reducing and correcting errors and recovering from failed operations. Lastly it describes an analysis of the long distance transmission of the coherent state qubits and shows how transmission errors can be corrected.
Basic concepts of quantum optics are introduced in this chapter. In the beginning, we give a review of the basic quantum mechanics. Then, we perform quantization of an electromagnetic field, which naturally introduces the concept of mode and quadrature. After that, we introduce basic quantum states of light and their phase space representation. Quantum operations in the continuous-variable system and their universality are also explained. To obtain the values of the physical quantities, we have to measure our quantum systems. In the optical continuous-variable system, homodyne measurement and photon number measurement are among the most common measurements that are also discussed here. Finally, we introduce the concept of quantum entanglement, which is one of the central concepts in quantum computation.