相关论文: Local encoding of classical information onto quant…
We propose an efficient scheme for verifying quantum computations in the `high complexity' regime i.e. beyond the remit of classical computers. Previously proposed schemes remarkably provide confidence against arbitrarily malicious…
The ultimate goal of the classicality programme is to quantify the amount of quantumness of certain processes. Here, classicality is studied for a restricted type of process: quantum information processing (QIP). Under special conditions,…
We revisit the Pauli-Clifford connection to introduce a real, grade-preserving algebraic framework for $n$-qubit quantum computation based on the tensor product $C\ell_{2,0}(\mathbb{R})^{\otimes n}$. In this setting, the bivector $J =…
We introduce a graphical representation of stabilizer states and translate the action of Clifford operators on stabilizer states into graph operations on the corresponding stabilizer-state graphs. Our stabilizer graphs are constructed of…
Given an output wavefunction of a monitored quantum circuit consisting of both unitary gates and projective measurements, we ask whether two complementary subsystems are entangled or not. For Clifford circuits, we find that this question…
Implementing robust quantum error correction (QEC) is imperative for harnessing the promise of quantum technologies. We introduce a framework that takes {\it any} classical code and explicitly constructs the corresponding QEC code. Our…
Stabilizer states, which are also known as the Clifford states, have been commonly utilized in quantum information, quantum error correction, and quantum circuit simulation due to their simple mathematical structure. In this work, we apply…
We present a method of determining important properties of a shared bipartite quantum state, within the ``distant labs'' paradigm, using \emph{only} local operations and classical communication (LOCC). We apply this procedure to spectrum…
Tensor network methods leverage the limited entanglement of quantum states to efficiently simulate many-body systems. Alternatively, Clifford circuits provide a framework for handling highly entangled stabilizer states, which have low magic…
For two symmetric quantum states one may be interested in maximizing the overlap under local operations applied to one of them. The question arises whether the maximal overlap can be obtained by applying the same local operation to each…
Given some group $G$ of logical gates, for instance the Clifford group, what are the quantum encodings for which these logical gates can be implemented by simple physical operations, described by some physical representation of $G$? We…
We present a hashing protocol for distilling multipartite CSS states by means of local Clifford operations, Pauli measurements and classical communication. It is shown that this hashing protocol outperforms previous versions by exploiting…
In this paper we present a novel approach to emulating a universal quantum computer with a classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any modality…
Polar coding is a method for communication over noisy classical channels which is provably capacity-achieving and has an efficient encoding and decoding. Recently, this method has been generalized to the realm of quantum information…
Any bipartite nonlocal unitary operation can be carried out by teleporting a quantum state from one party to the other, performing the unitary gate locally, and teleporting a state back again. This paper investigates unitaries which can be…
Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from…
In the task of quantum state learning, one receives some data about measurements performed on a state, and using that, must make predictions on the outcomes of unseen measurements. Computing a prediction is generally hard but it has been…
We introduce the distribution of a secret multipartite entangled state in a real-world scenario as a quantum primitive. We show that in the presence of noisy quantum channels (and noisy control operations) any state chosen from the set of…
Multigrid has become a popular method for solving some of the most challenging real-world computational problems, such as computational fluid dynamics (CFD). The reason for this is the very good scaling properties of multigrid, which is…
Developing space- and time-efficient logical magic state preparation protocols will likely be an essential step towards building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for…