The goal of this thesis is to explore the extent and limitations of existing techniques for the verification and validation of quantum systems, and to develop new techniques that are: (i) more efficient; (ii) mathematically rigorous; and (iii) practically implementable.We give a survey of contemporary techniques and protocols for the verification and characterisation of quantum states and processes, before deriving efficient protocols of our own.We construct an optimally efficient protocol constructed from local measurements for verifying that the output of an experiment agrees with a known target state, for both two-qubit and stabilizer states.We then show that this protocol is also optimal for the task of estimating the fidelity to a known target state, and to analyse its effectiveness we run both the optimal protocol and its closest competitors on a silicon-based photonic chip designed to produce arbitrary two-qubit states.We discuss the validation of quantum systems in two contexts.Firstly, we validate a quantum computational advantage over classical computers when faced with the task of producing solutions to differential equations via the finite element method.Secondly, we provide a blueprint for the validation of quantum effects in general relativistic systems, by outlining a space-based experiment designed to test the interplay between the two theories.i Linden, for being coherent, correlated, and only marginally mixed; and for being a powerful resource for both error correction and quantum steering.I must also thank my friends and peers, whose support was invaluable to my sanity over the last four years: Chris Cade and Stephen Piddock, for the sofas and cakes; Euan Allen, Matt Day and Sam Morley-Short, for the beers and cheese.I'd also like to express my gratitude to colleagues, collaborators and friends in the CDT; and to the CDT management team themselves, for affording me the opportunity to act as a lab rat in their madcap experiment, and for sufficiently baiting the maze to get me out the other end.And finally, my greatest love and thanks are reserved for Jen, whose affection and companionship I am eternally grateful for.
The goal of this thesis is to explore the extent and limitations of existing techniques for the verification and validation of quantum systems, and to develop new techniques that are: (i) more efficient; (ii) mathematically rigorous; and (iii) practically implementable.We give a survey of contemporary techniques and protocols for the verification and characterisation of quantum states and processes, before deriving efficient protocols of our own.We construct an optimally efficient protocol constructed from local measurements for verifying that the output of an experiment agrees with a known target state, for both two-qubit and stabilizer states.We then show that this protocol is also optimal for the task of estimating the fidelity to a known target state, and to analyse its effectiveness we run both the optimal protocol and its closest competitors on a silicon-based photonic chip designed to produce arbitrary two-qubit states.We discuss the validation of quantum systems in two contexts.Firstly, we validate a quantum computational advantage over classical computers when faced with the task of producing solutions to differential equations via the finite element method.Secondly, we provide a blueprint for the validation of quantum effects in general relativistic systems, by outlining a space-based experiment designed to test the interplay between the two theories.i Linden, for being coherent, correlated, and only marginally mixed; and for being a powerful resource for both error correction and quantum steering.I must also thank my friends and peers, whose support was invaluable to my sanity over the last four years: Chris Cade and Stephen Piddock, for the sofas and cakes; Euan Allen, Matt Day and Sam Morley-Short, for the beers and cheese.I'd also like to express my gratitude to colleagues, collaborators and friends in the CDT; and to the CDT management team themselves, for affording me the opportunity to act as a lab rat in their madcap experiment, and for sufficiently baiting the maze to get me out the other end.And finally, my greatest love and thanks are reserved for Jen, whose affection and companionship I am eternally grateful for.
The promise of scalable quantum technology appears more realistic, after recent advances in both theory and experiment. Assuming a quantum computer is developed, the task of verifying the correctness of its outcome becomes crucial. Unfortunately, for a system that involves many particles, predicting its evolution via classical simulation becomes intractable. Moreover, verification of the outcome by computational methods, i.e. involving a classical witness, is believed inefficient for the hardest problems solvable by a quantum computer. A feasible alternative to verify quantum computation is via cryptographic methods, where an untrusted prover has to convince a weak verifier for the correctness of his outcome. This is the approach we take in this thesis. In the most standard configuration the prover is capable of computing all polynomial-time quantum circuits and the verifier is restricted to classical with very modest quantum power. The goal of existing verification protocols is to reduce the quantum requirements for the verifier - ideally making it purely classical - and reduce the communication complexity. In Part II we propose a composition of two existing verification protocols [Fitzsimons and Kashefi, 2012], [Aharonov et al., 2010] that achieves quadratic improvement in communication complexity, while keeping the quantum requirements for the verifier modest. Along this result, several new techniques are proposed, including the generalization of [Fitzsimons and Kashefi, 2012] to prime dimensions. In Part III we discuss the idea of model-specific quantum verification, where the prover is restricted to intermediate quantum power, i.e. between full-fledged quantum and purely classical, thus more feasible experimentally. As a proof of principle we propose a verification protocol for the One-Pure-Qubit computer [Knill and Laflamme, 1998], which tolerates noise and is capable of computing hard problems such as large matrix trace estimation. The verification protocol is an adaptation of [Fitzsimons and Kashefi, 2012] running on Measurement-Based Quantum Computing with newly proved properties of the underlying resources. Connections of quantum verification to other security primitives are considered in Part IV. Authenticated quantum communication has been already proved to relate to quantum verification. We expand this by proposing a quantum authentication protocol derived from [Fitzsimons and Kashefi, 2012] and discuss implications to verification with purely classical verifier. Connections between quantum security primitives, namely blindness - prover does not learn the computation -, and classical security are considered in Part V. We introduce a protocol where a client with restricted classical resources computes blindly a universal classical gate with the help of an untrusted server, by adding modest quantum capabilities to both client and server. This example of quantum-enhanced classical security we prove to be a task classically impossible.
This thesis presents multiple advances in the construction of noise-resistant quantum computers. In order to bridge the gap between abstract theory and practical experiments, my research encompasses a wide range of subfields within quantum computing, including error correction, silicon spin qubit physics and error mitigation. Firstly, I demonstrate that large-scale defects affecting entire regions of an error correcting code, such as cosmic rays or manufacturing defects, do not necessarily constitute a fundamental obstacle. Conversely, bespoke protocols that employ code deformation can be utilised to mitigate their impact, at a moderate resource overhead. Secondly, I investigate the feasibility of building a fault-tolerant silicon spin qubit quantum computer in the near term. I demonstrate that arranging the qubits in a 2×N array represents an effective methodology for the construction of error correcting codes, provided that the qubits can be shuttled with high fidelity. This expected characteristic of silicon spins can thus be utilised to circumvent the construction of complex dense 2D grids of qubits. Subsequently, I build upon the existing literature on the implementation of low-noise gates in silicon spin qubits, at the physical level this time. Specifically, I design a protocol for the individual control of silicon spin qubits, without the need for local magnetic fields targeting every qubit in the device. This simplification enables efficient control of silicon spins, whose single-qubit addressability was an identified bottleneck. Finally, I complement the above research with an error mitigation scheme targeted at the evaluation of eigenvalues with an early-fault-tolerant quantum computers. This scheme promises to alleviate the stringent resource costs of error correction, thereby paving the way for fault-tolerance in a nearer future.
Quantum technologies have progressed beyond the laboratory setting and are beginning to make an impact on industrial development. The construction of practical, general purpose quantum computers has been challenging, to say the least. But quantum cryptographic and communication devices have been available in the commercial marketplace for a few years. Quantum networks have been built in various cities around the world, and plans are afoot to launch a dedicated satellite for quantum communication. Such new technologies demand rigorous analysis and verification before they can be trusted in safety and security-critical applications. In this thesis we investigate the theory and practice of equivalence checking of quantum information systems. We present a tool, Quantum Equivalence Checker (QEC), which uses a concurrent language for describing quantum systems, and performs verification by checking equivalence between specification and implementation. For our process algebraic language CCSq, we define an operational semantics and a superoperator semantics. While in general, simulation of quantum systems using current computing technology is infeasible, we restrict ourselves to the stabilizer formalism, in which there are efficient simulation algorithms and representation of quantum states. By using the stabilizer representation of quantum states we introduce various algorithms for testing equality of stabilizer states. In this thesis, we consider concurrent quantum protocols that behave functionally in the sense of computing a deterministic input-output relation for all interleavings of a concurrent system. Crucially, these input-output relations can be abstracted by superoperators, enabling us to take advantage of linearity. This allows us to analyse the behaviour of protocols with arbitrary input, by simulating their operation on a finite basis set consisting of stabilizer states. We present algorithms for the checking of functionality and equivalence of quantum protocols. Despite the limitations of the stabilizer formalism and also the range of protocols that can be analysed using equivalence checking, QEC is applied to specify and verify a variety of interesting and practical quantum protocols from quantum communication and quantum cryptography to quantum error correction and quantum fault tolerant computation, where for each protocol different sequential and concurrent model are defined in CCSq. We also explain the implementation details of the QEC tool and report on the experimental results produced by using it on the verification of a number of case studies.
In this thesis, we investigate the uses of entanglement and its verification in quantum communication. Typically, it is the presence of entanglement which allows quantum communication protocols to outperform their classical counterparts, or to achieve tasks which are infeasible with classical physics. Therefore, the verification of entanglement can provide fundamental tests to certify that experimental implementations of such protocols operate quantum mechanically. The main object here is to develop a verification procedure which is adaptable to a wide range of applications, and whose implementation has low requirements on experimental resources. We present such a procedure in the form of the Expectation Value Matrix. The structure of this thesis is as follows: Chapters 1 and 2 give a short introduction and background information on quantum theory and the quantum states of light. In particular, we discuss the basic postulates of quantum mechanics, quantum state discrimination, the description of quantum light and the homodyne detector. Chapter 3 gives a brief introduction to quantum information and in particular to entanglement, and we discuss the basics of quantum key distribution and teleportation. The general framework of the Expectation Value Matrix is introduced. The main matter of this thesis is contained in the subsequent three chapters, which describe different quantum communication protocols and the corresponding adaptation of the entanglement verification method. The subject of Chapter 4 is quantum key distribution, where the detection of entanglement is a means of excluding intercept-resend attacks, and the presence of quantum correlations in the raw data is a necessary precondition for the generation of secret key. We investigate a continuous-variable version of the two-state protocol and develop the Expectation Value Matrix method for such qubit-mode systems. Furthermore, we analyse the role of the phase reference with respect to the security of the protocol and raise awareness of a corresponding security threat. For this, we adapt the verification method to different settings of Stokes operator measurements. In Chapter 5, we investigate quantum memory channels and propose a fundamental bench- mark for these based on the verification of entanglement. After describing some physical effects which can be used for the coherent storage of light, we focus on the storage of squeezed light. This situation requires an extension of our verification procedure to sources of mixed input states. We propose such an extension, and give a detailed analysis of its application to squeezed thermal states, displaced thermal states and mixed qubit states. This is supplemented by finding the optimal entanglement-breaking channels for each of these situations, which provides us with an indication of the strength of the extension to our entanglement criterion. The subject of Chapter 6 is also the benchmarking of quantum memory or teleportation experiments. Considering a number of recently published benchmark criteria, we investigate the question which one is most useful to actual experiments. For this, a criterion must be both strong, i.e., easy to overcome, and it must be implementable with a reasonable amount of experimental resources. We first compare the different criteria for typical settings and sort them according to their resilience to excess noise. Then, we introduce a further improvement to the Expectation Value Matrix method, which results in the desired optimal benchmark criterion. Finally, we investigate naturally occurring phase fluctuations and find them to further simplify the implementation of our criterion. Thus, we formulate the first truly useful way of validating experiments for the quantum storage or transmission of light.
Quantum computers promise to offer a considerable speed-up in solving certain problems, compared to the best classical algorithms. In many instances, the gap between quantum and classical running times is conjectured to be exponential. While this is great news for those applications where quantum computers would provide such an advantage, it also raises a significant challenge: how can classical computers verify the correctness of quantum computations? In attempting to answer this question, a number of protocols have been developed in which a classical client (referred to as verifier) can interact with one or more quantum servers (referred to as provers) in order to certify the correctness of a quantum computation performed by the server(s). These protocols are of one of two types: either there are multiple non-communicating provers, sharing entanglement, and the verifier is completely classical; or, there is a single prover and the classical verifier has a device for preparing or measuring quantum states. The latter type of protocols are, arguably, more relevant to near term quantum computers, since having multiple quantum computers that share a large amount of entanglement is, from a technological standpoint, extremely challenging. Before the realisation of practical single-prover protocols, a number of challenges need to be addressed: how robust are these protocols to noise on the verifier's device? Can the protocols be made fault-tolerant without significantly increasing the requirements of the verifier? How do we know that the verifier's device is operating correctly? Could this device be eliminated completely, thus having a protocol with a fully classical verifier and a single quantum prover? Our work attempts to provide answers to these questions. First, we consider a single-prover verification protocol developed by Fitzsimons and Kashefi and show that this protocol is indeed robust with respect to deviations on the quantum state prepared by the verifier. We show that this is true even if those deviations are the result of a correlation with the prover's system. We then use this result to give a verification protocol which is device- independent. The protocol consists of a verifier with a measurement device and a single prover. Device-independence means that the verifier need not trust the measurement device (nor the prover) which can be assumed to be fully malicious (though not communicating with the prover). A key element in realising this protocol is a robust technique of Reichardt, Unger and Vazirani for testing, using non-local correlations, that two untrusted devices share a large number of entangled states. This technique is referred to as rigidity of non-local correlations. Our second result is to prove a rigidity result for a type of quantum correlations known as steering correlations. To do this, we first show that steering correlations can be used in order to certify maximally entangled states, in a setting in which each test is independent of the previous one. We also show that the fidelity with which we characterise the state, in this specific test, is optimal. We then improve the previous result by removing the independence assumption. This then leads to our desired rigidity result. We make use of it, in a similar fashion to the device-independent case, in order to give a verification protocol that is one-sided device-independent. The importance of this application is to show how different trust assumptions affect the efficiency of the protocol. Next, we describe a protocol for fault-tolerantly verifying quantum computations, with minimal "quantum requirements" for the verifier. Specifically, the verifier only requires a device for measuring single-qubit states. Both this device, and the prover's operations are assumed to be prone to errors. We show that under standard assumptions about the error model, it is possible to achieve verification of quantum computation using fault-tolerant principles. As a proof of principle, and to better illustrate the inner workings of the protocol, we describe a toy implementation of the protocol in a quantum simulator, and present the results we obtained, when running it for a small computation. Finally, we explore the possibility of having a verification protocol, with a classical verifier and a single prover, such that the prover is blind with respect to the verifier's computation. We give evidence that this is not possible. In fact, our result is only concerned with blind quantum computation with a classical client, and uses complexity theoretic results to argue why it is improbable for such a protocol to exist. We then use these complexity theoretic techniques to show that a client, with the ability to prepare and send quantum states to a quantum server, would not be able to delegate arbitrary NP problems to that server. In other words, even a client with quantum capabilities cannot exploit those capabilities to delegate the computation of NP problems, while keeping the input, to that computation, private. This is again true, provided certain complexity theoretic conjectures are true.
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