Simulating nonlinear optical processes on a superconducting quantum device

  1. Yuan Shi,
  2. Bram Evert,
  3. Amy F. Brown,
  4. Vinay Tripathi,
  5. Eyob A. Sete,
  6. Vasily Geyko,
  7. Yujin Cho,
  8. Jonathan L DuBois,
  9. Daniel Lidar,
  10. Ilon Joseph,
  11. and Matt Reagor
Simulating plasma physics on quantum computers is difficult, because most problems of interest are nonlinear, but quantum computers are not naturally suitable for nonlinear operations.
In weakly nonlinear regimes, plasma problems can be modeled as wave-wave interactions. In this paper, we develop a quantization approach to convert nonlinear wave-wave interaction problems to Hamiltonian simulation problems. We demonstrate our approach using two qubits on a superconducting device. Unlike a photonic device, a superconducting device does not naturally have the desired interactions in its native Hamiltonian. Nevertheless, Hamiltonian simulations can still be performed by decomposing required unitary operations into native gates. To improve experimental results, we employ a range of error mitigation techniques. Apart from readout error mitigation, we use randomized compilation to transform undiagnosed coherent errors into well-behaved stochastic Pauli channels. Moreover, to compensate for stochastic noise, we rescale exponentially decaying probability amplitudes using rates measured from cycle benchmarking. We carefully consider how different choices of product-formula algorithms affect the overall error and show how a trade-off can be made to best utilize limited quantum resources. This study provides a point example of how plasma problems may be solved on near-term quantum computing platforms.

Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits

  1. Yujin Cho,
  2. Kristin M. Beck,
  3. Alessandro R. Castelli,
  4. Kyle A. Wendt,
  5. Bram Evert,
  6. Matthew J. Reagor,
  7. and Jonathan L DuBois
Advanced simulations and calculations on quantum computers require high fidelity implementations of quantum circuits. The universal gateset approach builds complex unitaries from many
gates drawn from a small set of calibrated high-fidelity primitive gates, which results in a lower combined fidelity. Compiling a complex unitary for processors with higher-dimensional logical elements, such as qutrits, exacerbates the accumulated error per unitary because a longer gate sequence is needed. Optimal control methods promise time and resource efficient compact gate sequences and, therefore, higher fidelity. These methods generate pulses that can, in principle, directly implement any complex unitary on a quantum device. In this work, we demonstrate that any arbitrary qutrit gate can be realized with high fidelity. We generated and tested pulses for a large set of randomly selected arbitrary unitaries on two separate qutrit compatible processors, LLNL Quantum Device and Integration Testbed (QuDIT) standard QPU and Rigetti Aspen-11, achieving an average fidelity around 99 %. We show that the optimal control gates do not require recalibration for at least three days and the same calibration parameters can be used for all implemented gates. Our work shows that the calibration overheads for optimal control gates can be made small enough to enable efficient quantum circuits based on this technique.