Related papers: Approximate orthogonality of permutation operators…
We study the sensitivity of the eigenvectors of random matrices, showing that even small perturbations make the eigenvectors almost orthogonal. More precisely, we consider two deformed Wigner matrices $W+D_1$, $W+D_2$ and show that their…
We propose a quantum inverse iteration algorithm which can be used to estimate the ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the…
Correlation functions involving products and ratios of half-integer powers of characteristic polynomials of random matrices from the Gaussian Orthogonal Ensemble (GOE) frequently arise in applications of Random Matrix Theory (RMT) to…
We propose an operational measure of distance of two quantum states, which conversely tells us their closeness. This is defined as a sum of differences in partial knowledge over a complete set of mutually complementary measurements for the…
Minimal Informationally Complete quantum measurements, or MICs, illuminate the structure of quantum theory and how it departs from the classical. Central to this capacity is their role as tomographically complete measurements with the…
Many quantum algorithms can be seen as a transition from a well-defined initial quantum state of a complex quantum system, to an unknown target quantum state, corresponding to a certain eigenvalue either of the Hamiltonian or of a…
The Hermiticity condition in quantum mechanics required for the characterisation of (a) physical observables and (b) generators of unitary motions can be relaxed into a wider class of operators whose eigenvalues are real and whose…
Quantum counterparts of certain simple classical systems can exhibit chaotic behaviour through the statistics of their energy levels and the irregular spectra of chaotic systems are modelled by eigenvalues of infinite random matrices. We…
Here, using two real non-zero parameters $\lambda$ and $\mu$, we construct Gaussian pseudo-orthogonal ensembles of a large number $N$ of $n \times n$ ($n$ even and large) real pseudo-symmetric matrices under the metric $\eta$ using $…
We study the statistics of matrix elements of local operators in the basis of energy eigenstates in a paradigmatic integrable many-particle quantum theory, the Lieb-Liniger model of bosons with repulsive delta-function interaction. Using…
We find that a class of entanglement measures for bipartite pure state can be expressed by the average values of quantum operators, which are related to any complete basis of one partite operator space. Two specific examples are given based…
The possible compatibility of density matrices for single-party subsystems is described by linear constraints on their respective spectra. Whenever some of those quantum marginal constraints are saturated, the total quantum state has a…
A pure quantum state of $n$ parties associated with the Hilbert space $\CC^{d_1}\otimes \CC^{d_2}\otimes\cdots\otimes \CC^{d_n}$ is called $k$-uniform if all the reductions to $k$-parties are maximally mixed. The $n$ partite system is…
We study quantum hypothesis testing between orthogonal states under restricted local measurements in the many-copy scenario. For testing arbitrary multipartite entangled pure state against its orthogonal complement state via the local…
The problem of optimally estimating an unknown unitary quantum operation with the aid of entanglement is addressed. The idea is to prepare an entangled pair, apply the unknown unitary to one of the two parts and then measure the joint…
In a recent preprint by Deutsch et al. [1995] the authors suggest the possibility of polynomial approximability of arbitrary unitary operations on $n$ qubits by 2-qubit unitary operations. We address that comment by proving strong lower…
Randomized measurements are useful for analyzing quantum systems especially when quantum control is not fully perfect. However, their practical realization typically requires multiple rotations in the complex space due to the adoption of…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
We consider a class of random quantum circuits where at each step a gate from a universal set is applied to a random pair of qubits, and determine how quickly averages of arbitrary finite-degree polynomials in the matrix elements of the…
Every choice of an orthonormal frame in the d-dimensional Hilbert space of a system corresponds to one set of all mutually commuting density matrices or, equivalently, a classical statistical state space of the system; the quantum state…