A switching approach for perfect state transfer over a scalable and routing enabled network architecture with superconducting qubits

Abstract

We propose a hypercube switching architecture for the perfect state transfer (PST) where we prove that it is always possible to find an induced hypercube in any given hypercube of any dimension such that PST can be performed between any two given vertices of the original hypercube. We then generalise this switching scheme over arbitrary number of qubits where also this routing feature of PST between any two vertices is possible. It is shown that this is optimal and scalable architecture for quantum computing with the feature of routing. This allows for a scalable and growing network of qubits. We demonstrate this switching scheme to be experimentally realizable using superconducting transmon qubits with tunable couplings. We also propose a PST assisted quantum computing model where we show the computational advantage of using PST against the conventional resource expensive quantum swap gates. In addition, we present the numerical study of signed graphs under Corona product of graphs and show few examples where PST is established, in contrast to pre-existing results in the literature for disproof of PST under Corona product. We also report an error in pre-existing research for qudit state transfer over Bosonic Hamiltonian where unitarity is violated.

arXiv commentMaster Thesis for undergraduate integrated BS-MS course in Physics. arXiv admin note: substantial text overlap with arXiv:1102.2338, arXiv:quant-ph/0411020, arXiv:quant-ph/0212041 by other authors; text overlap with arXiv:1908.10018, arXiv:1803.09813, arXiv:quant-ph/0312126 by other authors

References in corpus (29)

• Quantum Computing in the NISQ era and beyond
• Charge insensitive qubit design derived from the Cooper pair box
• Cavity quantum electrodynamics for superconducting electrical circuits: an architecture for quantum computation
• Probing many-body dynamics on a 51-atom quantum simulator
• The Physical Implementation of Quantum Computation
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Engineered 2D Ising interactions on a trapped-ion quantum simulator with hundreds of spins
• State preservation by repetitive error detection in a superconducting quantum circuit
• Quantum information processing with circuit quantum electrodynamics
• Qubit architecture with high coherence and fast tunable coupling
• Perfect Transfer of Arbitrary States in Quantum Spin Networks
• 10-qubit entanglement and parallel logic operations with a superconducting circuit
• Scalable gate architecture for densely packed semiconductor spin qubits
• Qubit-oscillator dynamics in the dispersive regime: analytical theory beyond rotating-wave approximation
• Entanglement dynamics and quantum state transport in spin chains
• Experimental Perfect Quantum State Transfer
• A scalable architecture for quantum computation with molecular nanomagnets
• Scalable superconducting qubit circuits using dressed states
• Perfect Quantum Routing in Regular Spin Networks
• High-fidelity measurement of qubits encoded in multilevel superconducting circuits
• Perfect state transfer and efficient quantum routing: a discrete-time quantum walk approach
• The Basics of Perfect Communication through Quantum Networks
• Perfect state transfer in networks of arbitrary topology and coupling configuration
• Perfect State Transfer without State Initialization and Remote Collaboration
• Pretty good state transfer of entangled states through quantum spin chains
• Quantum switching networks for perfect qubit routing
• Statics and Dynamics of Quantum XY and Heisenberg Systems on Graphs
• Perfect transference of a d-level quantum state over pseudo-distance-regular networks
• Corona product of signed graphs and its application to signed network modelling