Related papers: Quantum Algorithm for Fidelity Estimation
We give a technique to reduce the error probability of quantum algorithms that determine whether its input has a specified property of interest. The standard process of reducing this error is statistical processing of the results of…
There has been increasing interest in developing efficient quantum algorithms for hard classical problems. The Network Signal Coordination (NSC) problem is one such problem known to be NP complete. We implement Grover's search algorithm to…
Estimating the ground state energy of a multiparticle system with relative error $\e$ using deterministic classical algorithms has cost that grows exponentially with the number of particles. The problem depends on a number of state…
Determining the optimal fidelity for the transmission of quantum information over noisy quantum channels is one of the central problems in quantum information theory. Recently, [Berta-Borderi-Fawzi-Scholz, Mathematical Programming, 2021]…
An important step in building a quantum computer is calibrating experimentally implemented quantum gates to produce operations that are close to ideal unitaries. The calibration step involves estimating the systematic errors in gates and…
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…
A noteworthy discovery is that the minimal evolution time is smaller for parity-time ($\mathcal{PT}$) symmetric systems compared to Hermitian setups. Moreover, there is a significant acceleration of two-qubit quantum entanglement…
A longstanding belief in quantum tomography is that estimating a mixed state is far harder than estimating a pure state. This is borne out in the mathematics, where mixed state algorithms have always required more sophisticated techniques…
In this paper, we consider a quantum algorithm for solving the following problem: ``Suppose $f$ is a function given as a black box (that is also called an oracle) and $f$ is invariant under some AND-mask. Examine a property of $f$ by…
Quantum fidelity is one of the most important measures of similarity between mixed quantum states. However, the usual formulation is cumbersome and hard to understand when encountering the first time. This work shows in a novel, elegant…
Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. However, entanglement detection and quantification are believed to be hard due to the operational impracticality of existing…
The stabilization of a quantum computer by repeated error correction can be reduced almost entirely to repeated preparation of blocks of qubits in quantum codeword states. These are multi-particle entangled states with a high degree of…
Measuring the distinguishability between quantum states is a basic problem in quantum information theory. In this paper, we develop optimal quantum algorithms that estimate both the trace distance and the (square root) fidelity between pure…
A milestone in the field of quantum computing will be solving problems in quantum chemistry and materials faster than state-of-the-art classical methods. The current understanding is that achieving quantum advantage in this area will…
We study quantum cloning machines (QCM) that act on an unknown N-level quantum state and make M copies. We give a formula for the maximum of the fidelity of cloning and exhibit the unitary transformations that realize this optimal fidelity.…
This work describes a method to prepare the quantum state of the Heisenberg spin-1/2 Hamiltonian for the Kagome Lattice in an IBM 16 qubit quantum computer with a fidelity below 1% of the ground state computed via a classical Eigen-solver.…
As various quantum computing technologies continue to compete for quantum supremacy, several parameters have emerged as benchmarks for the quality of qubits. These include fidelity, coherence times, connectivity, and a few others. In this…
It is exponentially hard to simulate quantum systems by classical algorithms, while quantum computer could in principle solve this problem polynomially. We demonstrate such an quantum-simulation algorithm on our NMR system to simulate an…
We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state $\vert \Psi \rangle$ onto an optimal quantum circuit $\hat{\mathcal{C}}$ with a finite number of single- and two-qubit quantum gates. The proposed…
Efficient measures to determine similarity of quantum states, such as the fidelity metric, have been widely studied. In this paper, we address the problem of defining a similarity measure for quantum operations that can be…