Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userGeometric vs. Dynamical Gates in Quantum Computing Implementations Using Zeeman and Heisenberg Hamiltonians
135
0
0.0
(
0
)
Authors
Yu Shi
Ask ChatGPT about the research
No Arabic abstract
Quantum computing in terms of geometric phases, i.e. Berry or Aharonov-Anandan phases, is fault-tolerant to a certain degree. We examine its implementation based on Zeeman coupling with a rotating field and isotropic Heisenberg interaction, which describe NMR and can also be realized in quantum dots and cold atoms. Using a novel physical representation of the qubit basis states, we construct $pi/8$ and Hadamard gates based on Berry and Aharonov-Anandan phases. For two interacting qubits in a rotating field, we find that it is always impossible to construct a two-qubit gate based on Berry phases, or based on Aharonov-Anandan phases when the gyromagnetic ratios of the two qubits are equal. In implementing a universal set of quantum gates, one may combine geometric $pi/8$ and Hadamard gates and dynamical $sqrt{rm SWAP}$ gate.
rate research
Read More
For superconducting qubits, microwave pulses drive rotations around the Bloch sphere. The phase of these drives can be used to generate zero-duration arbitrary virtual Z-gates which, combined with two $X_{pi/2}$ gates, can generate any SU(2) gate. Here we show how to best utilize these virtual Z-gates to both improve algorithms and correct pulse errors. We perform randomized benchmarking using a Clifford set of Hadamard and Z-gates and show that the error per Clifford is reduced versus a set consisting of standard finite-duration X and Y gates. Z-gates can correct unitary rotation errors for weakly anharmonic qubits as an alternative to pulse shaping techniques such as DRAG. We investigate leakage and show that a combination of DRAG pulse shaping to minimize leakage and Z-gates to correct rotation errors (DRAGZ) realizes a 13.3~ns $X_{pi/2}$ gate characterized by low error ($1.95[3]times 10^{-4}$) and low leakage ($3.1[6]times 10^{-6}$). Ultimately leakage is limited by the finite temperature of the qubit, but this limit is two orders-of-magnitude smaller than pulse errors due to decoherence.
Complementary idempotent paravectors and their ordered compositions, are used to represent multivector basis elements of geometric Clifford algebra for 3D Euclidean space as the states of a geometric byte in a given frame of reference. Two layers of information, available in real numbers, are distinguished. The first layer is a continuous one. It is used to identify spatial orientations of similar geometric objects in the same computational basis. The second layer is a binary one. It is used to manipulate with 8D structure elements inside the computational basis itself. An oriented unit cube representation, rather than a matrix one, is used to visualize an inner structure of basis multivectors. Both layers of information are used to describe unitary operations -- reflections and rotations -- in Euclidian and Hilbert spaces. The results are compared with ones for quantum gates. Some consequences for quantum and classical information technologies are discussed.
We study numerically the effects of measurements on dynamical localization in the kicked rotator model simulated on a quantum computer. Contrary to the previous studies, which showed that measurements induce a diffusive probability spreading, our results demonstrate that localization can be preserved for repeated single-qubit measurements. We detect a transition from a localized to a delocalized phase, depending on the system parameters and on the choice of the measured qubit.
Geometric quantum gates are conjectured to be more resilient than dynamical gates against certain types of error, which makes them ideal for robust quantum computing. However, there are conflicting claims within the literature about the validity of that robustness conjecture. Here we use dynamical invariant theory in conjunction with filter functions in order to analytically characterize the noise sensitivity of an arbitrary quantum gate. Under certain conditions, we find that there exists a transformation of the Hamiltonian that leaves invariant the final gate and noise sensitivity (as characterized by the filter function) while changing the phase from geometric to dynamical. Our result holds for a Hilbert space of arbitrary dimensions, but we illustrate our result by examining experimentally relevant single-qubit scenarios and providing explicit constructions of such a transformation.
Closed quantum systems exhibit different dynamical regimes, like Many-Body Localization or thermalization, which determine the mechanisms of spread and processing of information. Here we address the impact of these dynamical phases in quantum reservoir computing, an unconventional computing paradigm recently extended into the quantum regime that exploits dynamical systems to solve nonlinear and temporal tasks. We establish that the thermal phase is naturally adapted to the requirements of quantum reservoir computing and report an increased performance at the thermalization transition for the studied tasks. Uncovering the underlying physical mechanisms behind optimal information processing capabilities of spin networks is essential for future experimental implementations and provides a new perspective on dynamical phases.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
