Quantum Computing Simulation using the Auxiliary Field Decomposition

Author(s):  
K. Fischer ◽  
H.-G. Matuttis ◽  
S. Yukawa ◽  
N. Ito
2018 ◽  
Vol 64 (2) ◽  
pp. 181
Author(s):  
M. Paredes López ◽  
A. Meneses Viveros ◽  
G. Morales-Luna

An important feature of quantum computing is its inherent paralellism, allowing to process an exponential number of basic transforms with just a linear number of qubits. The Deutsch-Jozsa algorithm exemplifies the computational complexity reduction. This work reports the implementation and execution of the Deutsch-Josza quantum algoritm in GAMA, a programming language for quantum computing simulation developed by ourselves. Through this simulation, it is possible to explore all the components involved by tracing all the different configurations that each component may take.


Author(s):  
Andrés García ◽  
José Ranilla ◽  
Raul Alonso Alvarez ◽  
Luis Meijueiro

The shortage of quantum computers, and their current state of development, constraints research in many fields that could benefit from quantum computing. Although the work of a quantum computer can be simulated with classical computing, personal computers take so long to run quantum experiments that they are not very useful for the progress of research. This manuscript presents an open quantum computing simulation platform that enables quantum computing researchers to have access to high performance simulations. This platform, called QUTE, relies on a supercomputer powerful enough to simulate general purpose quantum circuits of up to 38 qubits, and even more under particular simulations. This manuscript describes in-depth the characteristics of the QUTE platform and the results achieved in certain classical experiments in this field, which would give readers an accurate idea of the system capabilities.


Sign in / Sign up

Export Citation Format

Share Document