Arbitrary Quantum Computation Research Articles

Demonstration of hypergraph-state quantum information processing

Complex entangled states are the key resources for measurement-based quantum computations, which is realised by performing a sequence of measurements on initially entangled qubits. Executable quantum algorithms in the graph-state quantum computing model are determined by the entanglement structure and the connectivity of entangled qubits. By generalisation from graph-type entanglement in which only the nearest qubits interact to a new type of hypergraph entanglement in which any subset of qubits can be arbitrarily entangled via hyperedges, hypergraph states represent more general resource states that allow arbitrary quantum computation with Pauli universality. Here we report experimental preparation, certification and processing of complete categories of four-qubit hypergraph states under the principle of local unitary equivalence, on a fully reprogrammable silicon-photonic quantum chip. Genuine multipartite entanglement for hypergraph states is certificated by the characterisation of entanglement witness, and the observation of violations of Mermin inequalities without any closure of distance or detection loopholes. A basic measurement-based protocol and an efficient resource state verification by color-encoding stabilizers are implemented with local Pauli measurement to benchmark the building blocks for hypergraph-state quantum computation. Our work prototypes hypergraph entanglement as a general resource for quantum information processing.

QEnclave - A practical solution for secure quantum cloud computing

We introduce a secure hardware device named a QEnclave that can secure the remote execution of quantum operations while only using classical controls. This device extends to quantum computing from the classical concept of a secure enclave that isolates a computation from its environment to provide privacy and tamper-resistance. Remarkably, our QEnclave only performs single qubit rotations but can nevertheless be used to secure an arbitrary quantum computation even if the qubit source is controlled by an adversary. More precisely, by attaching a QEnclave to a quantum computer, a remote client controlling the QEnclave can securely delegate its computation to the server solely using classical communication. We investigate the security of our QEnclave by modeling it as an ideal functionality named remote state rotation (RSR). We show that this resource, similar to the previously introduced functionality of remote state preparation, allows blind delegated quantum computing with perfect security. Our proof under the Cryptography framework shows the construction of remote state preparation from remote state rotation while preserving security. An immediate consequence is the weakening of the requirements for blind delegated computation. While previous delegated protocols relied on a client that can either generate or measure quantum states, we show that this same functionality can be achieved with a client that only transforms quantum states without generating or measuring them.

Universal fault-tolerant quantum computing with stabilizer codes

The quantum logic gates used in the design of a quantum computer should be both universal, meaning arbitrary quantum computations can be performed, and fault-tolerant, meaning the gates keep errors from cascading out of control. A number of no-go theorems constrain the ways in which a set of fault-tolerant logic gates can be universal. These theorems are very restrictive, and conventional wisdom holds that a universal fault-tolerant logic gate set cannot be implemented natively, requiring us to use costly distillation procedures for quantum computation. Here, we present a general framework for universal fault-tolerant logic with stabiliser codes, together with a no-go theorem that reveals the very broad conditions constraining such gate sets. Our theorem applies to a wide range of stabiliser code families, including concatenated codes and conventional topological stabiliser codes such as the surface code. The broad applicability of our no-go theorem provides a new perspective on how the constraints on universal fault-tolerant gate sets can be overcome. In particular, we show how non-unitary implementations of logic gates provide a general approach to circumvent the no-go theorem, and we present a rich landscape of constructions for logic gate sets that are both universal and fault-tolerant. That is, rather than restricting what is possible, our no-go theorem provides a signpost to guide us to new, efficient architectures for fault-tolerant quantum computing.

A Secure Multiparty Quantum Homomorphic Encryption Scheme

The significant advantage of the quantum homomorphic encryption scheme is to ensure the perfect security of quantum private data. In this paper, a novel secure multiparty quantum homomorphic encryption scheme is proposed, which can complete arbitrary quantum computation on the private data of multiple clients without decryption by an almost dishonest server. Firstly, each client obtains a secure encryption key through the measurement device independent quantum key distribution protocol and encrypts the private data by using the encryption operator and key. Secondly, with the help of the almost dishonest server, the non-maximally entangled states are pre-shared between the client and the server to correct errors in the homomorphic evaluation of T gates, so as to realize universal quantum circuit evaluation on encrypted data. Thirdly, from the perspective of the application scenario of secure multi-party computation, this work is based on the probabilistic quantum homomorphic encryption scheme, allowing multiple parties to delegate the server to perform the secure homomorphic evaluation. The operation and the permission to access the data performed by the client and the server are clearly pointed out. Finally, a concrete security analysis shows that the proposed multiparty quantum homomorphic encryption scheme can securely resist outside and inside attacks.

