Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTutorial: Gate-based superconducting quantum computing
241
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In this tutorial, we introduce basic conceptual elements to understand and build a gate-based superconducting quantum computing system.
rate research
Read More
The stored-program architecture is canonical in classical computing, while its power has not been fully recognized for the quantum case. We study quantum information processing with stored quantum program states, i.e., using qubits instead of bits to encode quantum operations. We develop a stored-program model based on Choi states, following from channel-state duality, and a symmetry-based generalization of deterministic gate teleportation. Our model enriches the family of universal models for quantum computing, and can also be employed for tasks including quantum simulation and communication.
Quantum Random Walks, which have drawn much attention over the past few decades for their distinctly non-classical behavior, is a promising subfield within Quantum Computing. Theoretical framework and applications for these walks have seen many great mathematical advances, with experimental demonstrations now catching up. In this study, we examine the viability of implementing Coin Quantum Random Walks using a Quantum Adder based Shift Operator, with quantum circuit designs specifically for superconducting qubits. We focus on the strengths and weaknesses of these walks, particularly circuit depth, gate count, connectivity requirements, and scalability. We propose and analyze a novel approach to implementing boundary conditions for these walks, demonstrating the technique explicitly in one and two dimensions. And finally, we present several fidelity results from running our circuits on IBMs quantum volume 32 `Toronto chip, showcasing the extent to which these NISQ devices can currently handle quantum walks.
We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster-state provides the quantum resource, while the iteration of sequential measurements and local rotations encodes the quantum algorithm. Up to now, technical constraints have limited a scalable approach to this quantum computing alternative. The initial cluster state can be generated with available controlled-phase gates, while the quantum algorithm makes use of high-fidelity readout and coherent feedforward. With current technology, we estimate that quantum algorithms with above 20 qubits may be implemented in the path towards quantum supremacy. Moreover, we propose an alternative initial state with properties of maximal persistence and maximal connectedness, reducing the required resources of one-way quantum computing protocols.
Implementing precise operations on quantum systems is one of the biggest challenges for building quantum devices in a noisy environment. Dynamical decoupling (DD) attenuates the destructive effect of the environmental noise, but so far it has been used primarily in the context of quantum memories. Here, we present a general scheme for combining DD with quantum logical gate operations and demonstrate its performance on the example of an electron spin qubit of a single nitrogen-vacancy center in diamond. We achieve process fidelities >98% for gate times that are 2 orders of magnitude longer than the unprotected dephasing time $T_{2}$.
Blind quantum computation (BQC) allows that a client who has limited quantum abilities can delegate quantum computation to a server who has advanced quantum technologies but learns nothing about the clients private information. For example, measurement-based model can guarantee privacy of clients inputs, quantum algorithms and outputs. However, it still remains a challenge to directly encrypt quantum algorithms in circuits model. To solve the problem, we propose GTUBQC, the first gate teleportation-based universal BQC protocol. Specifically, in this paper we consider a scenario where there are a trusted center responsible for preparing initial states, a client with the ability to perform X, Z, and two non-communicating servers conducting UBQC (universal BQC) and Bell measurements. GTUBQC ensures that all quantum outputs are at the clients side and the client only needs to detect whether servers honestly return correct measurement outcomes or not. In particular, GTUBQC can hide the universal quantum gates by encrypting the rotation angles, because arbitrary unitary operation can be decomposed into a combination of arbitrary rotation operators. Also, GTUBQC protocol can facilitate realizing UBQC in circuits, since GTUBQC uses one-time-pad to guarantee blindness. We prove the blindness and correctness of GTUBQC, and apply our approach to other types of computational tasks, such as quantum Fourier transform.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
