Related papers: The Focked-up ZX Calculus: Picturing Continuous-Va…
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 exploit the utility of the triangle symbol which has a complicated expression in terms of spider diagrams in ZX-calculus, and its role within the ZX-representation of AND-gates in particular. First, we derive spider nest…
If a large Quantum Computer (QC) existed today, what type of physical problems could we efficiently simulate on it that we could not simulate on a classical Turing machine? In this paper we argue that a QC could solve some relevant physical…
Measurement-based quantum computation (MBQC) represents a powerful and flexible framework for quantum information processing, based on the notion of entangled quantum states as computational resources. The most prominent application is the…
We define a model of quantum computation with local fermionic modes (LFMs) -- sites which can be either empty or occupied by a fermion. With the standard correspondence between the Foch space of $m$ LFMs and the Hilbert space of $m$ qubits,…
A significant challenge in quantum computing (QC) is developing learning models that truly align with quantum principles, as many current approaches are complex adaptations of classical frameworks. In this work, we introduce Quantum…
The authors previously found a model of universal quantum computation by making use of the coset structure of subgroups of a free group $G$ with relations. A valid subgroup $H$ of index $d$ in $G$ leads to a 'magic' state…
Quantum states of systems made of many identical particles, e.g. those described by Fermi-Hubbard and Bose-Hubbard models, are conveniently depicted in the Fock space. However, in order to evaluate some specific observables or to study the…
Presented is a quantum computing model of a quantum field theory for a system of fermions interacting via a massive gauge field. The model describes a relativistic superconducting fluid and uses a metric tensor field to both encode the…
Squeezed cat quantum error correction (QEC) codes have garnered attention because of their robustness against photon-loss and excitation errors while maintaining the biased-noise property of cat codes. In this work, we reveal the utility of…
The Fermi-Hubbard model, a fundamental framework for studying strongly correlated phenomena could significantly benefit from quantum simulations when exploring non-trivial settings. However, simulating this problem requires twice as many…
Instantaneous quantum computing is a sub-universal quantum complexity class, whose circuits have proven to be hard to simulate classically in the Discrete-Variable (DV) realm. We extend this proof to the Continuous-Variable (CV) domain by…
Topological quantum computing is a way of allowing precise quantum computations to run on noisy and imperfect hardware. One implementation uses surface codes created by forming defects in a highly-entangled cluster state. Such a method of…
By the example of a Fourier transform, the possibilities of Hilbert space geometry applications for statistical model construction are analyzed. In accordance with Bohr's complementarity principle, mutually-complementary coordinate and…
In this paper, we demonstrate a direct correspondence between phase-free ZX diagrams, a graphical notation for representing and manipulating a certain class of linear maps on qubits, and Calderbank-Shor-Steane (CSS) codes, a large family of…
The Quantum Max Cut (QMC) problem has emerged as a test-problem for designing approximation algorithms for local Hamiltonian problems. In this paper we attack this problem using the algebraic structure of QMC, in particular the relationship…
In this Colloqium Lecture (by one of the authors (D.S)) a thorough presentation of the authors' research on the subjects, stated in the title, is given. By quite laborious mathematics it is explained how one can handle systems in which each…
Given a semisimple Lie algebra $\mathfrak{g}$, we can represent invariants of tensor products of fundamental representations of the quantum enveloping algebra $U_q(\mathfrak{g})$ using particular directed graphs called webs. In particular…
Compact representations of fermionic Hamiltonians are necessary to perform calculations on quantum computers that lack error-correction. A fermionic system is typically defined within a subspace of fixed particle number and spin while…
ZX-calculus is a strict mathematical formalism for graphical quantum computing which is based on the field of complex numbers. In this paper, we extend its power by generalising ZX-calculus to such an extent that it is universal both in an…