Related papers: Phase-space methods for representing, manipulating…
Quantum computing allows for the manipulation of highly correlated states whose properties quickly go beyond the capacity of any classical method to calculate. Thus one natural problem which could lend itself to quantum advantage is the…
Hybrid bosonic codes combining bosonic codes with photon states offer a promising pathway for fault-tolerant quantum computation. However, the efficient generation of such states in optical setups remains technically challenging due to the…
Gaussian quantum states of bosonic systems are an important class of states. In particular, they play a key role in quantum optics as all processes generated by Hamiltonians up to second order in the field operators (i.e. linear optics and…
We provide explicit circuits implementing the Kitaev-Webb algorithm for the preparation of multi-dimensional Gaussian states on quantum computers. While asymptotically efficient due to its polynomial scaling, we find that the circuits…
We apply the generalized Wigner function formalism to detect and characterize a range of quantum phase transitions in several cyclic, finite-length, spin-$\frac{1}{2}$ one-dimensional spin-chain models, viz., the Ising and anisotropic $XY$…
Quantum state preparation (QSP) for a general $n$-qubit state requires $O(2^n)$ CNOT gates and circuit depth, making exact amplitude encoding (EAE) impractical for near-term quantum hardware. We introduce an ancilla-free hybrid…
We propose quaternion-based strategies for quantum error correction by extending quantum mechanics into quaternionic Hilbert spaces. Building on the properties of quaternionic quantum states, we define quaternionic analogues of Pauli…
A study on a method for the establishment of a phase space representation of quantum theory is presented. The approach utilizes the properties of Gaussian distribution, the properties of Hermite polynomials, Fourier analysis and the current…
Robust quantum control is crucial for achieving operations below the quantum error correction threshold. Quantum Signal Processing (QSP) transforms a unitary parameterized by $\theta$ into one governed by a polynomial function $f(\theta)$,…
We demonstrate how recent protocols developed for the stabilization of Gottesman-Kitaev-Preskill (GKP) states can be used for the estimation of two-quadrature displacement sensing, with sensitivities approaching the multivariate quantum…
We consider hybrid qubit-oscillator systems together with Gaussian, multi-qubit as well as qubit-controlled Gaussian unitaries. We propose implementations of logical gates for approximate Gottesman-Kitaev-Preskill codes in this model using…
Quantum phase estimation (QPE) is one of the most important subroutines in quantum computing. In general applications, current QPE algorithms either suffer an exponential time overload or require a set of - notoriously quite fragile - GHZ…
The ability to efficiently state-prepare Gaussian distributions is critical to the success of numerous quantum algorithms. The most popular algorithm for this subroutine (Kitaev-Webb) has favorable polynomial resource scaling, however it…
Quantum computation with light, compared with other platforms, offers the unique benefit of natural high-speed operations at room temperature and large clock rate, but a big obstacle of photonics is the lack of strong nonlinearities which…
We propose an architecture of quantum-error-correction-based quantum repeaters that combines techniques used in discrete- and continuous-variable quantum information. Specifically, we propose to encode the transmitted qubits in a…
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…
Quantum information is very fragile to environmentally and operationally induced imperfections. Therefore, the construction of practical quantum computers requires quantum error-correction techniques to protect quantum information. In…
We represent both the states and the evolution of a quantum computer in phase space using the discrete Wigner function. We study properties of the phase space representation of quantum algorithms: apart from analyzing important examples,…
To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from…
One-way quantum computation is a promising approach to achieving universal, scalable, and fault-tolerant quantum computation. However, a main challenge lies in the creation of universal, scalable three-dimensional cluster states. Here, an…