This thesis consolidates my research on several topics of quantum information. We start with an analysis of negativity, an entanglement monotone making appearances throughout the thesis. Because negativity is a nonanalytic function of a density matrix, prior methods in the physics literature have been insufficient to compute its derivatives. After developing techniques in complex, patterned matrix calculus, we write down a perturbative expansion of negativity to any order. We continue with another problem in entanglement theory: characterizing the states for which all local actions on one subsystem can be replicated by actions on another. Our results lead to a method for quantifying entanglement based on operational symmetries and tie in to concepts in quantum mechanics, quantum field theory, and classical optics. The study of local operations on entangled states continues with an investigation of the local equivalence of special subsets of graph states, including those that underlie the all-photonic quantum repeater. I show, for certain repeater-like graph states, that equivalence through local unitaries implies equivalence through local Clifford unitaries, investigate certain other properties, and offer alternative proofs and clarifications on existing results. Armed with a better understanding of repeater graph states, I give a blueprint for near-term long-distance all-photonic quantum communication. I make the case that an intercity communication scheme based on a deterministic source of photonic graph states is a good candidate for a proof-of-principle experiment as it is less demanding than an all-photonic repeater but shares its salient features. The design of this experiment is informed by a careful considerations of experimental imperfections. Finally, we transition from discrete-variable quantum communication to continuous-variable quantum computation. Although Gottesman-Kitaev-Preskill (GKP) states are a promising way to encode a qubit into an oscillator, ideal versions of such states have infinite energy. Thus we investigate the impact of finite-energy approximations of GKP states on computational circuits by looking at the behaviour of their physical and logical content through several figures of merit. We complement these results with extensive numerical computations of fidelities, probabilities, and properties of the approximate GKP states produced in photonic circuits.
This thesis consolidates my research on several topics of quantum information. We start with an analysis of negativity, an entanglement monotone making appearances throughout the thesis. Because negativity is a nonanalytic function of a density matrix, prior methods in the physics literature have been insufficient to compute its derivatives. After developing techniques in complex, patterned matrix calculus, we write down a perturbative expansion of negativity to any order. We continue with another problem in entanglement theory: characterizing the states for which all local actions on one subsystem can be replicated by actions on another. Our results lead to a method for quantifying entanglement based on operational symmetries and tie in to concepts in quantum mechanics, quantum field theory, and classical optics. The study of local operations on entangled states continues with an investigation of the local equivalence of special subsets of graph states, including those that underlie the all-photonic quantum repeater. I show, for certain repeater-like graph states, that equivalence through local unitaries implies equivalence through local Clifford unitaries, investigate certain other properties, and offer alternative proofs and clarifications on existing results. Armed with a better understanding of repeater graph states, I give a blueprint for near-term long-distance all-photonic quantum communication. I make the case that an intercity communication scheme based on a deterministic source of photonic graph states is a good candidate for a proof-of-principle experiment as it is less demanding than an all-photonic repeater but shares its salient features. The design of this experiment is informed by a careful considerations of experimental imperfections. Finally, we transition from discrete-variable quantum communication to continuous-variable quantum computation. Although Gottesman-Kitaev-Preskill (GKP) states are a promising way to encode a qubit into an oscillator, ideal versions of such states have infinite energy. Thus we investigate the impact of finite-energy approximations of GKP states on computational circuits by looking at the behaviour of their physical and logical content through several figures of merit. We complement these results with extensive numerical computations of fidelities, probabilities, and properties of the approximate GKP states produced in photonic circuits.
Entanglement is the resource that most sharply distinguishes quantum information processing from its classical counterpart, and this thesis examines it from two complementary directions: how it can be detected and quantified, and how it, together with the broader machinery of quantum correlations, interference, and measurement, can be put to use. We first study two simple, measurable conditions that detect bipartite entanglement, and show that the extent to which either is violated yields a lower bound on the negativity of a state. The bound is established for two qubits, extended to systems of arbitrary finite dimension, and sharpened when partial knowledge of the Schmidt vectors is available. We then turn to discrete-outcome quantum sensor networks, in which one seeks only to determine which detectors, or which group or spatial pattern of detectors, has responded to a signal. Working in the weak-interaction regime, where the output states are nonorthogonal, we use minimum-error and unambiguous state discrimination to show that entangled initial states and collective measurements confer an advantage when detectors are grouped, and we develop a shift-operator formalism that gives closed-form success probabilities for the detection of shifted patterns in one- and two-dimensional arrays. Next we consider the problem of learning two unknown pure qubit states, together with their probabilities of occurrence, from a scrambled stream; we show that receiving the systems in identically prepared pairs supplies exactly the extra quantum information needed, since the resulting two-qubit state in the symmetric subspace has a unique decomposition into pure product states, which we recover by tomography. Finally, we show how interference and measurement can convert information encoded in the phases of quantum amplitudes into information encoded in their magnitudes, amplifying the amplitudes that carry useful information and suppressing those that do not, and we apply this technique to states produced by the quantum approximate optimization algorithm for the MaxCut and minimum-vertex-cover problems. Throughout, a single theme recurs: the correlations and superpositions permitted by quantum mechanics are at once something to be measured and something to be exploited.
Encoding a qubit in the continuous degrees of freedom of an oscillator is a promising path to error-corrected quantum computation. One advantageous way to achieve this is through Gottesman-Kitaev-Preskill (GKP) grid states, whose symmetries allow for the correction of any small continuous error on the oscillator. Unfortunately, ideal grid states have infinite energy, so it is important to find finite-energy approximations that are realistic, practical, and useful for applications. In the first half of this work we investigate the impact of imperfect GKP states on computational circuits independently of the physical architecture. To this end, we analyze the behavior of the physical and logical content of normalizable GKP states through several figures of merit, employing a recently developed modular subsystem decomposition. By tracking the errors that enter into the computational circuit due to imperfections in the GKP states, we are able to gauge the utility of these states for noisy intermediate-scale quantum devices. In the second half, we focus on a state preparation approach in the photonic domain wherein photon-number-resolving measurements on some modes of Gaussian states produce non-Gaussian states in others. We produce detailed numerical results for the preparation of GKP states alongside estimating the resource requirements in practical settings and probing the quality of the resulting states with the tools we develop. Our numerical experiments indicate that we can generate any state in the GKP Bloch sphere with nearly equal resources, which has implications for magic state preparation overheads.
Long-distance quantum communication will require the use of quantum repeaters to overcome the exponential attenuation of signal with distance. One class of such repeaters utilizes quantum error correction to overcome losses in the communication channel. Here we propose a strategy of using the bosonic Gottesman-Kitaev-Preskill (GKP) code in a two-way repeater architecture with multiplexing. The crucial feature of the GKP code that we make use of is the fact that GKP qubits easily admit deterministic two-qubit gates, hence allowing for multiplexing without the need for generating large cluster states as required in previous all-photonic architectures based on discrete-variable codes. Moreover, alleviating the need for such clique clusters entails that we are no longer limited to extraction of at most one end-to-end entangled pair from a single protocol run. In fact, thanks to the availability of the analog information generated during the measurements of the GKP qubits, we can design better entanglement swapping procedures in which we connect links based on their estimated quality. This enables us to use all the multiplexed links so that large number of links from a single protocol run can contribute to the generation of the end-to-end entanglement. We find that our architecture allows for high-rate end-to-end entanglement generation and is resilient to imperfections arising from finite squeezing in the GKP state preparation and homodyne detection inefficiency. In particular we show that long-distance quantum communication over more than 1000 km is possible even with less than 13 dB of GKP squeezing. We also quantify the number of GKP qubits needed for the implementation of our scheme and find that for good hardware parameters our scheme requires around ${10}^{3}\ensuremath{-}{10}^{4}$ GKP qubits per repeater per protocol run.
In this thesis, I present experimental and theoretical work which assesses and develops a range of tools that are required for performing quantum information processing, particularly in photonic systems. I investigate the three degrees of freedom of a single photon—its polarisation, spatialmomentum and time-frequency distributions. For polarisation, I show that using wave plates to implement arbitrary, single-qubit rotations is more complicated than is commonly appreciated. In the spatial-momentum and time-frequency domains, I develop ways to perform tomographic analysis of quantum states, and I report the first demonstrations of these techniques. In the time-frequency domain, the tomography technique utilises entanglement in the photon polarisation as a resource to store and provide access to the time-frequency information. In my first two experiments, I use spontaneous parametric down-conversion to produce entanglement between pairs of single photons in all three degrees of freedom. I demonstrate the first characterisation of entanglement in spatial modes and the time-frequency domain, the first quantitative measurement of entangled qutrit states, and the highest quality entangled states yet measured in both polarisation and spatial modes. I also report the first realisation of complete hyperentanglement, and a full, black-box tomography of a 36-dimensional two-photon state—the largest system to be characterised in this way to date. In my final experiment, I model and implement a new architecture for a controlled-Z gate which is much simpler to align than previous implementations. This gate requires only one non-classical interference condition, the visibility of which is the main limitation to its performance. I show that the gate operates effectively as a means of both creating entanglement and discriminating between the four elements in a basis of maximally entangled, Bell-type states. Indeed, its observed performance as a Bell analyser would be sufficient to build a quantum state teleporter which would guarantee that the recipient would be left with a better copy of an unknown input state than any eavesdropper. In a series of numerical simulations, I investigate some of the practicalities that arise when using tomographic reconstruction techniques, including how to estimate errors, which measurements to make and what is actually the optimal reconstruction. In particular, I show that tomographies perform better when based on the results from over-complete sets of measurements. Finally, I discuss the important issue of how to compare two processes, particularly when trying to assess the quality of a measured process by comparing it to some expected ideal. Judging possible candidate measures against a set of experimentally and theoretically motivated
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many areas of theoretical quantum information science, including quantum error correction, quantum cryptography, and quantum algorithms. We first investigate the equivalence classes of a particular class of entangled states (known as graph states due to their association with mathematical graphs) under local operations. We prove that for graph states corresponding to graphs with neither cycles of length 3 nor 4, the equivalence classes can be characterized in a very simple way. We also present software for analyzing and manipulating graph states. We then study quantum error-correcting codes whose codewords are highly entangled states. An important area of investigation concerning QECCs is to determine which resources are necessary in order to carry out any computation on the code to an arbitrary degree of accuracy, while simultaneously maintaining a high degree of resistance to noise. We prove that transversal gates, which are designed to prevent the propagation of errors through a system, are insufficient to achieve universal computation on almost all QECCs. Finally, we study the problem of creating efficient quantum circuits for creating entangling measurements. Entangling measurements can be used to harness the apparent extra computing power of quantum systems by allowing us to extract information about the global, collective properties of a quantum state using local measurements. We construct explicit quantum circuits that create entangling measurements, and show that these circuits scale polynomially in the input parameters.
Quantifying the accuracy of logical gates is paramount in approximate error correction, where perfect implementations are often unachievable with the available set of physical operations. To this end, we introduce a single scalar quantity we call the (composable) logical gate error. It captures both the deviation of the logical action from the desired target gate as well as leakage out of the code space. It is subadditive under successive application of gates, providing a simple means for analyzing circuits. We show how to bound the composable logical gate error in terms of matrix elements of physical unitaries between (approximate) logical computational basis states. In the continuous-variable context, this sidesteps the need for computing energy-bounded norms. As an example, we study the composable logical gate error for linear optics implementations of Paulis and Cliffords in approximate Gottesman-Kitaev-Preskill (GKP) codes. We find that the logical gate error for implementations of Paulis depends linearly on the squeezing parameter. This implies that their accuracy improves monotonically with the amount of squeezing. For some Cliffords, however, linear optics implementations which are exact for ideal GKP codes fail in the approximate case: they have a constant logical gate error even in the limit of infinite squeezing. This is consistent with previous results about the limitations of certain gate implementations for approximate GKP codes. It shows that findings applicable to ideal GKP codes do not always translate to the realm of physically realizable approximate GKP codes.