相关论文: Optimal Copying of One Quantum Bit
The presence of a bias field, encoding some information about the target state, can enhance the performance of quantum optimization methods. Here we investigate the effect of such a bias field on the outcome of quantum annealing sampling,…
One of the primary objectives in the field of quantum state learning is to develop algorithms that are time-efficient for learning states generated from quantum circuits. Earlier investigations have demonstrated time-efficient algorithms…
A quantum computer consists of a set of quantum bits upon which operations called gates are applied to perform computations. In order to perform quantum algorithms, physicists would like to design arbitrary gates to apply to quantum bits.…
We consider the quantum computational process as viewed by an insider observer: this is equivalent to an isomorphism between the quantum computer and a quantum space, namely the fuzzy sphere. The result is the formulation of a reversible…
Debugging quantum states transformations is an important task of modern quantum computing. The use of quantum tomography for these purposes significantly expands the range of possibilities. However, the presence of preparation and…
Quantum state discrimination is a fundamental primitive in quantum statistics where one has to correctly identify the state of a system that is in one of two possible known states. A programmable discrimination machine performs this task…
Just as any state of a single qubit or 2-level system can be obtained from any other state by a rotation operator parametrized by three real Euler angles, we show how any state of an n-qubit or 2^n-level system can be obtained from any…
We theoretically investigate schemes to discriminate between two nonorthogonal quantum states given multiple copies. We consider a number of state discrimination schemes as applied to nonorthogonal, mixed states of a qubit. In particular,…
There has been significant interest in understanding how practical constraints on contemporary quantum devices impact the complexity of quantum learning. For the classic question of tomography, recent work tightly characterized the copy…
We derive an explicit Hamiltonian for copying the basis up and down states of a quantum two-state system - a qubit - onto n "copy" qubits initially all prepared in the down state. In terms of spin components, for spin-1/2 particle spin…
Beyond the no-cloning theorem, the universal symmetric quantum cloning machine was first addressed by Buzek and Hillery. Here, we realized the one-to-two qubits Buzek-Hillery cloning machine with linear optical devices. This method relies…
We derive the transformation for the optimal universal quantum anti-cloner which produces two anti-parallel outputs for a single input state. The fidelity is shown to be 2/3 which is same as the measurement fidelity. We consider a…
Three unit spheres were used to represent the two-qubit pure states. The three spheres are named the base sphere, entanglement sphere, and fiber sphere. The base sphere and entanglement sphere represent the reduced density matrix of the…
We describe an optimized, self-correcting procedure for the Bayesian inference of pure quantum states. By analyzing the history of measurement outcomes at each step, the procedure returns the most likely pure state, as well as the optimal…
We derive an exact expression for the quantumness of a Hilbert space (defined in quant-ph/0302092), and show that in composite Hilbert spaces the signal states must contain at least some entangled states in order to achieve such a…
A new scheme of quantum coding is presented. The scheme concerns the quantum states to which Schumacher's compression does not apply. It is shown that two qubits can be encoded in a single qutrit in such a way that one can faithfully…
We re-analyse the Bu\v{z}ek-Hillery Universal Quantum Cloning machine protocol and show that it allows better values for fidelity and Hilbert-Schmidt norm than hitherto reported. This higher value for the fidelity is identical to the…
Multiple-copy state discrimination is a fundamental task in quantum information processing. If there are two, pure, non-orthogonal states then both local and collective schemes are known to reach the Helstrom bound, the maximum probability…
"Broadcasting", namely distributing information over many users, suffers in-principle limitations when the information is quantum. This poses a critical issue in quantum information theory, for distributed processing and networked…
The basic idea of quantum computing is surprisingly similar to that of kernel methods in machine learning, namely to efficiently perform computations in an intractably large Hilbert space. In this paper we explore some theoretical…