scholarly journals Secure assisted quantum computation

2005 ◽  
Vol 5 (6) ◽  
pp. 456-466
Author(s):  
A.M. Childs
Keyword(s):  
Quantum Computation ◽  
Quantum Computer ◽  
Universal Quantum

Suppose Alice wants to perform some computation that could be done quickly on a quantum computer, but she cannot do universal quantum computation. Bob can do universal quantum computation and claims he is willing to help, but Alice wants to be sure that Bob cannot learn her input, the result of her calculation, or perhaps even the function she is trying to compute. We describe a simple, efficient protocol by which Bob can help Alice perform the computation, but there is no way for him to learn anything about it. We also discuss techniques for Alice to detect whether Bob is honestly helping her or if he is introducing errors.

scholarly journals GEOMETRIC PHASES AND TOPOLOGICAL QUANTUM COMPUTATION

2003 ◽  
Vol 01 (01) ◽  
pp. 1-23 ◽  
Author(s):  
VLATKO VEDRAL
Keyword(s):  
Quantum Computation ◽  
Large Scale ◽  
Quantum Computer ◽  
Fault Tolerant ◽  
Geometric Phases ◽  
Quantum Phases ◽  
Topological Quantum ◽  
Universal Quantum ◽  
The Subject ◽  
Topological Quantum Computation

In the first part of this review we introduce the basics theory behind geometric phases and emphasize their importance in quantum theory. The subject is presented in a general way so as to illustrate its wide applicability, but we also introduce a number of examples that will help the reader understand the basic issues involved. In the second part we show how to perform a universal quantum computation using only geometric effects appearing in quantum phases. It is then finally discussed how this geometric way of performing quantum gates can lead to a stable, large scale, intrinsically fault-tolerant quantum computer.

scholarly journals Universal quantum computation with shutter logic

2006 ◽  
Vol 6 (6) ◽  
pp. 495-515
Author(s):  
J.C. Garcia-Escartin ◽  
P. Chamorro-Posada
Keyword(s):  
Quantum Computation ◽  
Quantum Logic ◽  
Quantum Computer ◽  
Quantum Memory ◽  
Linear Optics ◽  
Cnot Gate ◽  
Free Model ◽  
Universal Quantum

We show that universal quantum logic can be achieved using only linear optics and a quantum shutter device. With these elements, we design a quantum memory for any number of qubits and a CNOT gate which are the basis of a universal quantum computer. An interaction-free model for a quantum shutter is given.

scholarly journals Systematic distillation of composite Fibonacci anyons using one mobile quasiparticle

2012 ◽  
Vol 12 (9&10) ◽  
pp. 876-892
Author(s):  
Ben W. Reichardt
Keyword(s):  
Quantum Computation ◽  
Quantum Computer ◽  
Fault Tolerant ◽  
Success Probability ◽  
Quantum Algorithm ◽  
Systematic Construction ◽  
Topological Quantum ◽  
Universal Quantum ◽  
Measurement Devices ◽  
Topological Quantum Computation

A topological quantum computer should allow intrinsically fault-tolerant quantum computation, but there remains uncertainty about how such a computer can be implemented. It is known that topological quantum computation can be implemented with limited quasiparticle braiding capabilities, in fact using only a single mobile quasiparticle, if the system can be properly initialized by measurements. It is also known that measurements alone suffice without any braiding, provided that the measurement devices can be dynamically created and modified. We study a model in which both measurement and braiding capabilities are limited. Given the ability to pull nontrivial Fibonacci anyon pairs from the vacuum with a certain success probability, we show how to simulate universal quantum computation by braiding one quasiparticle and with only one measurement, to read out the result. The difficulty lies in initializing the system. We give a systematic construction of a family of braid sequences that initialize to arbitrary accuracy nontrivial composite anyons. Instead of using the Solovay-Kitaev theorem, the sequences are based on a quantum algorithm for convergent search.

