Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantum cobwebs: Universal entangling of quantum states
56
0
0.0
(
0
)
Authors
Arun Kumar Pati
Ask ChatGPT about the research
No Arabic abstract
Entangling an unknown qubit with one type of reference state is generally impossible. However, entangling an unknown qubit with two types of reference states is possible. To achieve this, we introduce a new class of states called zero sum amplitude (ZSA) multipartite, pure entangled states for qubits and study their salient features. Using shared-ZSA state, local operation and classical communication we give a protocol for creating multipartite entangled states of an unknown quantum state with two types of reference states at remote places. This provides a way of encoding an unknown pure qubit state into a multiqubit entangled state. We quantify the amount of classical and quantum resources required to create universal entangled states. This is possibly a strongest form of quantum bit hiding with multiparties.
rate research
Read More
Quantum logic gates must perform properly when operating on their standard input basis states, as well as when operating on complex superpositions of these states. Experiments using superconducting qubits have validated the truth table for particular implementations of e.g. the controlled-NOT gate [1,2], but have not fully characterized gate operation for arbitrary superpositions of input states. Here we demonstrate the use of quantum process tomography (QPT) [3,4] to fully characterize the performance of a universal entangling gate between two superconducting quantum bits. Process tomography permits complete gate analysis, but requires precise preparation of arbitrary input states, control over the subsequent qubit interaction, and simultaneous single-shot measurement of the output states. We use QPT to measure the fidelity of the entangling gate and to quantify the decoherence mechanisms affecting the gate performance. In addition to demonstrating a promising fidelity, our entangling gate has a on/off ratio of 300, a level of adjustable coupling that will become a requirement for future high-fidelity devices. This is the first solid-state demonstration of QPT in a two-qubit system, as solid-state process tomography has previously only been demonstrated with single qubits [5,6].
Generative adversarial networks (GANs) are one of the most widely adopted semisupervised and unsupervised machine learning methods for high-definition image, video, and audio generation. In this work, we propose a new type of architecture for quantum generative adversarial networks (entangling quantum GAN, EQ-GAN) that overcomes some limitations of previously proposed quantum GANs. Leveraging the entangling power of quantum circuits, EQ-GAN guarantees the convergence to a Nash equilibrium under minimax optimization of the discriminator and generator circuits by performing entangling operations between both the generator output and true quantum data. We show that EQ-GAN has additional robustness against coherent errors and demonstrate the effectiveness of EQ-GAN experimentally in a Google Sycamore superconducting quantum processor. By adversarially learning efficient representations of quantum states, we prepare an approximate quantum random access memory (QRAM) and demonstrate its use in applications including the training of quantum neural networks.
Quantum catalysis is a fascinating concept which demonstrates that certain transformations can only become possible when given access to a specific resource that has to be returned unaffected. It was first discovered in the context of entanglement theory and since then applied in a number of resource-theoretic frameworks, including quantum thermodynamics. Although in that case the necessary (and sometimes also sufficient) conditions on the existence of a catalyst are known, almost nothing is known about the precise form of the catalyst state required by the transformation. In particular, it is not clear whether it has to have some special properties or be finely tuned to the desired transformation. In this work we describe a surprising property of multi-copy states: we show that in resource theories governed by majorization all resourceful states are catalysts for all allowed transformations. In quantum thermodynamics this means that the so-called second laws of thermodynamics do not require a fine-tuned catalyst but rather any state, given sufficiently many copies, can serve as a useful catalyst. These analytic results are accompanied by several numerical investigations that indicate that neither a multi-copy form nor a very large dimension catalyst are required to activate most allowed transformations catalytically.
We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For universal quantum computation, a nonlinear element is required. This can be satisfied by adding to the toolbox any single-mode non-Gaussian measurement, while the initial cluster state itself remains Gaussian. Homodyne detection alone suffices to perform an arbitrary multi-mode Gaussian transformation via the cluster state. We also propose an experiment to demonstrate cluster-based error reduction when implementing Gaussian operations.
Probabilistic quantum cloning and identifying machines can be constructed via unitary-reduction processes [Duan and Guo, Phys. Rev. Lett. 80, 4999 (1998)]. Given the cloning (identifying) probabilities, we derive an explicit representation of the unitary evolution and corresponding Hamiltonian to realize probabilistic cloning (identification). The logic networks are obtained by decomposing the unitary representation into universal quantum logic operations. The robustness of the networks is also discussed. Our method is suitable for a $k$-partite system, such as quantum computer, and may be generalized to general state-dependent cloning and identification.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
