相关论文: Optimal purification of a generic n-qudit state
Preparing the ground state of a system is an important task in physics. We propose a quantum algorithm for preparing the ground state of a physical system that can be simulated on a quantum computer. The system is coupled to an ancillary…
We show that a generic $N$-qudit pure quantum state is uniquely determined by only $2$ of its $\lceil\frac{N+1}{2}\rceil$-particle reduced density matrices. Therefore we give a method to uniquely determine a generic $N$-qudit pure state of…
In this paper we consider the purification of a quantum state using the information obtained from a continuous measurement record, where the classical measurement record is digitized to a single bit per measurement after the measurements…
The quantum permutation algorithm provides computational speed-up over classical algorithms in determining the parity of a given cyclic permutation. For its $n$-qubit implementations, the number of required quantum gates scales…
Recently, the development of quantum chips has made great progress-- the number of qubits is increasing and the fidelity is getting higher. However, qubits of these chips are not always fully connected, which sets additional barriers for…
Electronic structure and transport in realistically-sized systems often require an open quantum system (OQS) treatment, where the system is defined in the context of an environment. As OQS evolution is non-unitary, implementation on quantum…
We propose a scheme to evaluate the amount of quantum discord and entanglement of formation for mixed states, and reveal their ordering relation via an intrinsic relationship between the two quantities distributed in different partners of…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…
An $[[n,k,d]]$ quantum maximum-distance-separable code maps $k$ source qudits to $n$ coded qudits such that any $n-(d-1)$ coded qudits may recover all source qudits and $n = k + 2 (d-1)$. The entropy of the joint state of the reference…
We report on a quantum thermodynamic method to purify a qubit on a quantum processing unit (QPU) equipped with (nearly) identical qubits. Our starting point is a three qubit design that emulates the well known two qubit swap engine. Similar…
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger…
The well-known algorithm for quantum phase estimation requires that the considered unitary is available as a conditional transformation depending on the quantum state of an ancilla register. We present an algorithm converting an unknown…
Reducing errors is essential for reliable quantum computation. Quantum error mitigation (QEM) and quantum error correction (QEC) are two leading approaches for this task, each with challenges: QEM suffers from high sampling costs and cannot…
Pure states are fundamental for the implementation of quantum technologies, and several methods for the purification of the state of a quantum system S have been developed in the past years. In this letter we present a new approach, based…
Error filtration is a hardware scheme that mitigates noise by exploiting auxiliary qubits and entangling gates. Although both signal and ancillas are subject to local noise, constructive interference(and in some cases post-selection) allows…
We propose a probabilistic quantum protocol to realize a nonlinear transformation of qutrit states, which by iterative applications on ensembles can be used to distinguish two types of pure states. The protocol involves single-qutrit and…
A purification scheme which utilizes the action of repeated measurements on a (part of a total) quantum system is briefly reviewed and is applied to a few simple systems to show how it enables us to extract an entangled state as a target…
Quantum circuits of a general quantum gate acting on multiple $d$-level quantum systems play a prominent role in multi-valued quantum computation. We first propose a new recursive Cartan decomposition of semi-simple unitary Lie group…
The optimal quantum control theory is employed to determine electric pulses capable of producing quantum gates with high fidelity (higher than 0.9997). Particularly, these quantum gates were chosen to perform the permutation algorithm (Z.…
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…