An adaptive algorithm for quantum circuit simulation

11/27/2019
by   Roman Schutski, et al.
0

Efficient simulation of quantum computers is essential for the development and validation of near-term quantum devices and the research on quantum algorithms. Up to date, two main approaches to simulation were in use, based on either full state or single amplitude evaluation. We propose an algorithm that efficiently interpolates between these two possibilities. Our approach elucidates the connection between quantum circuit simulation and partial evaluation of expressions in tensor algebra.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/28/2023

Q-Map: Quantum Circuit Implementation of Boolean Functions

Quantum computing has gained attention in recent years due to the signif...
research
04/02/2019

Optimising Trotter-Suzuki Decompositions for Quantum Simulation Using Evolutionary Strategies

One of the most promising applications of near-term quantum computing is...
research
05/14/2022

Efficient Hierarchical State Vector Simulation of Quantum Circuits via Acyclic Graph Partitioning

Early but promising results in quantum computing have been enabled by th...
research
10/03/2022

qTask: Task-parallel Quantum Circuit Simulation with Incrementality

Incremental quantum circuit simulation has emerged as an important tool ...
research
09/14/2022

How Much Structure Is Needed for Huge Quantum Speedups?

I survey, for a general scientific audience, three decades of research i...
research
10/13/2022

Efficient circuit implementation for coined quantum walks on binary trees and application to reinforcement learning

Quantum walks on binary trees are used in many quantum algorithms to ach...
research
05/27/2020

The limits of quantum circuit simulation with low precision arithmetic

This is an investigation of the limits of quantum circuit simulation wit...

Please sign up or login with your details

Forgot password? Click here to reset