scholarly journals Delegating private quantum computations

2015 ◽  
Vol 93 (9) ◽  
pp. 941-946 ◽  
Author(s):  
Anne Broadbent
Keyword(s):  
Quantum Computation ◽  
Quantum Communication ◽  
Quantum Gates ◽  
Classical Communication ◽  
Encrypted Data ◽  
Client Server ◽  
Quantum Register ◽  
Simulation Based ◽  
Clifford Group ◽  
Quantum Computations

We give a protocol for the delegation of quantum computation on encrypted data. More specifically, we show that in a client–server scenario, where the client holds the encryption key for an encrypted quantum register held by the server, it is possible for the server to perform a universal set of quantum gates on the quantum data. All Clifford group gates are non-interactive, while the remaining non-Clifford group gate that we implement (the π/8 gate) requires the client to prepare and send a single random auxiliary qubit (chosen among four possibilities), and exchange classical communication. This construction improves on previous work, which requires either multiple auxiliary qubits or two-way quantum communication. Using a reduction to an entanglement-based protocol, we show privacy against any adversarial server according to a simulation-based security definition.

scholarly journals The robustness of magic state distillation against errors in Clifford gates

2013 ◽  
Vol 13 (5&6) ◽  
pp. 361-378
Author(s):  
Tomas Jochym-O'Connor ◽  
Yafei Yu ◽  
Bassam Helou ◽  
Raymond Laflamme
Keyword(s):  
Fault Tolerance ◽  
Quantum Computation ◽  
Large Scale ◽  
Error Rates ◽  
Noise Model ◽  
Quantum Gates ◽  
Small Scale ◽  
Natural Class ◽  
Clifford Group ◽  
Universal Quantum

Quantum error correction and fault-tolerance have provided the possibility for large scale quantum computations without a detrimental loss of quantum information. A very natural class of gates for fault-tolerant quantum computation is the Clifford gate set and as such their usefulness for universal quantum computation is of great interest. Clifford group gates augmented by magic state preparation give the possibility of simulating universal quantum computation. However, experimentally one cannot expect to perfectly prepare magic states. Nonetheless, it has been shown that by repeatedly applying operations from the Clifford group and measurements in the Pauli basis, the fidelity of noisy prepared magic states can be increased arbitrarily close to a pure magic state~\cite{Bravyi}. We investigate the robustness of magic state distillation to perturbations of the initial states to arbitrary locations in the Bloch sphere due to noise. Additionally, we consider a depolarizing noise model on the quantum gates in the decoding section of the distillation protocol and demonstrate its effect on the convergence rate and threshold value. Finally, we establish that faulty magic state distillation is more efficient than fault-tolerance-assisted magic state distillation at low error rates due to the large overhead in the number of quantum gates and qubits required in a fault-tolerance architecture. The ability to perform magic state distillation with noisy gates leads us to conclude that this could be a realistic scheme for future small-scale quantum computing devices as fault-tolerance need only be used in the final steps of the protocol.

scholarly journals Generation of elementary gates and Bell’s states using controlled adiabatic evolutions

2019 ◽  
Vol 17 (03) ◽  
pp. 1950020
Author(s):  
Abderrahim Benmachiche ◽  
Ali Sellami ◽  
Sherzod Turaev ◽  
Derradji Bahloul ◽  
Azeddine Messikh ◽  
...  
Keyword(s):  
Quantum Computation ◽  
Open Systems ◽  
Circuit Model ◽  
Quantum Gates ◽  
Single Quantum ◽  
New Model ◽  
Adiabatic Quantum Computation ◽  
Usual Quantum

Fundamental quantum gates can be implemented effectively using adiabatic quantum computation or circuit model. Recently, Hen combined the two approaches to introduce a new model called controlled adiabatic evolutions [I. Hen, Phys. Rev. A, 91(2) (2015) 022309]. This model was specifically designed to implement one and two-qubit controlled gates. Later, Santos extended Hen’s work to implement [Formula: see text]-qubit controlled gates [A. C. Santos and M. S. Sarandy, Sci. Rep., 5 (2015) 15775]. In this paper, we discuss the implementation of each of the usual quantum gates, as well as demonstrate the possibility of preparing Bell’s states using the controlled adiabatic evolutions approach. We conclude by presenting the fidelity results of implementing single quantum gates and Bell’s states in open systems.

EFFICIENT ALGORITHM FOR INITIALIZING AMPLITUDE DISTRIBUTION OF A QUANTUM REGISTER

2001 ◽  
Vol 15 (27) ◽  
pp. 1259-1264 ◽  
Author(s):  
M. ANDRECUT ◽  
M. K. ALI
Keyword(s):  
Information Processing ◽  
Quantum Information ◽  
Quantum Computation ◽  
Quantum State ◽  
Efficient Algorithm ◽  
Quantum Information Processing ◽  
Amplitude Distribution ◽  
Quantum Register

The preparation of a quantum register in an arbitrary superposed quantum state is an important operation for quantum computation and quantum information processing. Here, we present an efficient algorithm which requires a polynomial number of elementary operations for initializing the amplitude distribution of a quantum register.

scholarly journals Conceptual Framework for Quantum Affective Computing and Its Use in Fusion of Multi-Robot Emotions

2020 ◽  
Author(s):  
Fei Yan ◽  
Abdullah Iliyasu ◽  
Kaoru Hirota
Keyword(s):  
Emotional Intelligence ◽  
Quantum Mechanics ◽  
Conceptual Framework ◽  
Quantum Measurement ◽  
Affective Computing ◽  
Quantum Gates ◽  
Superposition State ◽  
Unitary Operators ◽  
Computing Paradigm ◽  
Simulation Based