Experimental accreditation of outputs of noisy quantum computers

We provide and experimentally demonstrate an accreditation protocol that upper-bounds the variation distance between noisy and noiseless probability distributions of the outputs of arbitrary quantum computations. We accredit the outputs of twenty-four quantum circuits executed on programmable superconducting hardware, ranging from depth nine circuits on ten qubits to depth twenty-one circuits on four qubits. Our protocol requires implementing the "target" quantum circuit along with a number of random Clifford circuits and subsequently post-processing the outputs of these Clifford circuits. Importantly, the number of Clifford circuits is chosen to obtain the bound with the desired confidence and accuracy, and is independent of the size and nature of the target circuit. We thus demonstrate a practical and scalable method of ascertaining the correctness of the outputs of arbitrary-sized noisy quantum computers--the ultimate arbiter of the utility of the computer itself.

Blinding quantum computation using alternative sources

Quantum computation has seen rapid progress in the past years. Due to implementation complexity and cost, cloud-based quantum computing is strongly believed to be the most feasible framework for individual users. Universal blind quantum computing (UBQC) provides the protocol for secure delegation of arbitrary quantum computations and has received significant attention. However, one of the major challenges in UBQC is a secure and reliable transmission of a quantum state over a long distance. Herein, we improve the efficiency of UBQC using alternative photon sources. Our analysis shows that a heralded single-photon source can significantly improve the transmitted distance of UBQC and a modified coherent source can reduce the required transmitted number of pulses. Furthermore, we study the finite-data-size effect, which is a crucial for real-world applications. Our proposed scheme can be a promising alternative for the future development of UBQC.

Universal quantum circuit evaluation on encrypted data using probabilistic quantum homomorphic encryption scheme* *Project supported by the Fundamental Research Funds for the Central Universities (Grant No. 2019XDA02) and the Scientific Research Foundation of North China University of Technology.

Homomorphic encryption has giant advantages in the protection of privacy information. In this paper, we present a new kind of probabilistic quantum homomorphic encryption scheme for the universal quantum circuit evaluation. Firstly, the pre-shared non-maximally entangled states are utilized as auxiliary resources, which lower the requirements of the quantum channel, to correct the errors in non-Clifford gate evaluation. By using the set synthesized by Clifford gates and T gates, it is feasible to perform the arbitrary quantum computation on the encrypted data. Secondly, our scheme is different from the previous scheme described by the quantum homomorphic encryption algorithm. From the perspective of application, a two-party probabilistic quantum homomorphic encryption scheme is proposed. It is clear what the computation and operation that the client and the server need to perform respectively, as well as the permission to access the data. Finally, the security of probabilistic quantum homomorphic encryption scheme is analyzed in detail. It demonstrates that the scheme has favorable security in three aspects, including privacy data, evaluated data and encryption and decryption keys.

Quantum computation with machine-learning-controlled quantum stuff

We formulate the control over quantum matter, so as to perform arbitrary quantum computation, as an optimization problem. We then provide a schematic machine learning algorithm for its solution. Imagine a long strip of ‘quantum stuff’, endowed with certain assumed physical properties, and equipped with regularly spaced wires to provide input settings and to read off outcomes. After showing how the corresponding map from settings to outcomes can be construed as a quantum circuit, we provide a machine learning framework to tomographically ‘learn’ which settings implement the members of a universal gate set. To that end, we devise a loss function measuring how badly a proposed encoding has failed to implement a given circuit, and prove the existence of ‘tomographically complete’ circuit sets: should a given encoding minimize the loss function for each member of such a set, it also will for an arbitrary circuit. At optimum, arbitrary quantum gates, and thus arbitrary quantum programs, can be implemented using the stuff.

Remote Blind State Preparation with Weak Coherent Pulses in the Field.

