Abstract Quantum entanglement lies at the heart of quantum mechanics in both fundamental and practical aspects. The entanglement of quantum states has been studied widely both theoretically and experimentally, however, the entanglement of operators has not been studied much experimentally in spite of its importance. Here, we propose a scheme to realize arbitrary entangled operations based on a coherent superposition of local operations with a non-zero probability of failure. Then, we experimentally implement several intriguing two-qubit entangled operations in photonic systems. We also discuss the generalization of our scheme to extend the number of superposed operations and the number of qubits. Due to the simplicity of our scheme, we believe that it can reduce the complexity or required resources of the quantum circuits and provide insights to investigate properties of entangled operations.
There has recently been much discussion regarding entanglement transformations in terms of local filtering operations and whether the optimal entanglement for an arbitrary two-qubit state could be realized. We introduce an experimentally realizable scheme for manipulating the entanglement of an arbitrary state of two polarization-entangled qubits. This scheme is then used to provide some perspective to the mathematical concepts inherent in this field with respect to a laboratory environment. Specifically, we look at how to extract enhanced entanglement from systems with a fixed rank, and, in the case where the rank of the density operator for the state can be reduced, show how the state can be made arbitrarily close to a maximally entangled pure state. In this context we also discuss bounds on entanglement in mixed states.
In this thesis, we report the theoretical and experimental investigations towards the creation, characterization, and manipulation of quantum entanglement in a photonic system. We examine two different aspects of quantum entanglement: In the first part, we discuss the experimental method for the preparation and characterization of SPDC-based polarization-entangled photon source. We provide a review study comparing different Entanglement Measures for non-maximally entangled two-qubit pure states and extend this analysis to higher-dimensional systems. In the second part, we study the entanglement dynamics of a two-qubit system in the presence of an Amplitude Damping Channel and present a scheme based on local unitary operations to protect entanglement from undergoing Entanglement Sudden Death. We extend the decoherence study to qubit-qutrit and qutrit-qutrit entangled systems and propose an entanglement protection scheme for the higher dimensional system.
Although quantum computers promise significant advantages, the complexity of quantum algorithms remains a major technological obstacle. We have developed and demonstrated an architecture-independent technique that simplifies adding control qubits to arbitrary quantum operations—a requirement in many quantum algorithms, simulations and metrology. The technique, which is independent of how the operation is done, does not require knowledge of what the operation is, and largely separates the problems of how to implement a quantum operation in the laboratory and how to add a control. Here, we demonstrate an entanglement-based version in a photonic system, realizing a range of different two-qubit gates with high fidelity. Quantum computing has advantages over conventional computing, but the complexity of quantum algorithms creates technological challenges. Here, an architecture-independent technique, that simplifies adding control qubits to arbitrary quantum operations, is developed and demonstrated.
A crucial subroutine in quantum computing is to load the classical data of
N complex numbers into the amplitude of a superposed $n=\ensuremath{\lceil}{log}_{2}N\ensuremath{\rceil}$-qubit state. It has been proven that any algorithm universally implementing this subroutine would need at least
O(N) constant weight operations. However, the proof assumes that only
n qubits are used, whereas the circuit depth could be reduced by extending the space and allowing ancillary qubits. Here we investigate this space-time tradeoff in quantum state preparation with classical data. We propose quantum algorithms with
O(n2) circuit depth to encode any
N complex numbers using only single- and two-qubit gates, and local measurements with ancillary qubits. Different variances of the algorithm are proposed with different space and runtime. In particular, we present a scheme with
O(N2) ancillary qubits,
O(n2) circuit depth, and
O(n2) average runtime, which exponentially improves the conventional bound. While the algorithm requires more ancillary qubits, it consists of quantum circuit blocks that only simultaneously act on a constant number of qubits, and at most
O(n) qubits are entangled. We also prove a fundamental lower bound $\mathrm{\ensuremath{\Omega}}(n)$ for the minimum circuit depth and runtime with an arbitrary number of ancillary qubits, aligning with our scheme with
O(n2). The algorithms are expected to have wide applications in both near-term and universal quantum computing.
Superposition, arguably the most fundamental property of quantum mechanics, lies at the heart of quantum information science. However, how to create the superposition of any two unknown pure states remains as a daunting challenge. Recently, it was proved that such a quantum protocol does not exist if the two input states are completely unknown, whereas a probabilistic protocol is still available with some prior knowledge about the input states [M. Oszmaniec et al., Phys. Rev. Lett. 116, 110403 (2016)]. The knowledge is that both of the two input states have nonzero overlaps with some given referential state. In this work, we experimentally realize the probabilistic protocol of superposing two pure states in a three-qubit nuclear magnetic resonance system. We demonstrate the feasibility of the protocol by preparing a families of input states, and the average fidelity between the prepared state and expected superposition state is over 99%. Moreover, we experimentally illustrate the limitation of the protocol that it is likely to fail or yields very low fidelity, if the nonzero overlaps are approaching zero. Our experimental implementation can be extended to more complex situations and other quantum systems.
The generation, manipulation and fundamental understanding of entanglement lies at very heart of quantum mechanics. Among various types of entangled states, the NOON states are a kind of special quantum entangled states with two orthogonal component states in maximal superposition, which have a wide range of potential applications in quantum communication and quantum information processing. Here, we propose a fast and simple scheme for generating NOON states of photons in two superconducting resonators by using a single superconducting transmon qutrit. Because only one superconducting qutrit and two resonators are used, the experimental setup for this scheme is much simplified when compared with the previous proposals requiring a setup of two superconducting qutrits and three cavities. In addition, this scheme is easier and faster to implement than the previous proposals, which require using a complex microwave pulse, or a small pulse Rabi frequency in order to avoid nonresonant transitions.