Digital-Analog Quantum Simulations Using the Cross-Resonance Effect

  title={Digital-Analog Quantum Simulations Using the Cross-Resonance Effect},
  author={Tasio Gonzalez-Raya and Rodrigo Asensio-Perea and Ana Martin and Lucas Chibebe C'eleri and Mikel Sanz and Pavel Lougovski and Eugene F. Dumitrescu},
  journal={arXiv: Quantum Physics},
Digital-analog quantum computation aims to reduce the currently infeasible resource requirements needed for near-term quantum information processing by replacing a series of two-qubit gates with a unitary transformation generated by the systems underlying Hamiltonian. Inspired by this paradigm, we consider superconducting architectures and extend the cross-resonance effect, up to first order in perturbation theory, from a pair of qubits to 1D chains and 2D square lattices. In an appropriate… 

Figures and Tables from this paper

Superconducting circuit architecture for digital-analog quantum computing
A superconducting circuit architecture suitable for digital-analog quantum computing (DAQC) based on an enhanced NISQ family of nearest-neighbor interactions is proposed, making a smart use of digital steps and analog blocks to outperform digital quantum computing algorithms.
Noise in Digital and Digital-Analog Quantum Computation
A careful comparison between digital and digital-analog paradigms under the presence of noise sources shows that, when the different noise channels usually present in superconducting quantum processors are considered, the fidelity of the QFT algorithm for thedigital-an analog paradigm outperforms the one obtained for the digital approach.
Fourier-based quantum signal processing
An algorithm for Hermitian-operator function design from an oracle given by the unitary evolution with respect to that operator at a fixed time is presented, which implements a Fourier approximation of the target function based on the iteration of a basic sequence of single-qubit gates, for which it is proved the expressibility.
Quantum simulation and ground state preparation for the honeycomb Kitaev model
We propose a quantum protocol that allows preparing a ground state (GS) of the honeycomb Kitaev model. Our approach efficiently uses underlying symmetries and techniques from topological error


Digital-analog quantum computation
The proposed DAQC approach combines the robustness of analog quantum computing with the flexibility of digital methods, and proves the universal character of the ubiquitous Ising Hamiltonian.
Enhanced connectivity of quantum hardware with digital-analog control
A hybrid digital-analog quantum algorithm is proposed that enhances the physical connectivity among qubits coupled by an arbitrary inhomogeneous nearest-neighbour Ising Hamiltonian and generates an arbitrary all-to-all IsingHamiltonian only by employing single-qubit rotations.
Digital-analog quantum simulations with superconducting circuits
The discussed merge of quantum simulation concepts, digital and analog, may open the possibility in the near future for outperforming classical computers in relevant problems, enabling the reach of a quantum advantage.
Digital-analog quantum algorithm for the quantum Fourier transform
It is shown that, under reasonable assumptions about noise models, the fidelity of the quantum Fourier transformation improves considerably using this approach, suggesting that, in the Noisy Intermediate-Scale Quantum (NISQ) era, hybrid protocols combining digital and analog quantum computing could be a sensible approach to reach useful quantum supremacy.
Floquet Quantum Simulation with Superconducting Qubits
We propose a quantum algorithm for simulating spin models based on periodic modulation of transmon qubits. Using Floquet theory we derive an effective time-averaged Hamiltonian, which is of the
Adiabatic Quantum Simulation of Quantum Chemistry
A procedure to map electronic structure Hamiltonians to 2-body qubit Hamiltonians with a small set of physically realizable couplings with precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size is described.
First-principles analysis of cross-resonance gate operation
We present a comprehensive theoretical study of the cross-resonance gate operation covering estimates for gate parameters and gate error as well as analyzing spectator qubits and multi-qubit
Charge-insensitive qubit design derived from the Cooper pair box
Short dephasing times pose one of the main challenges in realizing a quantum computer. Different approaches have been devised to cure this problem for superconducting qubits, a prime example being
Efficient Z gates for quantum computing
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
Digital-Analog Quantum Simulation of Spin Models in Trapped Ions
It is shown that the quantum dynamics of an enhanced variety of spin models could be implemented with substantially less number of gates than a fully digital approach.