Circuit depth reduction algorithm for QUBO and Ising models in gate-model quantum computers

2021 ◽  
Author(s):  
Sun Woo Park ◽  
Hyunju Lee ◽  
Byung Chun Kim ◽  
Youngho Woo ◽  
Kyungtaek Jun
Keyword(s):  
Ising Models ◽  
Quantum Computers ◽  
Reduction Algorithm ◽  
Circuit Depth ◽  
Depth Reduction

scholarly journals Circuit Depth Reduction for Gate-Model Quantum Computers

2020 ◽  
Vol 10 (1) ◽  
Author(s):  
Laszlo Gyongyosi ◽  
Sandor Imre
Keyword(s):  
Quantum Computers ◽  
Circuit Depth ◽  
Depth Reduction

A Method to Improve Quantum State Fidelity in Circuits Executed on IBM’s Quantum Computers

2021 ◽  
Author(s):  
Mitali Sisodia ◽  
Abhishek Shukla ◽  
Alexandre A. A. de Almeida ◽  
Gerhard W. Dueck ◽  
Anirban Pathak
Keyword(s):  
Quantum Computing ◽  
Quantum State ◽  
Classical Limit ◽  
The State ◽  
Present Approach ◽  
Quantum Computers ◽  
Output State ◽  
Circuit Depth

Recently, various quantum computing and communication tasks have been implemented using IBM's superconductivity-based quantum computers. Here, we show that the circuits used in most of those works were not optimized, and obtain the corresponding optimized circuits. Optimized circuits implementable in IBM quantum computers are also obtained for a set of reversible benchmark circuits. With a clear example, it is shown that the reduction in circuit cost enhances the fidelity of the output state (with respect to the theoretically expected state in the absence of noise) as lesser number of gates and circuit depth introduce lesser amount of errors during evolution of the state. Further, considering Mermin inequality as an example, it is shown that the violation of classical limit is enhanced when we use optimized circuits. Thus, the present approach can be used to identify relatively weaker signature of quantumness and to establish quantum supremacy in a stronger manner.

scholarly journals Exact and approximate continuous-variable gate decompositions

Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 394
Author(s):  
Timjan Kalajdzievski ◽  
Nicolás Quesada
Keyword(s):  
Decomposition Methods ◽  
Continuous Variable ◽  
Quantum Computers ◽  
Decomposition Techniques ◽  
New Techniques ◽  
Circuit Depth ◽  
Continuous Variable Operations

We gather and examine in detail gate decomposition techniques for continuous-variable quantum computers and also introduce some new techniques which expand on these methods. Both exact and approximate decomposition methods are studied and gate counts are compared for some common operations. While each having distinct advantages, we find that exact decompositions have lower gate counts whereas approximate techniques can cover decompositions for all continuous-variable operations but require significant circuit depth for a modest precision.

Erratum - Frustration in periodic systems : exact results for some 2D ising models

1979 ◽  
Vol 40 (10) ◽  
pp. 1024-1024
Author(s):  
G. André ◽  
R. Bidaux ◽  
J.-P. Carton ◽  
R. Conte ◽  
L. de Seze
Keyword(s):  
Ising Models ◽  
Periodic Systems ◽  
Exact Results

Application of an attribute reduction algorithm based on discernibility matrix in PBNM

2014 ◽  
Author(s):  
Shuo Feng ◽  
Haiying Chu ◽  
Xuyang Wang ◽  
Yuanka Liang ◽  
Xianwei Shi ◽  
...  
Keyword(s):  
Attribute Reduction ◽  
Reduction Algorithm ◽  
Discernibility Matrix

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