QUANTUM CIRCUITS FOR PROBABILISTIC ENTANGLEMENT TELEPORTATION VIA A PARTIALLY ENTANGLED PAIR

2007 ◽  
Vol 05 (05) ◽  
pp. 717-728 ◽  
Author(s):  
XIU-BO CHEN ◽  
QIAO-YAN WEN ◽  
FU-CHEN ZHU
Keyword(s):  
Quantum Circuit ◽  
The Other ◽  
Quantum Circuits ◽  
Entangled State ◽  
Practical Realization ◽  
Entanglement Teleportation ◽  
Probabilistic Teleportation ◽  
Partially Entangled State ◽  
Positive Operator Valued Measure ◽  
Many Particles

It deserves mentioning that the quantum circuit, i.e. quantum logic network, is essential to the practical realization of teleportation in experiment. Using only one partially entangled pair, we first propose two novel strategies for probabilistically teleporting any partially entangled state of a bipartite system. The feature of the present protocol is to weaken the requirement for the quantum channel, and also to cut down the number of entangled particles initially shared by the sender and receiver. On the other hand, we explicitly construct the generalized measurement described by the positive operator-valued measure (POVM). Two kinds of efficient quantum circuits for implementing the teleportation are offered. In addition, we generalize the two-particle probabilistic teleportation to the system of many particles.

PROBABILISTIC TELEPORTATION OF A TWO-ATOM ENTANGLED STATE IN CAVITY QED

2008 ◽  
Vol 22 (13) ◽  
pp. 2129-2137
Author(s):  
JIN-MING LIU ◽  
YI-CAI WANG ◽  
XIAO-QI XIAO
Keyword(s):  
Quantum Channel ◽  
Cavity Qed ◽  
Thermal Field ◽  
Cavity Mode ◽  
Resonant Cavity ◽  
Success Probability ◽  
Entangled State ◽  
Probabilistic Teleportation ◽  
Cavity Decay ◽  
Partially Entangled State

We present two schemes for probabilistically teleporting a two-atom entangled state using a three-atom partially entangled state as the quantum channel in cavity QED with the help of separate atomic measurements. The first scheme is only based on the interaction between two driven atoms and a quantized cavity mode in the large detuning limit, so the effects of both cavity decay and the thermal field are eliminated. In the second scheme, it is necessary to introduce an additional resonant cavity besides the thermal cavity to realize the teleportation, and the corresponding success probability is improved.

Probabilistic teleportation of multi-particle partially entangled state

2008 ◽  
Vol 17 (3) ◽  
pp. 771-777 ◽  
Author(s):  
Chen Xiu-Bo ◽  
Du Jian-Zhong ◽  
Wen Qiao-Yan ◽  
Zhu Fu-Chen
Keyword(s):  
Entangled State ◽  
Probabilistic Teleportation ◽  
Partially Entangled State

scholarly journals On the depth overhead incurred when running quantum algorithms on near-term quantum computers with limited qubit connectivity

2020 ◽  
Vol 20 (9&10) ◽  
pp. 787-806 ◽  
Author(s):  
Steven Herbert
Keyword(s):  
Quantum Algorithms ◽  
Quantum Circuit ◽  
The Other ◽  
Quantum Circuits ◽  
Quantum Computers ◽  
Interaction Graph ◽  
Finite Degree ◽  
Near Term

This paper addresses the problem of finding the depth overhead that will be incurred when running quantum circuits on near-term quantum computers. Specifically, it is envisaged that near-term quantum computers will have low qubit connectivity: each qubit will only be able to interact with a subset of the other qubits, a reality typically represented by a qubit interaction graph in which a vertex represents a qubit and an edge represents a possible direct 2-qubit interaction (gate). Thus the depth overhead is unavoidably incurred by introducing swap gates into the quantum circuit to enable general qubit interactions. This paper proves that there exist quantum circuits where a depth overhead in Omega(\log n) must necessarily be incurred when running quantum circuits with n qubits on quantum computers whose qubit interaction graph has finite degree, but that such a logarithmic depth overhead is achievable. The latter is shown by the construction of a 4-regular qubit interaction graph and associated compilation algorithm that can execute any quantum circuit with only a logarithmic depth overhead.

scholarly journals ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES

2004 ◽  
Vol 02 (01) ◽  
pp. 1-10 ◽  
Author(s):  
JUHA J. VARTIAINEN ◽  
ANTTI O. NISKANEN ◽  
MIKIO NAKAHARA ◽  
MARTTI M. SALOMAA
Keyword(s):  
Numerical Optimization ◽  
Control Parameter ◽  
Quantum Algorithms ◽  
Quantum Circuit ◽  
Idle Time ◽  
Quantum Circuits ◽  
Circuit Optimization ◽  
Practical Realization ◽  
Charge Qubit ◽  
The Individual

