Related papers: Quantum Algorithms for Inverse Participation Ratio…
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…
Quantum coherence, a fundamental resource in quantum computing and quantum information, often competes with localization effects that affects quantum states in disordered systems. In this work, we prove exact trade-off relations between…
We developed an inductive energy participation ratio (IEPR) method and a streamlined procedure for simulating and verifying superconducting quantum chips. These advancements are increasingly vital in the context of large-scale,…
We consider a family of quantum many-body Hamiltonians that show exact Hilbert space fragmentation in certain limits. The question arises whether fragmentation has implications for Hamiltonians in the vicinity of the subset defined by these…
Quantum relative entropy, a quantum generalization of the renowned Kullback-Leibler divergence, serves as a fundamental measure of the distinguishability between quantum states and plays a pivotal role in quantum information science.…
Quantum Inverse Problem (QIP) is the problem of estimating an unknown quantum system $\rho$ from a set of measurements, whereas the classical counterpart is the Inverse Problem of estimating a distribution from a set of observations. In…
Quantum computers are a highly promising tool for efficiently simulating quantum many-body systems. The preparation of their eigenstates is of particular interest and can be addressed, e.g., by quantum phase estimation algorithms. The…
Comparing probability distributions is a core challenge across the natural, social, and computational sciences. Existing methods, such as Maximum Mean Discrepancy (MMD), struggle in high-dimensional and non-compact domains. Here we…
We study quantum information properties of a seven-level system realized by a particle in an one-dimensional square-well trap. Features of encodings of seven-level systems in a form of three-qubit or qubit-qutrit systems are discussed. We…
The rodeo algorithm is an efficient algorithm for eigenstate preparation and eigenvalue estimation for any observable on a quantum computer. This makes it a promising tool for studying the spectrum and structure of atomic nuclei as well as…
Accurately predicting response properties of molecules such as the dynamic polarizability and hyperpolarizability using quantum mechanics has been a long-standing challenge with widespread applications in material and drug design. Classical…
Two schemes for sharing an arbitrary two-qubit state based on entanglement swapping are proposed with Bell-state measurements and local unitary operations. One is based on the quantum channel with four Einstein-Podolsky-Rosen (EPR) pairs…
We explore a supervised machine learning approach to estimate the entanglement entropy of multi-qubit systems from few experimental samples. We put a particular focus on estimating both aleatoric and epistemic uncertainty of the network's…
Quantum reservoir computing (QRC) is a brain-inspired computational paradigm, exploiting natural dynamics of a quantum system for information processing. To date, a multitude of quantum systems have been utilized in the QRC, with diverse…
Qudits, the multi-level generalization of qubits, provide a natural extension of the binary paradigm in quantum computation and offer new opportunities to enhance algorithmic performance. Beyond their direct applicability to the simulation…
This paper addresses the challenge of scaling quantum computing by employing distributed quantum algorithms across multiple processors. We propose a novel circuit partitioning method that leverages graph partitioning to optimize both qubit…
Quantum phase estimation (QPE) is the key subroutine of several quantum computing algorithms as well as a central ingredient in quantum computational chemistry and quantum simulation. While QPE strategies have focused on the estimation of a…
In this paper we study the reduction criterion for detecting entanglement of large dimensional bipartite quantum systems. We first obtain an explicit formula for the moments of a random quantum state to which the reduction criterion has…
We consider random bipartite quantum states obtained by tracing out one subsystem from a random, uniformly distributed, tripartite pure quantum state. We compute thresholds for the dimension of the system being traced out, so that the…
We present a polynomial-time quantum algorithm for obtaining the energy spectrum of a physical system, i.e. the differences between the eigenvalues of the system's Hamiltonian, provided that the spectrum of interest contains at most a…