Related papers: The Efficiency of Quantum Identity Testing of Mult…
The identification of an unknown quantum gate is a significant issue in quantum technology. In this paper, we propose a quantum gate identification method within the framework of quantum process tomography. In this method, a series of pure…
We propose a quantum circuit that creates a pure state corresponding to the quantum superposition of all prime numbers less than 2^n, where n is the number of qubits of the register. This Prime state can be built using Grover's algorithm,…
In this paper, we introduce the model of quantum Mealy machines and study the equivalence checking and minimisation problems of them. Two efficient algorithms are developed for checking equivalence of two states in the same machine and for…
We show that the quantum measurement known as the pretty good measurement can be used to identify an unknown quantum state picked from any set of $n$ mixed states that have pairwise fidelities upper-bounded by a constant below 1, given…
Quantum Computing has been presenting major developments in the last few years, unveiling systems with a increasing number of qubits. However, unreliable quantum processes in universal quantum computers still represent one of the the…
We consider the task of deciding whether an unknown qubit state falls in a prescribed neighborhood of a reference state. We assume that several copies of the unknown state are given and apply a unitary operation pairwise on them combined…
Quantum simulations are becoming an essential tool for studying complex phenomena, e.g. quantum topology, quantum information transfer, and relativistic wave equations, beyond the limitations of analytical computations and experimental…
With the advance of quantum information technology, the question of how to most efficiently test quantum circuits is becoming of increasing relevance. Here we introduce the statistics of lengths of measurement sequences that allows one to…
Quantum logic gates must perform properly when operating on their standard input basis states, as well as when operating on complex superpositions of these states. Experiments using superconducting qubits have validated the truth table for…
State preparation and measurement (SPAM) errors limit the performance of many gate-based quantum computing architecures, but are partly correctable after a calibration step that requires, for an exact implementation on a register of $n$…
A quantum state is called concordant if it has zero quantum discord with respect to any part. By extension, a concordant computation is one such that the state of the computer, at each time step, is concordant. In this paper, I describe a…
We present the first experimental demonstration of the maximum confidence measurement strategy for quantum state discrimination. Applying this strategy to an arbitrary set of states assigns to each input state a measurement outcome which,…
Characterizing large quantum systems with minimal assumptions is a central challenge in quantum information science. Self-testing provides the strongest form of certification by identifying the underlying quantum state solely from observed…
We propose a quantum circuit to discriminate between two arbitrary quantum evolution operators. It permits to test the equality of two quantum operators and to estimate a fidelity measure of them. The relation of the proposal to the SWAP…
A scheme for fine tuning of quantum operations to improve their performance is proposed. A quantum system in $\Lambda$ configuration with two-photon Raman transitions is considered without adiabatic elimination of the excited (intermediate)…
Continuous-variable quantum states are of particular importance in various quantum information processing tasks including quantum communication and quantum sensing. However, a bottleneck has emerged with the fast increasing in size of the…
We consider a unitary transformation which maps any given state of an $n$-qubit quantum register into another one. This transformation has applications in the initialization of a quantum computer, and also in some quantum algorithms.…
Quantum computers have proven to be effective in simulating many quantum systems. Simulating nuclear processes and state preparation poses significant challenges, even for traditional supercomputers. This study demonstrates the feasibility…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
We address a problem of identifying a given pure state with one of two reference pure states, when no classical knowledge on the reference states is given, but a certain number of copies of them are available. We assume the input state is…