Unitarization Through Approximate Basis
- URL: http://arxiv.org/abs/2104.00785v2
- Date: Mon, 13 Sep 2021 22:45:21 GMT
- Title: Unitarization Through Approximate Basis
- Authors: Joshua Cook
- Abstract summary: Unitarization is the problem of taking $k$ input circuits that produce quantum states from the all $0$ state.
We find an approximate basis in time for the following parameters.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We introduce the problem of unitarization. Unitarization is the problem of
taking $k$ input quantum circuits that produce orthogonal states from the all
$0$ state, and create an output circuit implementing a unitary with its first
$k$ columns as those states. That is, the output circuit takes the $k$th
computational basis state to the state prepared by the $k$th input circuit. We
allow the output circuit to use ancilla qubits initialized to $0$. But ancilla
qubits must always be returned to $0$ for any input. The input circuits may use
ancilla qubits, but we are only guaranteed the they return ancilla qubits to
$0$ on the all $0$ input.
The unitarization problem seems hard if the output states are neither
orthogonal to or in the span of the computational basis states that need to map
to them. In this work, we approximately solve this problem in the case where
input circuits are given as black box oracles by probably finding an
approximate basis for our states. This method may be more interesting than the
application. This technique is a sort of quantum analogue of Gram-Schmidt
orthogonalization for quantum states.
Specifically, we find an approximate basis in polynomial time for the
following parameters. Take any natural $n$, $k =
O\left(\frac{\ln(n)}{\ln(\ln(n))}\right)$, and $\epsilon =
2^{-O(\sqrt{\ln(n)})}$. Take any $k$ input quantum states, $(|\psi_i
\rangle)_{i\in [k]}$, on polynomial in $n$ qubits prepared by quantum oracles,
$(V_i)_{i \in [k]}$ (that we can control call and control invert). Then there
is a quantum circuit with polynomial size in $n$ with access to the oracles
$(V_i)_{i \in [k]}$ that with at least $1 - \epsilon$ probability, computes at
most $k$ circuits with size polynomial in $n$ and oracle access to $(V_i)_{i
\in [k]}$ that $\epsilon$ approximately computes an $\epsilon$ approximate
orthonormal basis for $(|\psi_i \rangle)_{i\in [k]}$.
Related papers
- Low-degree approximation of QAC$^0$ circuits [0.0]
We show that the parity function cannot be computed in QAC$0$.
We also show that any QAC circuit of depth $d$ that approximately computes parity on $n$ bits requires $2widetildeOmega(n1/d)$.
arXiv Detail & Related papers (2024-11-01T19:04:13Z) - The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$.
As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
arXiv Detail & Related papers (2024-10-26T06:21:42Z) - Learning junta distributions and quantum junta states, and QAC$^0$ circuits [0.0]
We consider the problems of learning junta distributions, their quantum counter-part, quantum junta states, and QAC$0$ circuits.
We show that they can be learned with error $varepsilon$ in total variation distance.
We also prove a lower bound of $Omega(4k+log (n)/varepsilon2)$ copies.
arXiv Detail & Related papers (2024-10-21T09:39:20Z) - Dimension Independent Disentanglers from Unentanglement and Applications [55.86191108738564]
We construct a dimension-independent k-partite disentangler (like) channel from bipartite unentangled input.
We show that to capture NEXP, it suffices to have unentangled proofs of the form $| psi rangle = sqrta | sqrt1-a | psi_+ rangle where $| psi_+ rangle has non-negative amplitudes.
arXiv Detail & Related papers (2024-02-23T12:22:03Z) - Spacetime-Efficient Low-Depth Quantum State Preparation with
Applications [93.56766264306764]
We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods.
We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
arXiv Detail & Related papers (2023-03-03T18:23:20Z) - Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann.
We show how our results have immediate applications to the modern theory of polarization.
arXiv Detail & Related papers (2022-05-30T18:01:34Z) - Optimal (controlled) quantum state preparation and improved unitary
synthesis by quantum circuits with any number of ancillary qubits [20.270300647783003]
Controlled quantum state preparation (CQSP) aims to provide the transformation of $|irangle |0nrangle to |irangle |psi_irangle $ for all $iin 0,1k$ for the given $n$-qubit states.
We construct a quantum circuit for implementing CQSP, with depth $Oleft(n+k+frac2n+kn+k+mright)$ and size $Oleft(2n+kright)$
arXiv Detail & Related papers (2022-02-23T04:19:57Z) - Asymptotically Optimal Circuit Depth for Quantum State Preparation and
General Unitary Synthesis [24.555887999356646]
The problem is of fundamental importance in quantum algorithm design, Hamiltonian simulation and quantum machine learning, yet its circuit depth and size complexity remain open when ancillary qubits are available.
In this paper, we study efficient constructions of quantum circuits with $m$ ancillary qubits that can prepare $psi_vrangle$ in depth.
Our circuits are deterministic, prepare the state and carry out the unitary precisely, utilize the ancillary qubits tightly and the depths are optimal in a wide range of parameter regime.
arXiv Detail & Related papers (2021-08-13T09:47:11Z) - Learning quantum circuits of some $T$ gates [10.609715843964263]
It has been unknown how to handle circuits beyond the Clifford group.
We show that the output state of a $T$-depth one circuit textitof full $T$-rank can be represented by a stabilizer pseudomixture.
arXiv Detail & Related papers (2021-06-23T16:43:01Z) - An Optimal Separation of Randomized and Quantum Query Complexity [67.19751155411075]
We prove that for every decision tree, the absolute values of the Fourier coefficients of a given order $ellsqrtbinomdell (1+log n)ell-1,$ sum to at most $cellsqrtbinomdell (1+log n)ell-1,$ where $n$ is the number of variables, $d$ is the tree depth, and $c>0$ is an absolute constant.
arXiv Detail & Related papers (2020-08-24T06:50:57Z) - Tight Quantum Lower Bound for Approximate Counting with Quantum States [49.6558487240078]
We prove tight lower bounds for the following variant of the counting problem considered by Aaronson, Kothari, Kretschmer, and Thaler ( 2020)
The task is to distinguish whether an input set $xsubseteq [n]$ has size either $k$ or $k'=(1+varepsilon)k$.
arXiv Detail & Related papers (2020-02-17T10:53:50Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.