Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAn exact effective two-qubit gate in a chain of three spins
78
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We show that an effective two-qubit gate can be obtained from the free evolution of three spins in a chain with nearest neighbor XY coupling, without local manipulations. This gate acts on the two remote spins and leaves the mediating spin unchanged. It can be used to perfectly transfer an arbitrary quantum state from the first spin to the last spin or to simultaneously communicate one classical bit in each direction. One ebit can be generated in half of the time for state transfer. For longer spin chains, we present methods to create or transfer entanglement between the two end spins in half of the time required for quantum state transfer, given tunable coupling strength and local magnetic field. We also examine imperfect state transfer through a homogeneous XY chain.
rate research
Read More
Benchmarking and characterising quantum states and logic gates is essential in the development of devices for quantum computing. We introduce a Bayesian approach to self-consistent process tomography, called fast Bayesian tomography (FBT), and experimentally demonstrate its performance in characterising a two-qubit gate set on a silicon-based spin qubit device. FBT is built on an adaptive self-consistent linearisation that is robust to model approximation errors. Our method offers several advantages over other self-consistent tomographic methods. Most notably, FBT can leverage prior information from randomised benchmarking (or other characterisation measurements), and can be performed in real time, providing continuously updated estimates of full process matrices while data is acquired.
We report the first complete characterization of single-qubit and two-qubit gate fidelities in silicon-based spin qubits, including cross-talk and error correlations between the two qubits. To do so, we use a combination of standard randomized benchmarking and a recently introduced method called character randomized benchmarking, which allows for more reliable estimates of the two-qubit fidelity in this system. Interestingly, with character randomized benchmarking, the two-qubit CPhase gate fidelity can be obtained by studying the additional decay induced by interleaving the CPhase gate in a reference sequence of single-qubit gates only. This work sets the stage for further improvements in all the relevant gate fidelities in silicon spin qubits beyond the error threshold for fault-tolerant quantum computation.
We investigate the fidelity of the quantum state transfer (QST) of two qubits by means of an arbitrary spin-1/2 network, on a lattice of any dimensionality. Under the assumptions that the network Hamiltonian preserves the magnetization and that a fully polarized initial state is taken for the lattice, we obtain a general formula for the average fidelity of the two qubits QST, linking it to the one- and two-particle transfer amplitudes of the spin-excitations among the sites of the lattice. We then apply this formalism to a 1D spin chain with XX-Heisenberg type nearest-neighbour interactions adopting a protocol that is a generalization of the single qubit one proposed in Ref. [Phys. Rev. A 87, 062309 (2013)]. We find that a high-quality two qubit QST can be achieved provided one can control the local fields at sites near the sender and receiver. Under such conditions, we obtain an almost perfect transfer in a time that scales either linearly or, depending on the spin number, quadratically with the length of the chain.
We propose $mathrm{SQiSW}$, the matrix square root of the standard $mathrm{iSWAP}$ gate, as a native two-qubit gate for superconducting quantum computing. We show numerically that it has potential for an ultra-high fidelity implementation as its gate time is half of that of $mathrm{iSWAP}$, but at the same time it possesses powerful information processing capabilities in both the compilation of arbitrary two-qubit gates and the generation of large-scale entangled W-like states. Even though it is half of an $mathrm{iSWAP}$ gate, its capabilities surprisingly rival and even surpass that of $mathrm{iSWAP}$ or other incumbent native two-qubit gates such as $mathrm{CNOT}$. To complete the case for its candidacy, we propose a detailed compilation, calibration and benchmarking framework. In particular, we propose a variant of randomized benchmarking called interleaved fully randomized benchmarking (iFRB) which provides a general and unified solution for benchmarking non-Clifford gates such as $mathrm{SQiSW}$. For the reasons above, we believe that the $mathrm{SQiSW}$ gate is worth further study and consideration as a native two-qubit gate for both fault-tolerant and noisy intermediate-scale quantum (NISQ) computation.
Leakage errors damage a qubit by coupling it to other levels. Over the years, several theoretical approaches to dealing with such errors have been developed based on perturbation arguments. Here we propose a different strategy: we use a sequence of finite rotation gates to exactly eliminate leakage errors. The strategy is illustrated by the recently proposed charge quadrupole qubit in a triple quantum dot, where there are two logical states to support the qubit and one leakage state. We have found an su(2) subalgebra in the three-level system, and by using the subalgebra we show that ideal Pauli x and z rotations, which are universal for single-qubit gates, can be generated by two or three propagators of experimentally-available Hamiltonians. The proposed strategy does not require additional pulses, is independent of error magnitude, and potentially reduces experimental overheads. In addition, the magnitude of detuning fluctuation can be estimated based on the exact solution.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
