The rotation of subspaces by a chosen angle is a fundamental quantum computing operation, with applications in error correction and quantum algorithms such as the Quantum Approximate Optimization Algorithm, the Variational Quantum Eigensolver and the quantum singular value transformation. Such rotations are usually implemented at the hardware level via multiple-controlled-phase gates, which lead to large circuit depth when decomposed into one- and two-qubit gates. Here, we propose a fast, high-fidelity way to implement such operations via topological quantum walks, where a sequence of single-qubit $z$ rotations of an ancilla qubit are interleaved with the evolution of a system Hamiltonian in which a matrix $A$ is embedded. The subspace spanned by the left or right singular vectors of $A$ with non-zero singular values is rotated, depending on the state of the ancilla. This procedure can be implemented in superconducting qubits, ion-traps and Rydberg atoms with star-type connectivity, significantly reducing the total gate time required compared to previous proposals.
The rotation of subspaces by a chosen angle is a fundamental quantum computing operation, with applications in error correction and quantum algorithms such as the Quantum Approximate Optimization Algorithm, the Variational Quantum Eigensolver and the quantum singular value transformation. Such rotations are usually implemented at the hardware level via multiple-controlled-phase gates, which lead to large circuit depth when decomposed into one- and two-qubit gates. Here, we propose a fast, high-fidelity way to implement such operations via topological quantum walks, where a sequence of single-qubit z rotations of an ancilla qubit are interleaved with the evolution of a system Hamiltonian in which a matrix A is embedded. The subspace spanned by the left or right singular vectors of A with non-zero singular values is rotated, depending on the state of the ancilla. This procedure can be implemented in superconducting qubits, ion-traps and Rydberg atoms with star-type connectivity, significantly reducing the total gate time required compared to previous proposals.
We develop new algorithms for Quantum Singular Value Transformation (QSVT), a unifying framework that encapsulates most known quantum algorithms and serves as the foundation for new ones. Existing implementations of QSVT rely on block encoding, incurring an intrinsic O(logL) ancilla overhead and circuit depth O(Ldλ) for polynomial transformations of a Hamiltonian H=∑k=1LHk, where d is the polynomial degree and λ=∑k∥Hk∥. We introduce a simple yet powerful approach that utilizes only basic Hamiltonian simulation techniques, namely, Trotter methods, to: (i) eliminate the need for block encoding, (ii) reduce the ancilla overhead to only a single qubit, and (iii) still maintain near-optimal complexity. Our method achieves a circuit depth of O(L(dλcomm)1+o(1)), without requiring any complicated multi-qubit controlled gates. Moreover, λcomm depends on the nested commutators of the terms of H and can be substantially smaller than λ for many physically relevant Hamiltonians, a feature absent in standard QSVT. To achieve these results, we make use of Richardson extrapolation in a novel way, systematically eliminating errors in any interleaved sequence of arbitrary unitaries and Hamiltonian evolution operators, thereby establishing a general framework that encompasses QSVT but is more broadly applicable. As applications, we develop end-to-end quantum algorithms for solving linear systems and estimating ground state properties of Hamiltonians, both achieving near-optimal complexity without relying on oracular access. Overall, our results establish a new framework for quantum algorithms, significantly reducing hardware overhead while maintaining near-optimal performance, with implications for both near-term and fault-tolerant quantum computing.
Abstract As quantum processors grow in scale and reliability, the need for efficient quantum gate decomposition of circuits to a set of specific available gates, becomes ever more critical. The decomposition of a particular algorithm into a sequence of these available gates is not unique. Thus, the fidelity of an algorithm’s implementation can be increased by choosing an optimized decomposition. This is true both for noisy intermediate-scale quantum platforms as well as for implementation of quantum error correction schemes. Here we present a compilation scheme which implements a general-circuit decomposition to a sequence of Ising-type, long-range, multi-qubit (MQ) entangling gates, that are separated by layers of single qubit rotations. We use trapped ions as an example in which MQ gates naturally arise, yet any system that has connectivity beyond nearest-neighbors may gain from our approach. We evaluate our methods using the quantum volume (QV) test over N qubits. In this context, our method replaces 3 N 2 / 2 two-qubit gates with 2 N + 1 MQ gates. Furthermore, our method minimizes the magnitude of the entanglement phases, which typically enables an improved implementation fidelity, by using weaker driving fields or faster realizations. We numerically test our compilation and show that, compared to conventional realizations with sequential two-qubit gates, our compilations improves the logarithm of QV by 20% to 25%.
The nonadiabatic holonomic quantum computation based on three-level systems has wide applicability experimentally due to its simpler energy level structure requirement and inherent robustness from the geometric phase. However, in previous conventional schemes, the states of the calculation subspace have always leaked to the noncomputation subspace, resulting in less robustness than anticipated. Recent efforts to address this problem are at the cost of excessively long gate time, which will lead to more decoherence-induced errors. Here, we propose a solution to the problem without the severe limitation of the much longer gate time. Specifically, we implement arbitrary holonomic gates via a three-segment Hamiltonian, where the gate time depends on the rotation angle, and the smaller the rotation angle, the shorter the gate time will be. Compared with the previous solutions, our numerical simulations indicate that the decoherence-induced gate errors of our scheme are greatly decreased and the robustness of our scheme is also better, particularly for small-angle rotation gates. Moreover, we provide a detailed physical realization of our proposal on a two-dimensional superconducting quantum circuit. Therefore, our protocol provides a promising alternative for future fault-tolerant quantum computation.
In many quantum platforms, single-qubit gates are applied using a linear drive resonant with the qubit transition frequency, which is often theoretically described within the rotating-wave approximation (RWA). However, for fast gates on low-frequency qubits, the RWA may not hold and we need to consider the contribution from counterrotating terms to the qubit dynamics. The inclusion of counterrotating terms into the theoretical description gives rise to two challenges. First, it becomes challenging to analytically calculate the time evolution as the Hamiltonian is no longer self-commuting. Moreover, the time evolution now depends on the carrier phase such that, in general, every operation in a sequence of gates is different. In this work, we derive and verify a correction to the drive pulses that minimizes the effect of these counterrotating terms in a two-level system. We then derive a second correction term that arises from noncomputational levels for a strongly anharmonic system. We experimentally implement these correction terms on a fluxonium superconducting qubit, which is an example of a strongly anharmonic, low-frequency qubit for which the RWA may not hold, and demonstrate how fast, high-fidelity single-qubit gates can be achieved without the need for additional hardware and calibration complexities.
Abstract Basis state shift is central to many quantum algorithms, most notably the quantum walk. Efficient implementations are of major importance for achieving a quantum speedup for computational applications. We optimize the state shift algorithm by incorporating the shift in different directions in parallel. This provides a significant reduction in the depth of the quantum circuit in comparison to the currently known methods, giving a linear scaling in the number of gates versus working qubits in contrast to the quadratic scaling of the state-of-the-art method based on the quantum Fourier transform. For a one-dimensional array of size 2 n for n > 4, we derive the total number of 15 n + 74 two-qubit CX gates in the parallel circuit, using a total of 2 n − 2 qubits including an ancilla register for the decomposition of multi-controlled gates. We focus on the one-dimensional and periodic shift, but note that the method can be extended to more complex cases.
Fusing the single-excitation subspace with C2n
There is a tremendous interest in developing practical applications for noisy intermediate-scale quantum processors without the overhead required by full error correction. Near-term quantum information processing is especially challenging within the standard gate model, as algorithms quickly lose fidelity as the problem size and circuit depth grow. This has lead to a number of non-gate-model approaches such as analog quantum simulation and quantum annealing. These come with specific hardware requirements that are different than that of a universal gate-based quantum computer. We have previously proposed an approach called the single-excitation subspace (SES) method, which uses a complete graph of superconducting qubits with tunable coupling. Without error correction the SES method is not scalable, but it offers several algorithmic components with constant depth, which is highly desirable for near-term use. The challenge of the SES method is that it requires a physical qubit for every basis state in the computer's Hilbert space. This imposes exponentially large resource costs for algorithms using registers of ancillary qubits, as each ancilla would double the required graph size. Here we show how to circumvent this doubling by leaving the SES and fusing it with a multi-ancilla Hilbert space. Specifically, we implement the tensor product of an SES register holding "data" with one or more ancilla qubits, which are able to independently control arbitrary [Formula: see text] unitary operations on the data in a constant number of steps. This enables a hybrid form of quantum computation where fast SES operations are performed on the data, traditional logic gates and measurements are performed on the ancillas, and controlled-unitaries act between. As example applications, we give ancilla-assisted SES implementations of quantum phase estimation and the quantum linear system solver of Harrow, Hassidim, and Lloyd.