Efficient Deterministic Preparation of Quantum States Using Decision Diagrams

06/17/2022
by   Fereshte Mozafari, et al.
0

Loading classical data into quantum registers is one of the most important primitives of quantum computing. While the complexity of preparing a generic quantum state is exponential in the number of qubits, in many practical tasks the state to prepare has a certain structure that allows for faster preparation. In this paper, we consider quantum states that can be efficiently represented by (reduced) decision diagrams, a versatile data structure for the representation and analysis of Boolean functions. We design an algorithm that utilises the structure of decision diagrams to prepare their associated quantum states. Our algorithm has a circuit complexity that is linear in the number of paths in the decision diagram. Numerical experiments show that our algorithm reduces the circuit complexity by up to 31.85% compared to the state-of-the-art algorithm, when preparing generic n-qubit states with different degrees of non-zero amplitudes. Additionally, for states with sparse decision diagrams, including the initial state of the quantum Byzantine agreement protocol, our algorithm reduces the number of CNOTs by 86.61% ∼ 99.9%.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/02/2021

LIMDD A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States

Efficient methods for the representation of relevant quantum states and ...
research
03/02/2021

Diagrammatic security proof for 8-state encoding

Dirac notation is the most common way to describe quantum states and ope...
research
03/15/2021

Efficient Construction of Functional Representations for Quantum Algorithms

Due to the significant progress made in the implementation of quantum ha...
research
02/13/2023

Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation

Classically simulating quantum circuits is crucial when developing or te...
research
04/22/2022

Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies

In this paper, we study quantum Ordered Binary Decision Diagrams(OBDD) m...
research
09/27/2019

Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams

An ordered binary decision diagram (OBDD) is a directed acyclic graph th...
research
07/04/2023

Empirical Sample Complexity of Neural Network Mixed State Reconstruction

Quantum state reconstruction using Neural Quantum States has been propos...

Please sign up or login with your details

Forgot password? Click here to reset