scholarly journals General-Purpose Quantum Circuit Simulator with Projected Entangled-Pair States and the Quantum Supremacy Frontier

2019 ◽  
Vol 123 (19) ◽  
Author(s):  
Chu Guo ◽  
Yong Liu ◽  
Min Xiong ◽  
Shichuan Xue ◽  
Xiang Fu ◽  
...  
2015 ◽  
Vol 67 (1) ◽  
pp. 168-173
Author(s):  
Stancu Mihai Dorian ◽  
Popa Emil Marin

Abstract In this paper we propose the design and implementation of a quantum circuit simulator API. Currently the API allows users to implement, debug and test the following two quantum algorithms: Bernstein-Vazirani’s algorithm and Simon’s Algorithm. The goal is to create a framework that will allow quantum computer scientists to easily develop new quantum algorithms.


Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 559
Author(s):  
Yasunari Suzuki ◽  
Yoshiaki Kawase ◽  
Yuya Masumura ◽  
Yuria Hiraga ◽  
Masahiro Nakadai ◽  
...  

To explore the possibilities of a near-term intermediate-scale quantum algorithm and long-term fault-tolerant quantum computing, a fast and versatile quantum circuit simulator is needed. Here, we introduce Qulacs, a fast simulator for quantum circuits intended for research purpose. We show the main concepts of Qulacs, explain how to use its features via examples, describe numerical techniques to speed-up simulation, and demonstrate its performance with numerical benchmarks.


Author(s):  
S Maity ◽  
A Pal ◽  
T Roy ◽  
S B Mandal ◽  
A Chakrabarti

2020 ◽  
Vol 20 (7&8) ◽  
pp. 581-596
Author(s):  
Aleks Kissinger ◽  
Arianne Meijer van de Griend

Many physical implementations of quantum computers impose stringent memory constraints in which 2-qubit operations can only be performed between qubits which are nearest neighbours in a lattice or graph structure. Hence, before a computation can be run on such a device, it must be mapped onto the physical architecture. That is, logical qubits must be assigned physical locations in the quantum memory, and the circuit must be replaced by an equivalent one containing only operations between nearest neighbours. In this paper, we give a new technique for quantum circuit mapping (a.k.a. routing), based on Gaussian elimination constrained to certain optimal spanning trees called Steiner trees. We give a reference implementation of the technique for CNOT circuits and show that it significantly out-performs general-purpose routines on CNOT circuits. We then comment on how the technique can be extended straightforwardly to the synthesis of CNOT+Rz circuits and as a modification to a recently-proposed circuit simplification/extraction procedure for generic circuits based on the ZX-calculus.


2010 ◽  
Vol 29-32 ◽  
pp. 2467-2472
Author(s):  
Hou Sheng Zhang

Boost converter occupies a very important position in the area of switching power supply, it is widely used in various power equipment for a long time, while the transient working process from start to steady-state are not involved in textbooks and reference books available. PSpice is a powerful general purpose analog circuit simulator that is used to verify analog or mixed digital circuit design and to predict the circuit behavior. Its simulation waveforms are nearly as same as the experimental waveforms. The overall working stages of Boost converter, especially the transient process from start to steady-state, are simulated and analyzed by PSpice in this paper. All the stages of store energy element of Boost converter are also introduced. Some simulation waveforms are given to verify the analysis. Thus the understanding of Boost converter for designers is deepened.


Sign in / Sign up

Export Citation Format

Share Document