Related papers: Qubit-oscillator-based gate implementations for ap…
Quantifying the accuracy of logical gates is paramount in approximate error correction, where perfect implementations are often unachievable with the available set of physical operations. To this end, we introduce a single scalar quantity…
The realisation of a universal quantum computer at scale promises to deliver a paradigm shift in information processing, providing the capability to solve problems that are intractable with conventional computers. A key limiting factor of…
The Gottesman-Kitaev-Preskill (GKP) error correcting code uses a bosonic mode to encode a logical qubit, and has the attractive property that its logical Clifford gates can be implemented using Gaussian unitary gates. In contrast, a direct…
The Gottesman-Kitaev-Preskill (GKP) code is an exciting route to fault-tolerant quantum computing since Gaussian resources and GKP Pauli-eigenstate preparation are sufficient to achieve universal quantum computing. In this work, we provide…
With the advent of physical qubits exhibiting strong noise bias, it becomes increasingly relevant to identify which quantum gates can be efficiently implemented on error-correcting codes designed to address a single dominant error type.…
A logical qubit is a two-dimensional subspace of a higher dimensional system, chosen such that it is possible to detect and correct the occurrence of certain errors. Manipulation of the encoded information generally requires arbitrary and…
The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit within an oscillator provides a number of advantages when used in a fault-tolerant architecture for quantum computing, most notably that Gaussian operations suffice to implement all…
We present techniques for performing two-qubit gates on Gottesman-Kitaev-Preskill (GKP) codes with finite energy, and find that operations designed for ideal infinite-energy codes create undesired entanglement when applied to physically…
I present a new approach for designing quantum error-correcting codes that guarantees a physically natural implementation of Clifford operations. Inspired by the scheme put forward by Gottesman, Kitaev, and Preskill for encoding a qubit in…
Using error correcting codes and fault tolerant techniques, it is possible, at least in theory, to produce logical qubits with significantly lower error rates than the underlying physical qubits. Suppose, however, that the gates that act on…
We introduce a framework for simulating hybrid oscillator-qubit quantum processors on qubit-only systems through position encoding. By encoding continuous-variable position and momentum wave functions into qubit amplitudes, our method…
In this paper we study the error in the approximate simultaneous controllability of the bilinear Schrodinger equation. We provide estimates based on a tracking algorithm for general bilinear quantum systems and on the study of the finite…
The implementation of fault-tolerant quantum gates on encoded logic qubits is considered. It is shown that transversal implementation of logic gates based on simple geometric control ideas is problematic for realistic physical systems…
With the Gottesman-Kitaev-Preskill (GKP) encoding, Clifford gates and error correction can be carried out using simple Gaussian operations. Still, non-Clifford gates, required for universality, require non-Gaussian elements. In their…
We present an algorithm for building a circuit that approximates single qubit unitaries with precision {\epsilon} using O(log(1/{\epsilon})) Clifford and T gates and employing up to two ancillary qubits. The algorithm for computing our…
The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…
We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves $\varepsilon$-approximations using circuits of length $O(\log(1/\varepsilon))$, which is…
One of the largest obstacles to building a quantum computer is gate error, where the physical evolution of the state of a qubit or group of qubits during a gate operation does not match the intended unitary transformation. Gate error stems…
While all quantum algorithms can be expressed in terms of single-qubit and two-qubit gates, more expressive gate sets can help reduce the algorithmic depth. This is important in the presence of gate errors, especially those due to…
Recent work on Ising-coupled double-quantum-dot spin qubits in GaAs with voltage-controlled exchange interaction has shown improved two-qubit gate fidelities from the application of oscillating exchange along with a strong magnetic field…