Related papers: Krylov Polynomials and Quantum Query Complexity
For a prescribed pair of quantum states |psi_I> and |psi_F> we establish an elementary derivation of the optimum Hamiltonian, under constraints on its eigenvalues, that generates the unitary transformation |psi_I> --> |psi_F> in the…
Gottesman-Kitaev-Preskill (GKP) encoding holds promise for continuous-variable fault-tolerant quantum computing. While an ideal GKP encoding is abstract and impractical due to its nonphysical nature, approximate versions provide viable…
We consider a hierarchy of upper approximations for the minimization of a polynomial $f$ over a compact set $K \subseteq \mathbb{R}^n$ proposed recently by Lasserre (arXiv:1907.097784, 2019). This hierarchy relies on using the push-forward…
The problem of testing low-degree polynomials has received significant attention over the years due to its importance in theoretical computer science, and in particular in complexity theory. The problem is specified by three parameters:…
We derive a lower bound for the optimal fidelity for deterministic cloning a set of n pure states. In connection with states estimation, we obtain a lower bound about average maximum correct states estimation probability.
We introduce the quantum complexity class FQMA. This class describes the complexity of generating a quantum state that serves as a witness for a given QMA problem. In a certain sense, FQMA is the quantum analogue of FNP (function problems…
We consider fourth order singularly perturbed eigenvalue problems in one-dimension and the approximation of their solution by the $h$ version of the Finite Element Method (FEM). In particular, we use piecewise Hermite polynomials of degree…
We compare several instances of pure-state Belavkin weighted square-root measurements from the standpoint of minimum-error discrimination of quantum states. The quadratically weighted measurement is proven superior to the so-called "pretty…
We study how a machine based on deep learning algorithms learns Krylov spread complexity in quantum systems with N x N random Hamiltonians drawn from the Gaussian unitary ensemble. Using thermofield double states as initial conditions, we…
This survey explores modern approaches for computing low-rank approximations of high-dimensional matrices by means of the randomized SVD, randomized subspace iteration, and randomized block Krylov iteration. The paper compares the…
We introduce and review a new complexity measure, called `Krylov complexity', which takes its origins in the field of quantum-chaotic dynamics, serving as a canonical measure of operator growth and spreading. Krylov complexity, underpinned…
We show that $\Omega(rd/\epsilon)$ copies of an unknown rank-$r$, dimension-$d$ quantum mixed state are necessary in order to learn a classical description with $1 - \epsilon$ fidelity. This improves upon the tomography lower bounds…
In quantum systems, purification can map mixed states into pure states and a non-unitary evolution into a unitary one by enlarging the Hilbert space. We establish a connection between the complexities of mixed quantum states and their…
Quantum compiling addresses the problem of approximating an arbitrary quantum gate with a string of gates drawn from a particular finite set. It has been shown that this is possible for almost all choices of base sets and furthermore that…
Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural…
We consider the problem of designing an optimal quantum detector with a fixed rate of inconclusive results that maximizes the probability of correct detection, when distinguishing between a collection of mixed quantum states. We develop a…
We show that the entanglement structure of quantum many-body states defines a natural and optimal distributed representation for their simulation. An arbitrary entanglement cut induces a bipartite decomposition of the wavefunction, mapping…
We develop a strong and computationally simple entanglement criterion. The criterion is based on an elementary positive map Phi which operates on state spaces with even dimension N >= 4. It is shown that Phi detects many entangled states…
This Thesis explores the notion of Krylov complexity as a probe of quantum chaos and as a candidate for holographic complexity. The first Part is devoted to presenting the fundamental notions required to conduct research in this area.…
Optimizing over separable quantum objects is challenging for two key reasons: determining separability is NP-hard, and the dimensionality of the problem grows exponentially with the number of qubits. We address both challenges by…