Related papers: Realization of the 1->3 optimal phase-covariant qu…
Suppose, we are given two finite ensembles of pure qubit states, so that the qubits in each ensemble are prepared in identical (but unknown for us) states lying on the equator of the Bloch sphere. What is the best strategy to estimate…
We consider the problem of determining the achievable region of parameters for universal $1 \to 2$ asymmetric quantum cloning. Measuring the cloning performance with the figure of merit of singlet fraction, we show that the physical region…
We present a surprisingly simple three-dimensional Bloch sphere representation of a qutrit, i.e., a single three-level quantum system. We start with a symmetric state of a two-qubit system and relate it to the spin-1 representation. Using…
A quantum system interacts with its environment, if ever so slightly, no matter how much care is put into isolating it. As a consequence, quantum bits (qubits) undergo errors, putting dauntingly difficult constraints on the hardware…
We analyze quantum algorithms for cloning of a quantum measurement. Our aim is to mimic two uses of a device performing an unknown von Neumann measurement with a single use of the device. When the unknown device has to be used before the…
We present a fault-tolerant semi-global control strategy for universal quantum computers. We show that N-dimensional array of qubits where only (N-1)-dimensional addressing resolution is available is compatible with fault-tolerant universal…
We have analyzed an efficient integration of the multi-qubit echo quantum memory into the quantum computer scheme on the atomic resonant ensembles in quantum electrodynamics cavity. Here, one atomic ensemble with controllable inhomogeneous…
Each platonic solid defines a single-qubit positive operator valued measure (POVM) by interpreting its vertices as points on the Bloch sphere. We construct simple circuits for implementing this kind of measurements and other simple types of…
The fidelity of a quantum transformation is strongly linked with the prior partial information of the state to be transformed. We illustrate this interesting point by proposing and demonstrating the superior cloning of coherent states with…
We provide new examples of pure entangled systems related to cluster state quantum computation that can be efficiently simulated classically. In cluster state quantum computation input qubits are initialised in the `equator' of the Bloch…
The two-qubit pure state is explicitly parameterized by three unit 2-spheres and a phase factor. For separable states, two of the three unit spheres are the Bloch spheres of each qubit. The third sphere parameterizes the degree and phase of…
Faithfully storing an unknown quantum light state is essential to advanced quantum communication and distributed quantum computation applications. The required quantum memory must have high fidelity to improve the performance of a quantum…
We analyze a reversibility of optimal Gaussian $1\to 2$ quantum cloning of a coherent state using only local operations on the clones and classical communication between them and propose a feasible experimental test of this feature.…
We present an oxide aperture microcavity with embedded quantum dots that utilizes a three contact design to independently tune the quantum dot wavelength and birefringence of the cavity modes. A polarization splitting tuning of $\sim$5 GHz…
We present the optimal scheme for estimating a pure qubit state by means of local measurements on N identical copies. We give explicit examples for low N. For large N, we show that the fidelity saturates the collective measurement bound up…
Due to the axioms of quantum mechanics, perfect cloning of an unknown quantum state is impossible. But since imperfect cloning is still possible, a question arises: "Is there an optimal quantum cloning machine?" Buzek and Hillery answer to…
We introduce a $0.611$-approximation algorithm for Quantum MaxCut and a $\frac{1+\sqrt{5}}{4} \approx 0.809$-approximation algorithm for the EPR Hamiltonian of [arXiv:2209.02589]. A novel ingredient in both of these algorithms is to…
We consider a generalisation of Ekert's entanglement-based quantum cryptographic protocol where qubits are replaced by qu$N$its (i.e., N-dimensional systems). In order to study its robustness against optimal incoherent attacks, we derive…
Performing experiments on small-scale quantum computers is certainly a challenging endeavor. Many parameters need to be optimized to achieve high-fidelity operations. This can be done efficiently for operations acting on single qubits as…
Native multi-qubit parity gates have various potential quantum computing applications, such as entanglement creation, logical state encoding and parity measurement in quantum error correction. Here, using simultaneous cross-resonance drives…