PAS: A new powerful and simple quantum computing simulator

2021 ◽  
Author(s):  
Haodong Bian ◽  
Jianqiang Huang ◽  
Jiahao Tang ◽  
Runting Dong ◽  
Li Wu ◽  
...  
Keyword(s):  
Quantum Computing ◽  
Simple Quantum

scholarly journals PARAMAGNETIC MATERIALS AND PRACTICAL ALGORITHMIC COOLING FOR NMR QUANTUM COMPUTING

2005 ◽  
Vol 03 (01) ◽  
pp. 281-285 ◽  
Author(s):  
JOSÉ M. FERNANDEZ ◽  
TAL MOR ◽  
YOSSI WEINSTEIN
Keyword(s):  
Quantum Computing ◽  
Thermal Relaxation ◽  
Quantum Computers ◽  
Thermalization Time ◽  
Quantum Bits ◽  
Simple Quantum ◽  
Paramagnetic Materials ◽  
Paramagnetic Salt ◽  
Magnetic Ions ◽  
Entropy Compression

Algorithmic cooling is a method that uses novel data compression techniques and simple quantum computing devices to improve NMR spectroscopy, and to offer scalable NMR quantum computers. The algorithm recursively employs two steps. A reversible entropy compression of computation quantum-bits (qubits) of the system and an irreversible heat transfer from the system to the environment through a set of reset qubits that reach thermal relaxation rapidly. Is it possible to experimentally demonstrate algorithmic cooling using existing technology? To allow experimental algorithmic cooling, the thermalization time of the reset qubits must be much shorter than the thermalization time of the computation qubits. However, such high thermalization-times ratios have yet to be reported. We investigate here the effect of a paramagnetic salt on the thermalization-times ratio of computation qubits (carbons) and a reset qubit (hydrogen). We show that the thermalization-times ratio is improved by approximately three-fold. Based on this result, an experimental demonstration of algorithmic cooling by thermalization and magnetic ions has been performed by the authors and collaborators.

THE PARITY GATE: FROM QUANTUM NETWORKS TO ENTANGLEMENT GENERATION

2007 ◽  
Vol 05 (01n02) ◽  
pp. 3-7 ◽  
Author(s):  
RADU IONICIOIU
Keyword(s):  
Quantum Computing ◽  
Network Model ◽  
Quantum Network ◽  
Quantum Networks ◽  
Entanglement Generation ◽  
Simple Quantum ◽  
Parity Gate ◽  
Linear Elements ◽  
Quantum Network Model ◽  
Parity Measurement

It has been shown recently that parity measurement is an efficient entangler for fermions and hence is a universal resource for fermionic quantum computing with linear elements. In this article, we investigate several properties of the parity P-gate. We construct a simple quantum network model for the P-gate and derive gate identities for it. Finally, we examine entanglement generation using parity measurements.

Simple quantum information algorithms in cavity QED

2003 ◽  
Vol 50 (6-7) ◽  
pp. 901-913 ◽  
Author(s):  
H. Ollivier ◽  
F. Yamaguchi ◽  
M. Brune ◽  
J. M. Raimond ◽  
S. Haroche ◽  
...  
Keyword(s):  
Quantum Information ◽  
Cavity Qed ◽  
Simple Quantum

Discrete variable gate-model quantum computing

2019 ◽  
Author(s):  
Mark Fingerhuth ◽  
Tomáš Babej ◽  
Peter Wittek
Keyword(s):  
Quantum Computing ◽  
Discrete Variable

The Essence of Quantum Computing

2018 ◽  
Author(s):  
Rajendra K. Bera
Keyword(s):  
Hilbert Space ◽  
Quantum Computing ◽  
Quantum Physics ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Turing Machines ◽  
Classical Physics ◽  
Core Set ◽  
The World ◽  
Subordinate Role

It now appears that quantum computers are poised to enter the world of computing and establish its dominance, especially, in the cloud. Turing machines (classical computers) tied to the laws of classical physics will not vanish from our lives but begin to play a subordinate role to quantum computers tied to the enigmatic laws of quantum physics that deal with such non-intuitive phenomena as superposition, entanglement, collapse of the wave function, and teleportation, all occurring in Hilbert space. The aim of this 3-part paper is to introduce the readers to a core set of quantum algorithms based on the postulates of quantum mechanics, and reveal the amazing power of quantum computing.

Sign in / Sign up

Export Citation Format

Share Document