Fast elementary gates for universal quantum computation with Kerr parametric oscillator qubits

Kerr parametric oscillators (KPOs) can stabilize the superpositions of coherent states, which can be utilized as qubits, and are promising candidates for realizing hardware-efficient quantum computers. Although elementary gates for universal quantum computation with KPO qubits have been proposed, these gates are usually based on adiabatic operations and thus need long gate times, which result in errors caused by photon loss in KPOs realized by, e.g., superconducting circuits. In this work, we accelerate the elementary gates by experimentally feasible control methods, which are based on numerical optimization of pulse shapes for shortcuts to adiabaticity. By numerical simulations, we show that the proposed methods can achieve speedups compared to adiabatic ones by up to six times with high gate fidelities of 99.9%. These methods are thus expected to be useful for quantum computers with KPOs.Comment: 14 pages, 10 figure

Simulated bifurcation for higher-order cost functions

High-performance Ising machines for solving combinatorial optimization problems have been developed with digital processors implementing heuristic algorithms such as simulated bifurcation (SB). Although Ising machines have been designed for second-order cost functions, there are practical problems expressed naturally by higher-order cost functions. In this work, we extend SB to such higher-order cost functions. By solving a problem having third-order cost functions, we show that the higher-order SB can outperform not only the second-order SB with additional spin variables, but also simulated annealing applied directly to the third-order cost functions. This result suggests that the higher-order SB can be practically useful.Comment: 4 pages, 2 figures, 1 tabl

Two-qubit gate using conditional driving for highly detuned Kerr-nonlinear parametric oscillators

A Kerr-nonlinear parametric oscillator (KPO) is one of the promising devices to realize qubits for universal quantum computing. The KPO can stabilize two coherent states with opposite phases, yielding a quantum superposition called a Schr\"{o}dinger cat state. Universal quantum computing with KPOs requires three kinds of quantum gates: $R_z, R_x$, and $R_{zz}$ gates. We theoretically propose a two-qubit gate $R_{zz}$ for highly detuned KPOs. In the proposed scheme, we add another two-photon drive for the first KPO. This leads to the $R_{zz}$ gate based on the driving of the second KPO depending on the first-KPO state, which we call "conditional driving." First, we perform simulations using a conventional KPO Hamiltonian derived from a superconducting-circuit model under some approximations and evaluate the gate fidelity. Next, we also perform numerical simulations of the two-qubit gate using the superconducting-circuit model without the approximations. The simulation results indicate that two-qubit gates can be implemented with high fidelity ($>99.9\%$) for rotation angles required for universality.Comment: 9 pages, 7 figure

Measurement-free fault-tolerant logical zero-state encoding of the distance-three nine-qubit surface code in a one-dimensional qubit array

Generation of logical zero states encoded with a quantum error-correcting code is the first step for fault-tolerant quantum computation, but requires considerably large resource overheads in general. To reduce such overheads, we propose an efficient encoding method for the distance-three, nine-qubit surface code and show its fault tolerance. This method needs no measurement, unlike other fault-tolerant encoding methods. Moreover, this is applicable to a one-dimensional qubit array. Observing these facts, we experimentally demonstrate the logical zero-state encoding of the surface code using a superconducting quantum computer on the cloud. We also experimentally demonstrate the suppression of fast dephasing due to intrinsic residual interactions in this machine by a dynamical decoupling technique dedicated for the qubit array. To extend this method to larger codes, we also investigate the concatenation of the surface code with itself, resulting in a distance-nine, 81-qubit code. We numerically show that fault-tolerant encoding of this large code can be achieved by appropriate error detection. Thus, the proposed encoding method will provide a new way to low-overhead fault-tolerant quantum computation.Comment: 8 pages, 5 figure

Control of the ZZZZ coupling between Kerr-cat qubits via transmon couplers

Kerr-cat qubits are a promising candidate for fault-tolerant quantum computers owing to the biased nature of errors. The $ZZ$ coupling between the qubits can be utilized for a two-qubit entangling gate, but the residual coupling causes unnecessary always-on gates and crosstalk. In order to resolve this problem, we propose a tunable $ZZ$-coupling scheme using two transmon couplers. By setting the detunings of the two couplers at opposite values, the residual $ZZ$ couplings via the two couplers cancel each other out. We also apply our scheme to the $R_{zz}(\Theta)$ gate ($ZZ$ rotation with angle $\Theta$), one of the two-qubit entangling gates. We numerically show that the fidelity of the $R_{zz}(-\pi/2)$ gate is higher than 99.9% in a case of 16 ns gate time and without decoherence.Comment: 8 pages, 5 figure