This study presents a modest attempt to interpret, formulate, and manipulate emotion of robots within the precepts of quantum mechanics. Our proposed framework encodes the emotion information as a superposition state whilst unitary operators are used to manipulate the transition of the emotion states which are recovered via appropriate quantum measurement operations. The framework described provides essential steps towards exploiting the potency of quantum mechanics in a quantum affective computing paradigm. Further, the emotions of multi-robots in a specified communication scenario are fused using quantum entanglement thereby reducing the number of qubits required to capture the emotion states of all the robots in the environment, and fewer quantum gates are needed to transform the emotion of all or part of the robots from one state to another. In addition to the mathematical rigours expected of the proposed framework, we present a few simulation-based demonstrations to illustrate its feasibility and effectiveness. This exposition is an important step in the transition of formulations of emotional intelligence to the quantum era.

A quantum repeater based on decoherence free subspaces

2008 ◽  
Vol 8 (5) ◽  
pp. 468-488
Author(s):  
U. Dorner ◽  
A. Klein ◽  
D. Jaksch
Keyword(s):  
Quantum Communication ◽  
Waiting Times ◽  
Entanglement Swapping ◽  
Quantum Gates ◽  
Quantum Repeater ◽  
Decoherence Free Subspace ◽  
Decoherence Free Subspaces

We study a quantum repeater which is based on decoherence free quantum gates recently proposed by Klein {\it et al.} [Phys. Rev. A, {\bf 73}, 012332 (2006)]. A number of operations on the decoherence free subspace in this scheme makes use of an ancilla qubit, which undergoes dephasing and thus introduces decoherence to the system. We examine how this decoherence affects entanglement swapping and purification as well as the performance of a quantum repeater. We compare the decoherence free quantum repeater with a quantum repeater based on qubits that are subject to decoherence and show that it outperforms the latter when decoherence due to long waiting times of conventional qubits becomes significant. Thus, a quantum repeater based on decoherence free subspaces is a possibility to greatly improve quantum communication over long or even intercontinental distances.

Superdense Coding and Quantum Teleportation

2006 ◽  
Author(s):  
Phillip Kaye ◽  
Raymond Laflamme ◽  
Michele Mosca
Keyword(s):  
Quantum Teleportation ◽  
Communication Channel ◽  
Quantum Communication ◽  
Communication Protocols ◽  
Bell State ◽  
Third Party ◽  
Classical Communication ◽  
Superdense Coding ◽  
Communication Task ◽  
Epr Pair

We are now ready to look at our first protocols for quantum information. In this section, we examine two communication protocols which can be implemented using the tools we have developed in the preceding sections. These protocols are known as superdense coding and quantum teleportation. Both are inherently quantum: there are no classical protocols which behave in the same way. Both involve two parties who wish to perform some communication task between them. In descriptions of such communication protocols (especially in cryptography), it is very common to name the two parties ‘Alice’ and ‘Bob’, for convenience. We will follow this tradition. We will repeatedly refer to communication channels. A quantum communication channel refers to a communication line (e.g. a fiberoptic cable), which can carry qubits between two remote locations. A classical communication channel is one which can carry classical bits (but not qubits).1 The protocols (like many in quantum communication) require that Alice and Bob initially share an entangled pair of qubits in the Bell state The above Bell state is sometimes referred to as an EPR pair. Such a state would have to be created ahead of time, when the qubits are in a lab together and can be made to interact in a way which will give rise to the entanglement between them. After the state is created, Alice and Bob each take one of the two qubits away with them. Alternatively, a third party could create the EPR pair and give one particle to Alice and the other to Bob. If they are careful not to let them interact with the environment, or any other quantum system, Alice and Bob’s joint state will remain entangled. This entanglement becomes a resource which Alice and Bob can use to achieve protocols such as the following. Suppose Alice wishes to send Bob two classical bits of information. Superdense coding is a way of achieving this task over a quantum channel, requiring only that Alice send one qubit to Bob. Alice and Bob must initially share the Bell state Suppose Alice is in possession of the first qubit and Bob the second qubit.

scholarly journals Improved Resource State for Verifiable Blind Quantum Computation

Entropy ◽  
2020 ◽  
Vol 22 (9) ◽  
pp. 996
Author(s):  
Qingshan Xu ◽  
Xiaoqing Tan ◽  
Rui Huang
Keyword(s):  
Quantum Computing ◽  
Quantum Computation ◽  
Fault Tolerant ◽  
Maximal Degree ◽  
Recent Advances ◽  
Quantum Computations ◽  
Blind Quantum Computation ◽  
Computation Graph ◽  
Resource State

Recent advances in theoretical and experimental quantum computing raise the problem of verifying the outcome of these quantum computations. The recent verification protocols using blind quantum computing are fruitful for addressing this problem. Unfortunately, all known schemes have relatively high overhead. Here we present a novel construction for the resource state of verifiable blind quantum computation. This approach achieves a better verifiability of 0.866 in the case of classical output. In addition, the number of required qubits is 2N+4cN, where N and c are the number of vertices and the maximal degree in the original computation graph, respectively. In other words, our overhead is less linear in the size of the computational scale. Finally, we utilize the method of repetition and fault-tolerant code to optimise the verifiability.

Sign in / Sign up

Export Citation Format

Share Document