The performance of a quantum information processing protocol is ultimately judged by distinguishability measures that quantify how distinguishable the actual result of the protocol …
Pauli-based computation (PBC) is driven by a sequence of adaptively chosen, non- destructive measurements of Pauli observables. Any quantum circuit written in terms of the …
The mixedness of one share of a pure bipartite state determines whether the overall state is a separable, unentangled one. Here we consider quantum computational tests of …
Pauli-based computation (PBC) is a universal model for quantum computation with qubits where the input state is a magic (resource) state and the computation is driven by a …
We propose a continuous-variable (CV) SWAP test that requires no ancilla register, thereby generalizing the ancilla-free SWAP test for qubits. In this ancilla-free CV SWAP test, the …
In Chapter 1, we establish the mathematical background used throughout this thesis. We review concepts from group and representation theory. We further establish fundamental …