Related papers: Efficient Tomography of Non-Interacting Fermion St…
Nonlocal correlation represents the key feature of quantum mechanics, and is an exploitable resource in quantum information processing. However, the loophole issues and the associated applicability compromises hamper the practical…
Using the density matrix renormalization group algorithm, we study the model of spinless fermions with nearest-neighbor interaction on a ring in the presence of disorder. We determine the spatial decay of the density induced by a defect…
We give a detailed account of an efficient search algorithm for the data pattern tomography proposed by J. Rehacek, D. Mogilevtsev, and Z. Hradil [Phys. Rev. Lett.~\textbf{105}, 010402 (2010)], where the quantum state of a system is…
We construct entanglement renormalization schemes which provably approximate the ground states of non-interacting fermion nearest-neighbor hopping Hamiltonians on the one-dimensional discrete line and the two-dimensional square lattice.…
We show with explicit formulas that one can completely identify an unknown quantum process with only one weakly entangled state; and identify a quantum optical Gaussian process with either one two-mode squeezed state or a few different…
Out-of-equilibrium states of many-body systems tend to evade a description by standard statistical mechanics, and their uniqueness is epitomized by the possibility of certain long-range correlations that cannot occur in equilibrium. In…
Trace distance and infidelity (induced by square root fidelity), as basic measures of the closeness of quantum states, are commonly used in quantum state discrimination, certification, and tomography. However, the sample complexity for…
High fidelity state preparation represents a fundamental challenge in the application of quantum technology. While the majority of optimal control approaches use feedback to improve the controller, the controller itself often does not…
Tasks such as classification of data and determining the groundstate of a Hamiltonian cannot be carried out through purely unitary quantum evolution. Instead, the inherent non-unitarity of the measurement process must be harnessed.…
We extract the leading effective range corrections to the equation of state of the unitary Fermi gas from ab initio fixed-node quantum Monte Carlo (FNQMC) calculations in a periodic box using a density functional theory (DFT), and show them…
The problem of unambiguously distinguishing among nonorthogonal but linearly independent quantum states can be solved by mapping the set of nonorthogonal quantum states onto a set of orthogonal ones, which can then be distinguished without…
We consider the problem of quantum state certification, where one is given $n$ copies of an unknown $d$-dimensional quantum mixed state $\rho$, and one wants to test whether $\rho$ is equal to some known mixed state $\sigma$ or else is…
We propose convenient inferential methods for potentially nonstationary multivariate unobserved components models with fractional integration and cointegration. Based on finite-order ARMA approximations in the state space representation,…
We have developed an efficient simulation algorithm for strongly interacting relativistic fermions in two-dimensional field theories based on a formulation as a loop gas. The loop models describing the dynamics of the fermions can be mapped…
We develop a scheme to distill entanglement from bipartite Fermionic systems in an arbitrary quasifree state. It can be applied if either one system containing infinite one-copy entanglement is available or if an arbitrary amount of equally…
The area of sublinear algorithms have recently received a lot of attention. In this setting, one has to choose specific access model for the input, as the algorithm does not have time to pre-process or even to see the whole input. A…
The algorithmic tasks of computing the Hamming distance between a given pattern of length $m$ and each location in a text of length $n$ is one of the most fundamental algorithmic tasks in string algorithms. Unfortunately, there is evidence…
In machine learning and particularly in topological data analysis, $\epsilon$-graphs are important tools but are generally hard to compute as the distance calculation between n points takes time O(n^2) classically. Recently, quantum…
Efficient characterization of highly entangled multi-particle systems is an outstanding challenge in quantum science. Recent developments have shown that a modest number of randomized measurements suffices to learn many properties of a…
Measurement-based quantum computation, an alternative paradigm for quantum information processing, uses simple measurements on qubits prepared in cluster states, a class of multiparty entangled states with useful properties. Here we propose…