相关论文: Exact QSP angles for odd monomials
We illustrate the application of Quantum Computing techniques to the investigation of the thermodynamical properties of a simple system, made up of three quantum spins with frustrated pair interactions and affected by a hard sign problem…
Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…
In this work, the concept of quasi-type Kernel polynomials with respect to a moment functional is introduced. Difference equation satisfied by these polynomials along with the criterion for orthogonality conditions are discussed. The…
Quadratically Constrained Quadratic Programs (QCQPs) are an important class of optimization problems with diverse real-world applications. In this work, we propose a variational quantum algorithm for general QCQPs. By encoding the variables…
As a hallmark of pure quantum effect, quantum entanglement has provided unconventional routes to condensed matter systems. Here, from the perspective of quantum entanglement, we disclose exotic quantum physics in non-Hermitian…
Unit group computations are a cryptographic primitive for which one has a fast quantum algorithm, but the required number of qubits is $\tilde O(m^5)$. In this work we propose a modification of the algorithm for which the number of qubits…
The hidden subgroup problem~(HSP) is one of the most important problems in quantum computation. Many problems for which quantum algorithm achieves exponential speedup over its classical counterparts can be reduced to the Abelian HSP.…
The determination of ground state properties of quantum systems is a fundamental problem in physics and chemistry, and is considered a key application of quantum computers. A common approach is to prepare a trial ground state on the quantum…
A problem of the erroneous duality gap caused by the presence of symmetries is solved in this paper utilizing point group theory. The optimization problems are first divided into two classes based on their predisposition to suffer from this…
Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm,…
Quantum Phase Estimation (QPE), the quantum algorithm for estimating eigenvalues of a given Hermitian matrix and preparing its eigenvectors, is considered the most promising approach to finding the ground states and their energies of…
We propose a quantum unstructured search algorithm to find the extrema or roots of discrete functions, $f(\mathbf{x})$, such as the objective functions in combinatorial and other discrete optimisation problems. The first step of the Quantum…
Known quantum error correction schemes are typically able to take advantage of only a limited class of classical error-correcting codes. Entanglement-assisted quantum error correction is a partial solution which made it possible to exploit…
In this study the determinant of the average quadratic error matrix is used as the measure of state estimation efficiency. This quantity is easily computable in some cases, so it gives us a reasonable tool to find optimal measurement setup…
In this paper, we present a polynomial-complexity algorithm to construct a special orthogonal matrix for the deterministic remote state preparation (DRSP) of an arbitrary n-qubit state, and prove that if n>3, such matrices do not exist.…
Quantum annealing is a powerful tool for solving and approximating combinatorial optimization problems such as graph partitioning, community detection, centrality, routing problems, and more. In this paper we explore the use of quantum…
We propose a new strategy to physically implement a universal set of quantum gates based on geometric phases accumulated in the nondegenerate eigenstates of a designated invariant operator in a periodic physical system. The system is driven…
A quantum mechanical search procedure to determine the real zeros of a polynomial is introduced. It is based on the construction of a spin observable whose eigenvalues coincide with the zeros of the polynomial. Subsequent quantum mechanical…
We revisit the idea of quantum nondemolition measurement (QND) of optical quanta via a resonantly enhanced Kerr nonlinearity taking into account quantum back action and show that the monolithic microcavities enable QND measurement of number…
An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single…