Related papers: From Qubits to Continuous-Variable Quantum Computa…
Measurement-based quantum computation (MBQC) offers a promising paradigm for photonic quantum computing, but its implementation requires the generation of specific non-Gaussian resource states. While continuous-variable encodings such as…
We investigate the computational power of creating steady-states of quantum dissipative systems whose evolution is governed by time-independent and local couplings to a memoryless environment. We show that such a model allows for efficient…
This dissertation explores quantum computation using qudits encoded into large spins, emphasizing the concept of quantum co-design to harness the unique capabilities of physical platforms for enhanced quantum information processing. First,…
We revisit the quantized version of the harmonic oscillator obtained through a q-dependent family of coherent states. For each q, 0< q < 1, these normalized states form an overcomplete set that resolves the unity with respect to an explicit…
High-dimensional quantum computation needs a native circuit-level equational theory for qudits. We give the first finite schematic equational theory that is sound and complete for exact unitary qudit circuits in every finite dimension at…
In this paper, we strengthen the connection between qubit-based quantum circuits and photonic quantum computation. Within the framework of circuit-based quantum computation, the sum-over-paths interpretation of quantum probability…
We extend the notions of quantum harmonic analysis, as introduced in R. Werner's paper from 1984 (J. Math. Phys. 25(5)), to abelian phase spaces, by which we mean a locally compact abelian group endowed with a Heisenberg multiplier. In this…
The LogQ algorithm encodes Quadratic Unconstrained Binary Optimization (QUBO) problems, which are often encountered in the industry (portfolio optimization, fleet optimization, charging stations, etc.). It was developed within the framework…
We extend the model of Ancilla Driven Quantum Computation (ADQC) by considering gates with arbitrary entangling power. By giving up stepwise determinism, universal QC can still be achieved through a variable length sequence of single qubit…
Quantum computation requires coherently controlling the evolutions of qubits. Usually, these manipulations are implemented by precisely designing the durations (such as the $\pi$-pulses) of the Rabi oscillations and tunable interbit…
We present some basic integer arithmetic quantum circuits, such as adders and multipliers-accumulators of various forms, as well as diagonal operators, which operate on multilevel qudits. The integers to be processed are represented in an…
It is important for performance studies in quantum technologies to analyze quantum circuits in the presence of noise. We introduce an error probability tensor, a tool to track generalized Pauli error statistics of qudits within quantum…
Engineering quantum operations is one of the main abilities we need for developing quantum technologies and designing new fundamental tests. Here we propose a scheme for realising a controlled operation acting on a travelling quantum field,…
We present a quantum variational algorithm based on a novel circuit that generates all permutations that can be spanned by one- and two-qubits permutation gates. The construction of the circuits follows from group-theoretical results, most…
Group twirling is crucial in quantum information processing, particularly in randomized benchmarking and random compiling. While protocols based on Pauli twirling have been effectively crafted to transform arbitrary noise channels into…
We present a probabilistic quantum processor for qudits. The processor itself is represented by a fixed array of gates. The input of the processor consists of two registers. In the program register the set of instructions (program) is…
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…
A long-standing open question about Gaussian continuous-variable cluster states is whether they enable fault-tolerant measurement-based quantum computation. The answer is yes. Initial squeezing in the cluster above a threshold value of 20.5…
We establish a connection between continuous-variable quantum computing and high-dimensional integration by showing that the outcome probabilities of continuous-variable instantaneous quantum polynomial (CV-IQP) circuits are given by…
The structure of covariant instruments is studied and a general structure theorem is derived. A detailed characterization is given to covariant instruments in the case of an irreducible representation of a locally compact group.