Efficient Implementation of Discrete-Time Quantum Walks on Quantum Computers.

Quantum walks have proven to be a universal model for quantum computation and to provide speed-up in certain quantum algorithms. The discrete-time quantum walk (DTQW) model, among others, is one of the most suitable candidates for circuit implementation due to its discrete nature. Current implementations, however, are usually characterized by quantum circuits of large size and depth, which leads to a higher computational cost and severely limits the number of time steps that can be reliably implemented on current quantum computers. In this work, we propose an efficient and scalable quantum circuit implementing the DTQW on the 2n-cycle based on the diagonalization of the conditional shift operator. For t time steps of the DTQW, the proposed circuit requires only O(n2+nt) two-qubit gates compared to the O(n2t) of the current most efficient implementation based on quantum Fourier transforms. We test the proposed circuit on an IBM quantum device for a Hadamard DTQW on the 4-cycle and 8-cycle characterized by periodic dynamics and by recurrent generation of maximally entangled single-particle states. Experimental results are meaningful well beyond the regime of few time steps, paving the way for reliable implementation and use on quantum computers.

Generation of Pseudo-Random Quantum States on Actual Quantum Processors.

The generation of a large amount of entanglement is a necessary condition for a quantum computer to achieve quantum advantage. In this paper, we propose a method to efficiently generate pseudo-random quantum states, for which the degree of multipartite entanglement is nearly maximal. We argue that the method is optimal, and use it to benchmark actual superconducting (IBM's ibm_lagos) and ion trap (IonQ's Harmony) quantum processors. Despite the fact that ibm_lagos has lower single-qubit and two-qubit error rates, the overall performance of Harmony is better thanks to its low error rate in state preparation and measurement and to the all-to-all connectivity of qubits. Our result highlights the relevance of the qubits network architecture to generate highly entangled states.

Correcting Coherent Errors by Random Operation on Actual Quantum Hardware.

Characterizing and mitigating errors in current noisy intermediate-scale devices is important to improve the performance of the next generation of quantum hardware. To investigate the importance of the different noise mechanisms affecting quantum computation, we performed a full quantum process tomography of single qubits in a real quantum processor in which echo experiments are implemented. In addition to the sources of error already included in the standard models, the obtained results show the dominant role of coherent errors, which we practically corrected by inserting random single-qubit unitaries in the quantum circuit, significantly increasing the circuit length over which quantum computations on actual quantum hardware produce reliable results.