Quantum computing has seen tremendous progress in past years. Due to implementation complexity and cost, the future path of quantum computation is strongly believed to delegate computational tasks to powerful quantum servers on the cloud. Universal blind quantum computing (UBQC) provides the protocol for the secure delegation of arbitrary quantum computations, and it has received significant attention. However, a great challenge in UBQC is how to transmit a quantum state over a long distance securely and reliably. Here, we solve this challenge by proposing a resource-efficient remote blind qubit preparation (RBQP) protocol, with weak coherent pulses for the client to produce, using a compact and low-cost laser. We experimentally verify a key step of RBQP-quantum nondemolition measurement-in the field test over 100km of fiber. Our experiment uses a quantum teleportation setup in the telecom wavelength and generates 1000secure qubits with an average fidelity of (86.9±1.5)%, which exceeds the quantum no-cloning fidelity of equatorial qubit states. The results prove the feasibility of UBQC over long distances, and thus serves as a key milestone towards secure cloud quantum computing.

Designing a cavity-mediated quantum cphase gate between NV spin qubits in diamond

While long spin coherence times and efficient single-qubit quantum control have been implemented successfully in nitrogen-vacancy (NV) centers in diamond, the controlled coupling of remote NV spin qubits remains challenging. Here, we propose and analyze a controlled-phase (CPHASE) gate for the spins of two NV centers embedded in a common optical cavity and driven by two off-resonant lasers. In combination with previously demonstrated single-qubit gates, CPHASE allows for arbitrary quantum computations. The coupling of the NV spin to the cavity mode is based upon Raman transitions via the NV excited states and can be controlled with the laser intensities and relative phase. We find characteristic laser frequencies at which the scattering amplitude of a laser photon into the cavity mode is strongly dependent on the NV center spin. A scattered photon can be reabsorbed by another selectively driven NV center and generate a conditional phase (CPHASE) gate. Gate times around 200 ns are within reach, nearly three orders of magnitude shorter than typical NV spin coherence times of around 10 microseconds. The separation between the two interacting NV centers is only limited by the extension of the cavity.

Reliable quantum circuits have defects

The first large-scale practical quantum computer is within reach. Coming to grips with the strategy and challenges of preparing reliable executions of an arbitrary quantum computation is not difficult. In fact, defects are good.

Quantum computing on encrypted data

The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here, we present an efficient solution to the quantum analogue of this problem that enables arbitrary quantum computations to be carried out on encrypted quantum data. We prove that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation. We experimentally demonstrate, using single photons and linear optics, the encryption and decryption scheme on a set of gates sufficient for arbitrary quantum computations. As our protocol requires few extra resources compared with other schemes it can be easily incorporated into the design of future quantum servers. These results will play a key role in enabling the development of secure distributed quantum systems.

Optimal Blind Quantum Computation

Blind quantum computation allows a client with limited quantum capabilities to interact with a remote quantum computer to perform an arbitrary quantum computation, while keeping the description of that computation hidden from the remote quantum computer. While a number of protocols have been proposed in recent years, little is currently understood about the resources necessary to accomplish the task. Here, we present general techniques for upper and lower bounding the quantum communication necessary to perform blind quantum computation, and use these techniques to establish concrete bounds for common choices of the client's quantum capabilities. Our results show that the universal blind quantum computation protocol of Broadbent, Fitzsimons, and Kashefi, comes within a factor of 8/3 of optimal when the client is restricted to preparing single qubits. However, we describe a generalization of this protocol which requires exponentially less quantum communication when the client has a more sophisticated device.

Quantum algorithms for classical lattice models

We give efficient quantum algorithms to estimate the partition function of (i) the six-vertex model on a two-dimensional (2D) square lattice, (ii) the Ising model with magnetic fields on a planar graph, (iii) the Potts model on a quasi-2D square lattice and (iv) the lattice gauge theory on a 3D square lattice. Moreover, we prove that these problems are BQP-complete, that is, that estimating these partition functions is as hard as simulating arbitrary quantum computation. The results are proven for a complex parameter regime of the models. The proofs are based on a mapping relating partition functions to quantum circuits introduced by Van den Nest et al (2009 Phys. Rev. A 80 052334) and extended here.

