Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEngineering Fast High-Fidelity Quantum Operations With Constrained Interactions
101
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Understanding how to tailor quantum dynamics to achieve a desired evolution is a crucial problem in almost all quantum technologies. We present a very general method for designing high-efficiency control sequences that are always fully compatible with experimental constraints on available interactions and their tunability. Our approach reduces in the end to finding control fields by solving a set of time-independent linear equations. We illustrate our method by applying it to a number of physically-relevant problems: the strong-driving limit of a two-level system, fast squeezing in a parametrically driven cavity, the leakage problem in transmon qubit gates, and the acceleration of SNAP gates in a qubit-cavity system.
rate research
Read More
Effective transport of quantum information is an essential element of quantum computation. We consider the problem of transporting a quantum state by using a moving potential well, while maintaining the encoded quantum information. In particular, we look at a set of cases where the input control defining the position of the potential well is subject to different types of distortion, each of which is motivated by experimental considerations. We show that even under these conditions, we are able to perfectly transfer the quantum information non-adiabatically over any given distance.
I derive a tight bound between the quality of estimating the state of a single copy of a $d$-level system, and the degree the initial state has to be altered in course of this procedure. This result provides a complete analytical description of the quantum mechanical trade-off between the information gain and the quantum state disturbance expressed in terms of mean fidelities. I also discuss consequences of this bound for quantum teleportation using nonmaximally entangled states.
We present a new and simplified two-qubit randomized benchmarking procedure that operates only in the symmetric subspace of a pair of qubits and is well suited for benchmarking trapped-ion systems. By performing benchmarking only in the symmetric subspace, we drastically reduce the experimental complexity, number of gates required, and run time. The protocol is demonstrated on trapped ions using collective single-qubit rotations and the Molmer-Sorenson (MS) interaction to estimate an entangling gate error of $2(1) times 10^{-3}$. We analyze the expected errors in the MS gate and find that population remains mostly in the symmetric subspace. The errors that mix symmetric and anti-symmetric subspaces appear as leakage and we characterize them by combining our protocol with recently proposed leakage benchmarking. Generalizations and limitations of the protocol are also discussed.
Spin chains have been proposed as quantum wires for information transfer in solid state quantum architectures. We show that huge gains in both transfer speed and fidelity are possible using a minimalist control approach that relies only a single, local, on-off switch actuator. Effective switching time sequences can be determined using optimization techniques for both ideal and disordered chains. Simulations suggest that effective optimization is possible even in the absence of accurate models.
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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