Quantum-circuit optimization is essential for any practical realization of quantum computation, in order to beat decoherence. We present a scheme for implementing the final stage in the compilation of quantum circuits, i.e. for finding the actual physical realizations of the individual modules in the quantum-gate library. We find that numerical optimization can be efficiently utilized in order to generate the appropriate control-parameter sequences which produce the desired three-qubit modules within the Josephson charge-qubit model. Our work suggests ways in which one can in fact considerably reduce the number of gates required to implement a given quantum circuit, hence diminishing idle time and significantly accelerating the execution of quantum algorithms.

scholarly journals Quantum Factoring Algorithm: Resource Estimation and Survey of Experiments

2020 ◽  
pp. 39-55
Author(s):  
Noboru Kunihiro
Keyword(s):  
Large Scale ◽  
Quantum Circuit ◽  
The Other ◽  
Quantum Circuits ◽  
Small Scale ◽  
Quantum Computers ◽  
Resource Estimation ◽  
Shor's Algorithm ◽  
Order Of An Element ◽  
Factoring Algorithm

Abstract It is known that Shor’s algorithm can break many cryptosystems such as RSA encryption, provided that large-scale quantum computers are realized. Thus far, several experiments for the factorization of the small composites such as 15 and 21 have been conducted using small-scale quantum computers. In this study, we investigate the details of quantum circuits used in several factoring experiments. We then indicate that some of the circuits have been constructed under the condition that the order of an element modulo a target composite is known in advance. Because the order must be unknown in the experiments, they are inappropriate for designing the quantum circuit of Shor’s factoring algorithm. We also indicate that the circuits used in the other experiments are constructed by relying considerably on the target composite number to be factorized.

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 Spacetime as a quantum circuit

2021 ◽  
Vol 2021 (4) ◽  
Author(s):  
A. Ramesh Chandra ◽  
Jan de Boer ◽  
Mario Flory ◽  
Michal P. Heller ◽  
Sergio Hörtner ◽  
...  
Keyword(s):  
Path Integral ◽  
Constant Scalar Curvature ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Special Role ◽  
Gravitational Action ◽  
Volume Conjecture ◽  
Interesting Connection ◽  
Kinematic Space ◽  
Boundary States

Abstract We propose that finite cutoff regions of holographic spacetimes represent quantum circuits that map between boundary states at different times and Wilsonian cutoffs, and that the complexity of those quantum circuits is given by the gravitational action. The optimal circuit minimizes the gravitational action. This is a generalization of both the “complexity equals volume” conjecture to unoptimized circuits, and path integral optimization to finite cutoffs. Using tools from holographic $$ T\overline{T} $$ T T ¯ , we find that surfaces of constant scalar curvature play a special role in optimizing quantum circuits. We also find an interesting connection of our proposal to kinematic space, and discuss possible circuit representations and gate counting interpretations of the gravitational action.

Quantum generative adversarial networks for learning and loading quantum image in noisy environment

2021 ◽  
pp. 2150360
Author(s):  
Wanghao Ren ◽  
Zhiming Li ◽  
Yiming Huang ◽  
Runqiu Guo ◽  
Lansheng Feng ◽  
...  
Keyword(s):  
Image Processing ◽  
Quantum Circuit ◽  
Quantum Image Processing ◽  
Quantum Circuits ◽  
Generative Adversarial Networks ◽  
Channel Noise ◽  
Quantum Image ◽  
Adversarial Networks ◽  
Potential Applications ◽  
Classical Image

Quantum machine learning is expected to be one of the potential applications that can be realized in the near future. Finding potential applications for it has become one of the hot topics in the quantum computing community. With the increase of digital image processing, researchers try to use quantum image processing instead of classical image processing to improve the ability of image processing. Inspired by previous studies on the adversarial quantum circuit learning, we introduce a quantum generative adversarial framework for loading and learning a quantum image. In this paper, we extend quantum generative adversarial networks to the quantum image processing field and show how to learning and loading an classical image using quantum circuits. By reducing quantum gates without gradient changes, we reduced the number of basic quantum building block from 15 to 13. Our framework effectively generates pure state subject to bit flip, bit phase flip, phase flip, and depolarizing channel noise. We numerically simulate the loading and learning of classical images on the MINST database and CIFAR-10 database. In the quantum image processing field, our framework can be used to learn a quantum image as a subroutine of other quantum circuits. Through numerical simulation, our method can still quickly converge under the influence of a variety of noises.

Sign in / Sign up

Export Citation Format

Share Document