Block-based quantum-logic synthesis

In this paper, the problem of constructing an efficient quantum circuit for the imple-mentation of an arbitrary quantum computation is addressed. To this end, a basic blockbased on the cosine-sine decomposition method is suggested which contains l qubits.In addition, a previously proposed quantum-logic synthesis method based on quantumShannon decomposition is recursively applied to reach unitary gates over l qubits. Then,the basic block is used and some optimizations are applied to remove redundant gates.It is shown that the exact value of l affects the number of one-qubit and CNOT gates inthe proposed method. In comparison to the previous synthesis methods, the value of l isexamined consequently to improve either the number of CNOT gates or the total numberof gates. The proposed approach is further analyzed by considering the nearest neighborlimitation. According to our evaluation, the number of CNOT gates is increased by atmost a factor of 5/3 if the nearest neighbor interaction is applied.

Block-based quantum-logic synthesis

In this paper, the problem of constructing an efficient quantum circuit for the implementation of an arbitrary quantum computation is addressed. To this end, a basic block based on the cosine-sine decomposition method is suggested which contains $l$ qubits. In addition, a previously proposed quantum-logic synthesis method based on quantum Shannon decomposition is recursively applied to reach unitary gates over $l$ qubits. Then, the basic block is used and some optimizations are applied to remove redundant gates. It is shown that the exact value of $l$ affects the number of one-qubit and CNOT gates in the proposed method. In comparison to the previous synthesis methods, the value of $l$ is examined consequently to improve either the number of CNOT gates or the total number of gates. The proposed approach is further analyzed by considering the nearest neighbor limitation. According to our evaluation, the number of CNOT gates is increased by at most a factor of $\frac{5}{3}$ if the nearest neighbor interaction is applied.

QUANTUM COMPUTING WITH NON-ABELIAN QUASIPARTICLES

In topological quantum computation quantum information is stored in exotic states of matter which are intrinsically protected from decoherence, and quantum operations are carried out by dragging particle-like excitations (quasiparticles) around one another in two space dimensions. The resulting quasiparticle trajectories define world-lines in three dimensional space-time, and the corresponding quantum operations depend only on the topology of the braids formed by these world-lines. We describe recent work showing how to find braids which can be used to perform arbitrary quantum computations using a specific kind of quasiparticle (those described by the so-called Fibonacci anyon model) which are thought to exist in the experimentally observed ν = 12/5 fractional quantum Hall state.

Arbitrary two-qubit computation in 23 elementary gates

We address the problem of constructing quantum circuits to implement an arbitrary two-qubit quantum computation. We pursue circuits without ancilla qubits and as small a number of elementary quantum gates as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least $17$ gates: $15$ one-qubit rotations and $2$ controlled-NOT (CNOT) gates. We also constructively prove a worst-case upper bound of $23$ elementary gates, of which at most four (CNOT gates) entail multiqubit interactions. Our analysis shows that synthesis algorithms suggested in previous work, although more general, entail larger quantum circuits than ours in the special case of two qubits. One such algorithm has a worst case of $61$ gates, of which $18$ may be CNOT gates.

Quantum computation and the production of entangled photons using coupled quantum dots

We review recent theoretical progress on the use of electron spins as qubits in coupled semiconductor quantum dots for quantum information processing. We discuss the spin exchange mechanism and its microscopic origin in both laterally and vertically tunnel-coupled quantum dots and explain how it can be used to implement the quantum XOR gate which, in combination with single spin rotations, allows to perform arbitrary quantum computations. In addition to their functionality as a quantum gate, coupled quantum dots can act as a source for photon pairs in entangled polarization states which are useful for quantum communication. We describe a mechanism for the production of such entangled photon pairs via a biexciton state in tunnel-coupled quantum dots.

A Possible Strategy to Defeat Decoherence in Quantum Computation: The Role of Symmetries, Dynamical Algebras, and All That

The question is addressed whether in the frame of Error Avoiding Codes one can devise strategies whereby a universal set of gates can be constructed allowing for arbitrary quantum computation [in its full extent, from input system preparation, through computation implementation, to output measurement] to be completely performed within the code.