Generation of perfectly entangled two and three qubits states by classical random interaction

Abstract

This study examines the possibility of finding perfect entanglers for a Hamiltonian which corresponds to several quantum information platforms of interest at the present time. However, in this study, we use a superconducting circuit that stands out from other quantum-computing devices, especially because Transmon qubits can be coupled via capacitors or microwave cavities, which enable us to combine high coherence, fast gates, and high flexibility in its design parameters. There are currently two factors limiting the performance of superconducting processors: timing mismatch and the limitation of entangling gates to two qubits. In this work, we present a two-qubit SWAP and a three-qubit Fredkin gate, additionally, we also demonstrate a perfect adiabatic entanglement generation between two and three programmable superconducting qubits. Furthermore, in this study, we also demonstrate the impact of random dephasing, emission, and absorption noises on the quantum gates and entanglement. It is demonstrated by numerical simulation that the CSWAP gate and $W$-state generation can be achieved perfectly in one step with high reliability under weak coupling conditions. Hence, our scheme could contribute to quantum teleportation, quantum communication, and some other areas of quantum information processing.

References in corpus (29)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Elementary gates for quantum computation
• Quantum Computing
• Three qubits can be entangled in two inequivalent ways
• Quantum information processing with superconducting circuits: a review
• A short introduction to the Lindblad Master Equation
• Photonic quantum information processing: a concise review
• Preparation and Measurement of Three-Qubit Entanglement in a Superconducting Circuit
• A Simple Quantum Computer
• Generation of Three-Qubit Entangled States using Superconducting Phase Qubits
• A Grand Unification of Quantum Algorithms
• Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
• Bell's theorem with and without inequalities for the three-qubit Greenberger-Horne-Zeilinger and W states
• Parallel Entangling Operations on a Universal Ion Trap Quantum Computer
• Local vs global master equation with common and separate baths: superiority of the global approach in partial secular approximation
• GHZ versus W : Quantum Teleportation through Noisy Channels
• Tutorial: Gate-based superconducting quantum computing
• Scheme for the generation of an entangled four-photon W-state
• Tunable coupler for realizing a controlled-phase gate with dynamically decoupled regime in a superconducting circuit
• Quantum Algorithm for Spectral Measurement with Lower Gate Count
• Implementation of the XY interaction family with calibration of a single pulse
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets
• Five Two-Qubit Gates Are Necessary for Implementing Toffoli Gate
• Generation of N-qubit W state with rf-SQUID qubits by adiabatic passage
• Measurement-based Synthesis of multi-qubit Entangled States in Superconducting Cavity QED
• Optimal control of superconducting gmon qubits using Pontryagin's minimum principle: preparing a maximally entangled state with singular bang-bang protocols
• Transitionless-based shortcuts for the fast and robust generation of W states
• Thermal entanglement of superconducting qubits for arbitrary interaction strength
• Acute entanglement and Photon/Phonons statistics in a balanced/unbalanced PT-symmetry systems