We propose a protocol for perfect state transfer between any pair of vertices in a hypercube. Given a pair of distinct vertices in the hypercube we determine a sub-hypercube that contains the pair of vertices as antipodal vertices. Then a switching process is introduced for determining the sub-hypercube of a memory enhanced hypercube that facilitates perfect state transfer between the desired pair of vertices. Furthermore, we propose a physical architecture for the pretty good state transfer implementation of our switching protocol with fidelity arbitrary close to unity, using superconducting transmon qubits with tunable couplings. The switching is realised by the control over the effective coupling between the qubits resulting from the effect of ancilla qubit couplers for the graph edges. We also report an error bound on the fidelity of state transfer due to faulty implementation of our protocol.
A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with respect to inter-qubit interactions of a quantum system. We perform various perturbations to the hypercube graph---a graph that is known to exhibit PST---to create graphs that maintain many of the same properties of the hypercube, including PST as well as the distance for which PST occurs. We show that the sensitivity with respect to readout time errors remai…
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 develop the work of Christandl et al. [M. Christandl, N. Datta, T. C. Dorlas, A. Ekert, A. Kay, and A. J. Landahl, Phys. Rev. A 71, 032312 (2005)], to show how a d-hypercube homogenous network can be dressed by additional links to perfectly route quantum information between any given input and output nodes in a duration which is independent of the routing chosen and, surprisingly, size of the network.
Perfect and peak state transfer on IBM quantum hardware
QuSoft (Research center for quantum software & technology)（QuSoft（量子软件与技术研究中心））；Korteweg-de Vries Institute for Mathematics, University of Amsterdam（阿姆斯特丹大学柯特维赫-德弗里斯数学研究所）
Superconducting quantum circuits, fabricated with multiple layers, are proposed to implement perfect quantum state transfer between nodes of a hypercube network. For tunable devices such as the phase qubit, each node can transmit quantum information to any other node at a constant rate independent of the distance between qubits. The physical limits of quantum state transfer in this network are theoretically analyzed, including the effects of disorder, decoherence, and higher-order couplings.
We propose a class of qubit networks that admit perfect transfer of any quantum state in a fixed period of time. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to N-qubit spin networks of identical qubit couplings, we show that 2 log_3 N is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain.
A duality between the properties of many spinor bosons on a regular lattice and those of a single particle on a weighted graph reveals that a quantum particle can traverse an infinite hierarchy of networks with perfect probability in polynomial time, even as the number of nodes increases exponentially. The one-dimensional `quantum wire' and the hypercube are special cases in this construction, where the number of spin degrees of freedom is equal to one and the number of particles, respectively. An implementation of near-perfect quantum state transfer across a weighted parallelepiped with ultra…
We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties, and can, by using such systems in parallel, transmit the higher dimensional systems states across the network. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to $N$-qubit spin networks of identical qubit couplings, we show that $2\log_3 N$ is the m…
By considering distance-regular graphs as spin networks, first we introduce some particular spin Hamiltonians which are extended version of those of Refs.\cite{8,9''}. Then, by using spectral analysis techniques and algebraic combinatoric structure of distance-regular graphs such as stratification introduced in \cite{obata, js} and Bose-Mesner algebra, we give a method for finding a set of coupling constants in the Hamiltonians so that a particular state initially encoded on one site of a network will evolve freely to the opposite site without any dynamical controls, i.e., we show that how to …
In this article, we consider a spin-spin interaction network governed by $XX + YY$ Hamiltonian. The vertices and edges of the network represent the spin objects and their interactions, respectively. We take a privilege to switch on or off any interaction, that assists us to perform multiple perfect state transfers in a graph simultaneously. We also build up a salable network allowing quantum communication between two arbitrary vertices. Later we utilize the combinatorial characteristics of hypercube graphs to propose a static routing schema to communicate simultaneously between a set of sender…
Faithfully transferring the quantum state is essential for quantum information processing. Here we demonstrate a fast (in 84 ns) and high-fidelity (99.2%) transfer of arbitrary quantum states in a chain of four superconducting qubits with nearest-neighbor coupling. This transfer relies on full control of the effective couplings between neighboring qubits, which is realized only by our parametrically modulating the qubits without increasing circuit complexity. Once the couplings between qubits fulfill a specific ratio, perfect quantum state transfer can be achieved in a single step, and is ther…
We study perfect state transfer on quantum networks represented by weighted graphs. Our focus is on graphs constructed from the join and related graph operators. Some specific results we prove include: (1) The join of a weighted two-vertex graph with any regular graph has perfect state transfer. This generalizes a result of Casaccino et al. [clms09] where the regular graph is a complete graph or a complete graph with a missing link. In contrast, the half-join of a weighted two-vertex graph with any weighted regular graph has no perfect state transfer. This implies that adding weights in a comp…
Quantum state transfer within a quantum computer can be achieved by using a network of qubits, and such a network can be modelled mathematically by a graph. Here, we focus on the corresponding Laplacian matrix, and those graphs for which the Laplacian can be diagonalized by a Hadamard matrix. We give a simple eigenvalue characterization for when such a graph has perfect state transfer at time $π/2$; this characterization allows one to choose the correct eigenvalues to build graphs having perfect state transfer. We characterize the graphs that are diagonalizable by the standard Hadamard matrix,…
At the core of an ideal single photon detector is an active material that ideally absorbs and converts photons to discriminable electronic signals. A large active material volume favours high-efficiency absorption, but often at the expense of conversion efficiency, noise, speed and timing accuracy. The present work demonstrates how the concept of coherent perfect absorption can be used to relax this trade-off for a waveguide-integrated superconducting nanowire single photon detector. A very short (8.5$μ$m long) and narrow (8$\times$35nm$^2$) U-shaped NbTiN nanowire atop a silicon-on-insulator …
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 …
Superconducting systems such as those modeled by the Kitaev Hamiltonian are found to exhibit the Zitterbewegung (ZB) oscillations. Remarkably, the dispersion relation in one-dimensional Kitaev systems allows for wavepackets of arbitrary size undergoing non-decaying ZB without any distortion, with the typical ZB amplitude being one lattice site. To motivate possible experimental interest in this dynamical aspect of superconducting systems, we further show that certain on-resonance modulation of the Hamiltonian parameter can be exploited to convert ZB oscillations to net drifting of particle's w…
As generalizations of results of Christandl et al.\cite{8,9""} and Facer et al.\cite{Facer}, Bernasconi et al.\cite{godsil,godsil1} studied perfect state transfer (PST) between two particles in quantum networks modeled by a large class of cubelike graphs (e.g., the hypercube) which are the Cayley graphs of the elementary abelian group $Z_2^n$. In Refs. \cite{PST,psd}, respectively, PST of a qubit over distance regular spin networks and optimal state transfer (ST) of a $d$-level quantum state (qudit) over pseudo distance regular networks were discussed, where the networks considered there were …
We propose a protocol for perfect quantum state transfer that is resilient to a broad class of realistic experimental imperfections, including noise sources that could be modelled either as independent Markovian baths or as certain forms of spatially correlated environments. We highlight interesting connections between the fidelity of state transfer and quantum stochastic resonance effects. The scheme is flexible enough to act as an effective entangling gate for the generation of genuine multipartite entanglement in a control-limited setting. Possible experimental implementations using superco…
Transistors play a vital role in classical computers, and their quantum mechanical counterparts could potentially be as important in quantum computers. Where a classical transistor is operated as a switch that either blocks or allows an electric current, the quantum transistor should operate on quantum information. In terms of a spin model the in-going quantum information is an arbitrary qubit state (spin-1/2 state). In this paper, we derive a model of four qubits with Heisenberg interactions that works as a quantum spin transistor, i.e. a system with perfect state transfer or perfect blockade…
The difficulty of an optimization task in quantum information science depends on the proper mathematical expression of the physical target. Here we demonstrate the power of optimization functionals targeting an arbitrary perfect two-qubit entangler, creating a maximally-entangled state out of some initial product state. For two quantum information platforms of current interest, nitrogen vacancy centers in diamond and superconducting Josephson junctions, we show that an arbitrary perfect entangler can be reached faster and with higher fidelity than specific two-qubit gates or local equivalence …
A globally controlled scheme for quantum transport is proposed. The scheme works on a 1D chain of nearest neighbor coupled systems of qudits (finite dimension), or qunats (continuous variable), taking any arbitrary initial quantum state of the chain and producing a final quantum state which is perfectly spatially mirrored about the mid-point of the chain. As a particular novel application, the method can be used to transport continuous variable (CV) quantum states. A physical realization is proposed where it is shown how the quantum states of the microwave fields held in a chain of driven supe…
Dissipation-driven quantum state engineering uses the environment to steer the state of quantum systems and preserve quantum coherence in the steady state. We show that modulating the damping rate of a microwave resonator generates a vacuum squeezed state of arbitrary squeezing strength, thereby constituting a mechanism allowing perfect squeezing. Given the recent experimental realizations in circuit QED of a microwave resonator with a tunable damping rate [Yin et al., Phys. Rev. Lett. 110, 107001 (2013)], superconducting circuits are an ideal playground to implement this technique. By dispers…
We propose a procedure for transferring the state a microwave qubit via a transmission line from one resonator to another resonator, with a theoretical efficiency arbitrarily close to 100%. The emission and capture of the microwave energy is performed using tunable couplers, whose transmission coefficients vary in time. Using the superconducting phase qubit technology and tunable couplers with maximum coupling of 100 MHz, the procedure with theoretical efficiency $η=0.999$ requires a duration of about 400 ns (excluding propagation time) and an ON/OFF ratio of 45. The procedure may also be used…
We analyze the accuracy of quantum phase gates acting on "0-$π$ qubits" in superconducting circuits, where the gates are protected against thermal and Hamiltonian noise by continuous-variable quantum error-correcting codes. The gates are executed by turning on and off a tunable Josephson coupling between an $LC$ oscillator and a qubit or pair of quits; assuming perfect qubits, we show that the gate errors are exponentially small when the oscillator's impedance $\sqrt{L/C}$ is large compared to $\hbar/4e^2 \approx 1\, kΩ$. The protected gates are not computationally universal by themselves, but…
Universal bound on microwave dissipation in superconducting circuits
Univ. Grenoble Alpes, CNRS, Grenoble INP, Institut Néel（格勒诺布尔阿尔卑斯大学，法国国家科学研究中心，格勒诺布尔理工学院，内耳研究所）；Department of Physics, University of California at Santa Barbara（加州大学圣塔芭芭拉分校物理系）；Google Quantum AI（谷歌量子人工智能）；Jožef Stefan Institute（约瑟夫·斯蒂芬研究所）；CENN Nanocenter（CENN纳米中心）