Majorana Zero Modes in Networks of Cooper-Pair Boxes: Topologically Ordered States and Topological Quantum Computation

2020 ◽  
Vol 11 (1) ◽  
pp. 397-420 ◽  
Author(s):  
Yuval Oreg ◽  
Felix von Oppen
Keyword(s):  
Quantum Computation ◽  
Coulomb Blockade ◽  
Cooper Pair ◽  
Quantum Computer ◽  
Zero Modes ◽  
Topological Superconductors ◽  
Topological Quantum ◽  
Recent Developments ◽  
Universal Quantum ◽  
Coulomb Effects

Recent experimental progress introduced devices that can combine topological superconductivity with Coulomb-blockade effects. Experiments with these devices have already provided additional evidence for Majorana zero modes in proximity-coupled semiconductor wires. They also stimulated numerous ideas for how to exploit interactions between Majorana zero modes generated by Coulomb charging effects in networks of Majorana wires. Coulomb effects promise to become a powerful tool in the quest for a topological quantum computer as well as for driving topological superconductors into topologically ordered insulating states. Here, we present a focused review of these recent developments, including discussions of recent experiments, designs of topological qubits, Majorana-based implementations of universal quantum computation, and topological quantum error correction. Motivated by the analogy between a qubit and a spin-1/2 degree of freedom, we also review how coupling between Cooper-pair boxes leads to emergent topologically ordered insulating phases.

scholarly journals QUANTUM COMPUTATION WITH BALLISTIC ELECTRONS

2001 ◽  
Vol 15 (02) ◽  
pp. 125-133 ◽  
Author(s):  
RADU IONICIOIU ◽  
GEHAN AMARATUNGA ◽  
FLORIN UDREA
Keyword(s):  
Quantum Computation ◽  
Electric Fields ◽  
Quantum Computer ◽  
Quantum Gates ◽  
Initial State ◽  
Final State ◽  
Single Electrons ◽  
State Measurement ◽  
Universal Quantum ◽  
Static Electric Fields

We describe a solid state implementation of a quantum computer using ballistic single electrons as flying qubits in 1D nanowires. We show how to implement all the steps required for universal quantum computation: preparation of the initial state, measurement of the final state and a universal set of quantum gates. An important advantage of this model is the fact that we do not need ultrafast optoelectronics for gate operations. We use cold programming (or pre-programming), i.e. the gates are set before launching the electrons; all programming can be done using static electric fields only.

scholarly journals Universal quantum computation via quantum controlled classical operations

2021 ◽  
Author(s):  
Sebastian Horvat ◽  
Xiaoqin Gao ◽  
Borivoje Dakic
Keyword(s):  
Quantum Computing ◽  
Control System ◽  
Quantum Computation ◽  
Quantum Control ◽  
Quantum Computer ◽  
Affirmative Answer ◽  
Quantum Gates ◽  
Processing Power ◽  
Universal Quantum ◽  
Hadamard Gate

Abstract A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results in universal quantum computing. Motivated by the latter, we pose the following question: can one perform universal quantum computation by supplementing a set of classical gates with a quantum control, and a set of quantum gates operating solely on the latter? In this work we provide an affirmative answer to this question by considering a computational model that consists of 2n target bits together with a set of classical gates controlled by log(2n + 1) ancillary qubits. We show that this model is equivalent to a quantum computer operating on n qubits. Furthermore, we show that even a primitive computer that is capable of implementing only SWAP gates, can be lifted to universal quantum computing, if aided with an appropriate quantum control of logarithmic size. Our results thus exemplify the information processing power brought forth by the quantum control system.

scholarly journals Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization

2021 ◽  
Vol 20 (7) ◽  
Author(s):  
Ismail Ghodsollahee ◽  
Zohreh Davarzani ◽  
Mariam Zomorodi ◽  
Paweł Pławiak ◽  
Monireh Houshmand ◽  
...  
Keyword(s):  
Quantum Computation ◽  
Quantum Computer ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Connectivity Matrix ◽  
Circuit Optimization ◽  
Novel Approach ◽  
The Matrix ◽  
Minimum Number ◽  
Two Phases

