• Corpus ID: 238531659

QuOp_MPI: a framework for parallel simulation of quantum variational algorithms

@inproceedings{Matwiejew2021QuOp\_MPIAF,
  title={QuOp\_MPI: a framework for parallel simulation of quantum variational algorithms},
  author={Edric Matwiejew and Jingbo B. Wang},
  year={2021}
}
QuOp MPI is a Python package designed for parallel simulation of quantum variational algorithms. It presents an object-orientated approach to quantum variational algorithm design and utilises MPI-parallelised sparse-matrix exponentiation, the fast Fourier transform and parallel gradient evaluation to achieve the highly efficient simulation of the fundamental unitary dynamics on massively parallel systems. In this article, we introduce QuOp MPI and explore its application to the simulation of… 

References

SHOWING 1-10 OF 25 REFERENCES
A variational eigenvalue solver on a photonic quantum processor
TLDR
The proposed approach drastically reduces the coherence time requirements and combines this method with a new approach to state preparation based on ansätze and classical optimization, enhancing the potential of quantum resources available today and in the near future.
Variational Quantum Algorithms
TLDR
An overview of the field of Variational Quantum Algorithms is presented and strategies to overcome their challenges as well as the exciting prospects for using them as a means to obtain quantum advantage are discussed.
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
TLDR
The essence of this extension, the quantum alternating operator ansatz, is the consideration of general parameterized families of unitaries rather than only those corresponding to the time evolution under a fixed local Hamiltonian for a time specified by the parameter.
A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
Here we present qFlex, a flexible tensor network-based quantum circuit simulator. qFlex can compute both the exact amplitudes, essential for the verification of the quantum hardware, as well as
Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
TLDR
An in-depth study of the performance of QAOA on MaxCut problems is provided by developing an efficient parameter-optimization procedure and revealing its ability to exploit non-adiabatic operations, illustrating that optimization will be important only for problem sizes beyond numerical simulations, but accessible on near-term devices.
Quantum Computing in the NISQ era and beyond
TLDR
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future, and the 100-qubit quantum computer will not change the world right away - but it should be regarded as a significant step toward the more powerful quantum technologies of the future.
XACC: A System-Level Software Infrastructure for Heterogeneous Quantum-Classical Computing
TLDR
XACC is presented, a system-level software infrastructure for quantum-classical computing that promotes a service-oriented architecture to expose interfaces for core quantum programming, compilation, and execution tasks and lays the foundation for the development of compilers, associated runtimes, and low-level system tools tightly integrating quantum and classical workflows.
The Fastest Fourier Transform in the West
TLDR
FFTW is typically faster than all other publicly available DFT software, including the well-known FFTPACK and the code from Numerical Recipes, and is competitive with or better than proprietary, highly-tuned codes such as Sun's PerformanceLibrary and IBM'sESSL library.
Combinatorial Register Allocation and Instruction Scheduling
TLDR
The results show that the combinatorial approach can be applied in practice to trade compilation time for code quality beyond the usual compiler optimization levels, identify improvement opportunities in heuristic algorithms, and fully exploit processor-specific features readily.
Structure in Approximation Classes
TLDR
After defining a new approximation preserving reducibility to be used for as many approximation classes as possible, this paper gives the first examples of natural NPO-complete problems and the firstExamples of natural APX-intermediate problems.
...
1
2
3
...