SearcharxivSearch

arXiv subjects

C. R. Wie

Publications and source records attributed to C. R. Wie.

2 recordsLinked to original sources

Two-Qubit Bloch Sphere

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 base qubit and the non-local entanglement measure, concurrence, while the fiber sphere represents the fiber qubit via a simple rotation under a local single-qubit unitary operation; however, in an entangled bipartite state, the fiber sphere has no information on the reduced density matrix of the fiber qubit. When the bipartite state becomes separable, the base and fiber spheres seamlessly become the single-qubit Bloch spheres of each qubit. Since either qubit can be chosen as the base qubit, two alternative sets of these three spheres are available, where each set fully represents the bipartite pure state, and each set has information of the reduced density matrix of its base qubit. Comparing this model to the two Bloch balls representing the reduced density matrices of the two qubits, each Bloch ball corresponds to two unit spheres in our model, namely, the base and entanglement spheres. The concurrence-coherence complementarity is explicitly shown on the entanglement sphere via a single angle.

quant-ph

Simpler Quantum Counting

A simpler quantum counting algorithm based on amplitude amplification is presented. This algorithm is bounded by O(sqrt(N/M)) calls to the controlled-Grover operator where M is the number of marked states and N is the total number of states in the search space. This algorithm terminates within log(sqrt(N/M)) consecutive measurement steps when the probability p1 of measuring the state |1> is at least 0.5, and the result from the final step is used in estimating M by a classical post processing. The purpose of controlled-Grover iteration is to increase the probability p1. This algorithm requires less quantum resources in terms of the width and depth of the quantum circuit, produces a more accurate estimate of M, and runs significantly faster than the phase estimation-based quantum counting algorithm when the ratio M/N is small. We compare the two quantum counting algorithms by simulating various cases with a different M/N ratio, such as M/N > 0.125 or M/N < 0.001.

quant-ph