Related papers: Applicability of coupling strength estimation for …
Recently developed strong-coupling theory open up the possibility of treating quantum-mechanical systems with hard-wall potentials via perturbation theory. To test the power of this theory we study here the exactly solvable quantum…
Based on recently introduced efficient quantum state tomography schemes, we propose a scalable method for the tomography of unitary processes and the reconstruction of one-dimensional local Hamiltonians. As opposed to the exponential…
Estimating the unitarity of an unknown quantum channel $\mathcal{E}$ provides information on how much it is unitary, which is a basic and important problem in quantum device certification and benchmarking. Unitarity estimation can be…
The quantum internet aims to interconnect distant devices and enable large-scale computation through distributed quantum algorithms. One of the key obstacles is communication latency during computation. Even separations of a few hundred…
We show that in presence of a local and uncorrelated dephasing noise, quantum advantage can be obtained in the Fisher information-based lower bound of the minimum uncertainty in estimating parameters of the system Hamiltonian. The quantum…
The canonical transformation diagonalizing the one-particle tight binding Hamiltonian for an alternating chain with two non-equivalent sites per unit cell has been used to introduce the Hubbard-like interactions (on-site, inter-site,…
We introduce an experimental procedure for the detection of quantum entanglement of an unknown quantum state with as few measurements as possible. The method requires neither a priori knowledge of the state nor a shared reference frame…
Experimental procedures are presented for the rapid detection of entanglement of unknown arbitrary quantum states. The methods are based on the entanglement criterion using accessible correlations and the principle of correlation…
We propose a structure-preserving model-reduction methodology for large-scale dynamic networks with tightly-connected components. First, the coherent groups are identified by a spectral clustering algorithm on the graph Laplacian matrix…
We revisit results obtained in [F. Harary, U. Peled, Hamiltonian threshold graphs, Discrete Appl.~Math., 16 (1987), 11--15], where several necessary and necessary and sufficient conditions for a connected threshold graph to be Hamiltonian…
Quantum communication devices, such as quantum repeaters, quantum memories, or quantum channels, are unavoidably exposed to imperfections. However, the presence of imperfections can be tolerated, as long as we can verify such devices retain…
The use of statistical methods for the description of complex quantum systems was primarily motivated by the failure of a line-by-line interpretation of atomic spectra. Such methods reveal regularities and trends in the distributions of…
We consider the problem of selectively controlling couplings in a practical quantum processor with always-on interactions that are diagonal in the computational basis, using sequences of local NOT gates. This methodology is well-known in…
We provide a new quantum algorithm that efficiently determines the quality of a least-squares fit over an exponentially large data set by building upon an algorithm for solving systems of linear equations efficiently (Harrow et al., Phys.…
From a stability perspective, a renewable generation (RG)-rich power system is a constrained system. As the quasistability boundary of a constrained system is structurally very different from that of an unconstrained system, finding the…
Quantum computers can be considered as a natural means for performing machine learning tasks for inherently quantum labeled data. Many quantum machine learning techniques have been developed for solving classification problems, such as…
A contemporary technological milestone is to build a quantum device performing a computational task beyond the capability of any classical computer, an achievement known as quantum adversarial advantage. In what ways can the entanglement…
We propose a new measure of non-classicality of quantum gates which is particularly suitable for probabilistic devices. This measure enables to compare, e.g., deterministic devices which prepare entangled states with low amount of…
For reliable and consistent quantum information processing carried out on a quantum network, the network structure must be fully known and a desired initial state must be accurately prepared on it. In this paper, for a class of spin…
Hamiltonian Truncation (a.k.a. Truncated Spectrum Approach) is a numerical technique for solving strongly coupled QFTs, in which the full Hilbert space is truncated to a finite-dimensional low-energy subspace. The accuracy of the method is…