No Arabic abstract
Quantum entanglement is essential to the development of quantum computation, communications, and technology. The controlled SWAP test, widely used for state comparison, can be adapted to an efficient and useful test for entanglement of a pure state. Here we show that the test can evidence the presence of entanglement (and further, genuine n-qubit entanglement), can distinguish entanglement classes, and that the concurrence of a two-qubit state is related to the tests output probabilities. We also propose a multipartite measure of entanglement that acts similarly for n-qubit states. The number of copies required to detect entanglement decreases for larger systems, to four on average for many (n>8) qubits for maximally entangled states. For non-maximally entangled states, the average number of copies of the test state required to detect entanglement increases with decreasing entanglement. Furthermore, the results are robust to second order when typical small errors are introduced to the state under investigation.
Artificial neural network, consisting of many neurons in different layers, is an important method to simulate humain brain. Usually, one neuron has two operations: one is linear, the other is nonlinear. The linear operation is inner product and the nonlinear operation is represented by an activation function. In this work, we introduce a kind of quantum neuron whose inputs and outputs are quantum states. The inner product and activation operator of the quantum neurons can be realized by quantum circuits. Based on the quantum neuron, we propose a model of quantum neural network in which the weights between neurons are all quantum states. We also construct a quantum circuit to realize this quantum neural network model. A learning algorithm is proposed meanwhile. We show the validity of learning algorithm theoretically and demonstrate the potential of the quantum neural network numerically.
Quantum information science addresses how the processing and transmission of information are affected by uniquely quantum mechanical phenomena. Combination of two-qubit gates has been used to realize quantum circuits, however, scalability is becoming a critical problem. The use of three-qubit gates may simplify the structure of quantum circuits dramatically. Among them, the controlled-SWAP (Fredkin) gates are essential since they can be directly applied to important protocols, e.g., error correction, fingerprinting, and optimal cloning. Here we report a realization of the Fredkin gate for photonic qubits. We achieve a fidelity of 0.85 in the computational basis and an output state fidelity of 0.81 for a 3-photon Greenberger-Horne-Zeilinger state. The estimated process fidelity of 0.77 indicates that our Fredkin gate can be applied to various quantum tasks.
The practical use of many types of near-term quantum computers requires accounting for their limited connectivity. One way of overcoming limited connectivity is to insert swaps in the circuit so that logical operations can be performed on physically adjacent qubits, which we refer to as solving the `routing via matchings problem. We address the routing problem for families of quantum circuits defined by a hypergraph wherein each hyperedge corresponds to a potential gate. Our main result is that any unordered set of $k$-qubit gates on distinct $k$-qubit subsets of $n$ logical qubits can be ordered and parallelized in $O(n^{k-1})$ depth using a linear arrangement of $n$ physical qubits; the construction is completely general and achieves optimal scaling in the case where gates acting on all $binom{n}{k}$ sets of $k$ qubits are desired. We highlight two classes of problems for which our method is particularly useful. First, it applies to sets of mutually commuting gates, as in the (diagonal) phase separators of Quantum Alternating Operator Ansatz (Quantum Approximate Optimization Algorithm) circuits. For example, a single level of a QAOA circuit for Maximum Cut can be implemented in linear depth, and a single level for $3$-SAT in quadratic depth. Second, it applies to sets of gates that do not commute but for which compilation efficiency is the dominant criterion in their ordering. In particular, it can be adapted to Trotterized time-evolution of fermionic Hamiltonians under the Jordan-Wigner transformation, and also to non-standard mixers in QAOA. Using our method, a single Trotter step of the electronic structure Hamiltonian in an arbitrary basis of $n$ orbitals can be done in $O(n^3)$ depth while a Trotter step of the unitary coupled cluster singles and doubles method can be implemented in $O(n^2 eta)$ depth, where $eta$ is the number of electrons.
We show that the generation of entanglement of two heavily macroscopic mirrors with masses of up to several kilograms are feasible with state of the art techniques of high-precision laser interferometry. The basis of such a demonstration would be a Michelson interferometer with suspended mirrors and simultaneous homodyne detections at both interferometer output ports. We present the connection between the generation of entanglement and the Standard Quantum Limit (SQL) for a free mass. The SQL is a well-known reference limit in operating interferometers for gravitational-wave detection and provides a measure of when macroscopic entanglement can be observed in the presence of realistic decoherence processes.
The paper reports on experimental diagnostics of entanglement swapping protocol by means of collective entanglement witness. Our approach is suitable to detect disturbances occurring in the preparation of quantum states, quantum communication channel and imperfect Bell-state projection. More specifically we demonstrate that our method can distinguish disturbances such as depolarization, phase-damping, amplitude-damping and imperfect Bell-state measurement by observing four probabilities and estimating collective entanglement witness. Since entanglement swapping is a key procedure for quantum repeaters, quantum relays, device-independent quantum communications or entanglement assisted error correction, this can aid in faster and practical resolution of quality-of-transmission related problems as our approach requires less measurements then other means of diagnostics.