AbstractAs quantum computation grows, the number of qubits involved in a given quantum computer increases. But due to the physical limitations in the number of qubits of a single quantum device, the computation should be performed in a distributed system. In this paper, a new model of quantum computation based on the matrix representation of quantum circuits is proposed. Then, using this model, we propose a novel approach for reducing the number of teleportations in a distributed quantum circuit. The proposed method consists of two phases: the pre-processing phase and the optimization phase. In the pre-processing phase, it considers the bi-partitioning of quantum circuits by Non-Dominated Sorting Genetic Algorithm (NSGA-III) to minimize the number of global gates and to distribute the quantum circuit into two balanced parts with equal number of qubits and minimum number of global gates. In the optimization phase, two heuristics named Heuristic I and Heuristic II are proposed to optimize the number of teleportations according to the partitioning obtained from the pre-processing phase. Finally, the proposed approach is evaluated on many benchmark quantum circuits. The results of these evaluations show an average of 22.16% improvement in the teleportation cost of the proposed approach compared to the existing works in the literature.

scholarly journals Simulating molecules on a cloud-based 5-qubit IBM-Q universal quantum computer

2021 ◽  
Vol 4 (1) ◽  
Author(s):  
S. Leontica ◽  
F. Tennie ◽  
T. Farrow
Keyword(s):  
Quantum System ◽  
Energy Transport ◽  
Quantum Computer ◽  
Complex Molecule ◽  
Dissipative System ◽  
Quantum Simulation ◽  
Quantum Systems ◽  
Molecular Structures ◽  
Unitary Evolution ◽  
Universal Quantum

AbstractSimulating the behaviour of complex quantum systems is impossible on classical supercomputers due to the exponential scaling of the number of quantum states with the number of particles in the simulated system. Quantum computers aim to break through this limit by using one quantum system to simulate another quantum system. Although in their infancy, they are a promising tool for applied fields seeking to simulate quantum interactions in complex atomic and molecular structures. Here, we show an efficient technique for transpiling the unitary evolution of quantum systems into the language of universal quantum computation using the IBM quantum computer and show that it is a viable tool for compiling near-term quantum simulation algorithms. We develop code that decomposes arbitrary 3-qubit gates and implement it in a quantum simulation first for a linear ordered chain to highlight the generality of the approach, and second, for a complex molecule. We choose the Fenna-Matthews-Olsen (FMO) photosynthetic protein because it has a well characterised Hamiltonian and presents a complex dissipative system coupled to a noisy environment that helps to improve the efficiency of energy transport. The method can be implemented in a broad range of molecular and other simulation settings.

scholarly journals An Identity-Based Blind Signature Scheme Using Lattice with Provable Security

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Quanrun Li ◽  
Chingfang Hsu ◽  
Debiao He ◽  
Kim-Kwang Raymond Choo ◽  
Peng Gong
Keyword(s):  
Quantum Computer ◽  
Rapid Development ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Mean Value ◽  
Blind Signature ◽  
Signature Scheme ◽  
Practical Applications ◽  
Universal Quantum ◽  
Identity Based

With the rapid development of quantum computing and quantum information technology, the universal quantum computer will emerge in the near decades with a very high probability and it could break most of the current public key cryptosystems totally. Due to the ability of withstanding the universal quantum computer’s attack, the lattice-based cryptosystems have received lots of attention from both industry and academia. In this paper, we propose an identity-based blind signature scheme using lattice. We also prove that the proposed scheme is provably secure in the random oracle model. The performance analysis shows that the proposed scheme has less mean value of sampling times and smaller signature size than previous schemes. Thus, the proposed scheme is more suitable for practical applications.

Sign in / Sign up

Export Citation Format

Share Document