Related papers: Quantum Algorithms for Inverse Participation Ratio…
Mutually unbiased bases, mutually unbiased measurements and general symmetric informationally complete measurements are three related concepts in quantum information theory. We investigate multipartite systems using these notions and…
We introduce a protocol to classify three-qubit pure states into different entanglement classes and implement it on an NMR quantum processor. The protocol is designed in such a way that the experiments performed to classify the states can…
Hybrid quantum-classical embedding methods for correlated materials simulations provide a path towards potential quantum advantage. However, the required quantum resources arising from the multi-band nature of $d$ and $f$ electron materials…
Many researchers have been heavily investigated on quantum phase estimation (QPE) algorithms to find the unknown phase, since QPE is the core building block of the most quantum algorithms such as the Shor's factoring algorithm, quantum…
In this paper, we explore an efficient online algorithm for quantum state estimation based on a matrix-exponentiated gradient method previously used in the context of machine learning. The state update is governed by a learning rate that…
The machinery of qubit-portraits of qudit states, recently presented, is consider here in more details in order to characterize the presence of quantum correlations in bipartite qudit states. In the tomographic representation of quantum…
The eigenvalue density of a matrix plays an important role in various types of scientific computing such as electronic-structure calculations. In this paper, we propose a quantum algorithm for computing the eigenvalue density in a given…
Parity measurements on qubits can generate the entanglement resource necessary for scalable quantum computation. Here we describe a method for fast optical parity measurements on electron spin qubits within coupled quantum dots. The…
In the realm of statistical physics, the number of states in which a system can be realized with a given energy is a key concept that bridges the microscopic and macroscopic descriptions of physical systems. For quantum systems, many…
High-fidelity mid-circuit measurements, which read out the state of specific qubits in a multiqubit processor without destroying them or disrupting their neighbors, are a critical component for useful quantum computing. They enable…
In quantum physics, multiparticle systems are described by quantum states acting on tensor products of Hilbert spaces. This product structure leads to the distinction between product states and entangled states; moreover, one can quantify…
We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems. The first one is a hybrid quantum algorithm that, given an efficiently preparable state, computes expectation values in a…
High fidelity qubit readout is a cornerstone for quantum information protocols. In traditional superconducting qubit readout, a chain of microwave amplifiers and nonreciprocal components aid in detecting the qubit's state with tolerable…
The optimal estimation of a quantum mechanical 2-state system (qubit) - with N identically prepared qubits available - is obtained by measuring all qubits simultaneously in an entangled basis. We report the experimental estimation of qubits…
We present quantum algorithms for the estimation of n-time correlation functions, the local and non-local density of states, and dynamical linear response functions. These algorithms are all based on block-encodings - a versatile technique…
Quantum algorithms are able to solve particular problems exponentially faster than conventional algorithms, when implemented on a quantum computer. However, all demonstrations to date have required already knowing the answer to construct…
A new geometric representation of qubit and qutrit states based on probability simplexes is used to describe the separability and entanglement properties of density matrices of two qubits. The Peres--Horodecki positive partial transpose…
Integer programming (IP) is an NP-hard combinatorial optimization problem that is widely used to represent a diverse set of real-world problems spanning multiple fields, such as finance, engineering, logistics, and operations research. It…
We develop a means of simulating the evolution and measurement of a multipartite quantum state under discrete or continuous evolution using another quantum system with states and operators lying in a real Hilbert space. This extends…
The random matrix ensembles are applied to the quantum statistical two-dimensional systems of electrons. The quantum systems are studied using the finite dimensional real, complex and quaternion Hilbert spaces of the eigenfunctions. The…