Approximating Unitary Preparations of Orthogonal Black Box States

06/23/2019
by   Joshua Alan Cook, et al.
0

In this paper, I take a step toward answering the following question: for m different small circuits that compute m orthogonal n qubit states, is there a small circuit that will map m computational basis states to these m states without any input leaving any auxiliary bits changed. While this may seem simple, the constraint that auxiliary bits always be returned to 0 on any input (even ones besides the m we care about) led me to use sophisticated techniques. I give an approximation of such a unitary in the m = 2 case that has size polynomial in the approximation error, and the number of qubits n.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/01/2021

Unitarization Through Approximate Basis

In this paper, we introduce the problem of unitarization. Unitarization ...
research
05/13/2020

Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits

Virtual black-box obfuscation is a strong cryptographic primitive: it en...
research
11/29/2018

Small Hazard-free Transducers

Recently, an unconditional exponential separation between the hazard-fre...
research
11/20/2017

On the Geometry of Stabilizer States

Large-scale quantum computation is likely to require massive quantum err...
research
12/10/2020

Constructing Depth-Optimum Circuits for Adders and AND-OR Paths

We examine the fundamental problem of constructing depth-optimum circuit...
research
04/24/2020

Small circuits and dual weak PHP in the universal theory of p-time algorithms

We prove, under a computational complexity hypothesis, that it is consis...
research
08/31/2023

Computing excited states of molecules using normalizing flows

We present a new nonlinear variational framework for simultaneously comp...

Please sign up or login with your details

Forgot password? Click here to reset