Related papers: Two qubit copying machine for economical quantum e…
We study machines that take N identical replicas of a pure qudit state as input and output a set of M_A clones of a given fidelity and another set of $M_B$ clones of another fidelity. The trade-off between these two fidelities is…
The requirement of performing both single-qubit and two-qubit operations in the implementation of universal quantum logic often leads to very demanding constraints on quantum computer design. We show here how to eliminate the need for…
We present a scheme that transform 1 qubit to M identical copies with optimal fidedelity via free dynamical evolution of spin star networks. We show that the Heisenberg XXZ coupling can fulfill the challenge. The initial state of the…
As one of the most intriguing intrinsic properties of quantum world, quantum superposition provokes great interests in its own generation. Oszmaniec [Phys. Rev. Lett. 116, 110403 (2016)] have proven that though a universal quantum machine…
Recently, we have shown the advantages of two-way quantum communications in continuous variable quantum cryptography. Thanks to this new approach, two honest users can achieve a non-trivial security enhancement as long as the Gaussian…
We consider one single copy of a mixed state of two qubits and investigate how its entanglement changes under local quantum operations and classical communications (LQCC) of the type $\rho'\sim (A\otimes B)\rho(A\otimes B)^{\dagger}$. We…
Medium-scale ensembles of coupled qubits offer a platform for near-term quantum technologies including computing, sensing, and the study of mesoscopic quantum systems. Atom-like emitters in solids have emerged as promising quantum memories,…
We derive a tight upper bound for the fidelity of a universal N to M qubit cloner, valid for any M \geq N, where the output of the cloner is required to be supported on the symmetric subspace. Our proof is based on the concatenation of two…
We consider the hypothetical quantum network case where Alice wishes to transmit one qubit of information (specifically a pure quantum state) to $M$ parties, where $M$ is some large number. The remote receivers locally perform single qubit…
A quantum state transformation can be generally approximated by single- and two-qubit gates. This, however, does not hold with noisy intermediate-scale quantum technologies due to the errors appearing in the gate operations, where errors of…
Given a finite number of copies of an unknown qubit state that have already been measured optimally, can one still extract any information about the original unknown state? We give a positive answer to this question and quantify the…
Quantum memory is a key element for quantum repeaters and linear optical quantum computers. In addition to memory, repeaters and computers also require manipulating quantum states by means of unitary transformations, which is generally…
There have recently been interests in transferring entanglement between two quantum systems in different Hilbert spaces. In particular, the study of entanglement transfer from a continuous-variable to a qubit system has a primary importance…
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…
Quantum state tomography is an important tool in quantum information science for complete characterization of multi-qubit states and their correlations. Here we report a method to perform a joint simultaneous read-out of two superconducting…
Entanglement-measurement attack is one of the most famous attacks against quantum cryptography. In quantum cryptography protocols, eavesdropping checking is an effective means to resist this attack. There are currently two commonly used…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…
Recent work has shown that $n$-qubit quantum states output by circuits with at most $t$ single-qubit non-Clifford gates can be learned to trace distance $\epsilon$ using $\mathsf{poly}(n,2^t,1/\epsilon)$ time and samples. All prior…
We start with the simplest quantum system (a two-level system, i.e., a qubit) and discuss a one-to-one mapping of the quantum state in a two-dimensional Hilbert space to a vector in an eight dimensional probability space (probability…
We propose a scheme for a ground-code measurement-based quantum computer, which enjoys two major advantages. First, every logical qubit is encoded in the gapped degenerate ground subspace of a spin-1 chain with nearest-neighbor two-body…