相关论文: Characterization of non-adaptive Clifford channels
We consider the problem of reconstructing the unitary describing the evolution of a quantum system, or quantum channel, from a set of input and output states. For ideal, fully coherent evolution, we show that the unitary can be…
The Wigner function formalism has played a pivotal role in examining the non-classical aspects of quantum states and their classical simulatability. Nevertheless, its application in qubit systems faces limitations due to negativity induced…
The ubiquity of stabilizer circuits in the design and operation of quantum computers makes techniques to verify their correctness essential. The simulation of stabilizer circuits, which aims to replicate their behavior using a classical…
The study of quantum channels is the fundamental field and promises wide range of applications, because any physical process can be represented as a quantum channel transforming an initial state into a final state. Inspired by the method…
We study reversible quantum cellular automata with the restriction that these are also Clifford operations. This means that tensor products of Pauli operators (or discrete Weyl operators) are mapped to tensor products of Pauli operators.…
We provide a generalization of quantum polar codes to quantum channels with qudit-input, achieving the symmetric coherent information of the channel. Our scheme relies on a channel combining and splitting construction, where a two-qudit…
Quantum queue-channels arise naturally in the context of buffering in quantum networks, wherein the noise suffered by the quantum states depends on the time spent waiting in the buffer. It has been shown that the upper-bound on the…
Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure…
A powerful method for analyzing quantum error-correcting codes is to map them onto classical statistical mechanics models. Such mappings have thus far mostly focused on static codes, possibly subject to repeated syndrome measurements.…
Protection of quantum information from noise is a massive challenge. One avenue people have begun to explore is reducing the number of particles needing to be protected from noise and instead use systems with more states, so called qudit…
We investigate the dynamics of nonstabilizerness - also known as `magic' - in monitored quantum circuits composed of random Clifford unitaries and local projective measurements. For measurements in the computational basis, we derive an…
A quantum channel physically is a unitary interaction between the information carrying system and an environment, which is initialized in a pure state before the interaction. Conventionally, this state, as also the parameters of the…
We start by studying the subgroup structures underlying stabilizer circuits and we use our results to propose a new normal form for stabilizer circuits. This normal form is computed by induction using simple conjugation rules in the…
We study the problem of quantum thermalization from a very recent perspective: via discrete interactions with thermalized systems. We thus extend the previously introduced scattering thermalization program by studying not only a specific…
(Abridged abstract.) In this thesis we introduce new models of quantum computation to study the emergence of quantum speed-up in quantum computer algorithms. Our first contribution is a formalism of restricted quantum operations, named…
Quantum fidelity estimation is essential for benchmarking quantum states and processes on noisy quantum devices. While stabilizer operations form the foundation of fault-tolerant quantum computing, non-stabilizer resources further enable…
We study, by means of the stabilizer formalism, a quantum error correcting code which is alternative to the standard block codes since it embeds a qubit into a qudit. The code exploits the non-commutative geometry of discrete phase space to…
Unital quantum channels, defined by their property of leaving the maximally mixed state invariant, form an important class of quantum operations. A distinguished subset of these channels can be represented as a probabilistic mixture of…
Quantum circuit compilation comprises many computationally hard reasoning tasks that nonetheless lie inside #$\mathbf{P}$ and its decision counterpart in $\mathbf{PP}$. The classical simulation of general quantum circuits is a core example.…
In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider memoryless communication scenario with channel uncertainty which is an analog of compound channel in classical…