Related papers: Constant-time one-shot testing of large-scale grap…
Blind quantum computation (BQC) enables a client with less quantum computational ability to delegate her quantum computation to a server with strong quantum computational power while preserving the client's privacy. Generally, many-qubit…
Graph codes play an important role in photonic quantum technologies as they provide significant protection against qubit loss, a dominant noise mechanism. Here, we develop methods to analyse and optimise measurement-based tolerance to qubit…
The construction of a quantum computer remains a fundamental scientific and technological challenge, in particular due to unavoidable noise. Quantum states and operations can be protected from errors using protocols for fault-tolerant…
Blind quantum computing (BQC) is a computational paradigm that allows a client with limited quantum capabilities to delegate quantum computations to a more powerful server while keeping both the algorithm and data hidden. However, in…
Photonic measurement-based quantum computation (MBQC) is a promising route towards fault-tolerant universal quantum computing. A central challenge in this effort is the huge overhead in the resources required for the construction of large…
High-rate and large-distance quantum codes are expected to make fault-tolerant quantum computing more efficient, but most of them lack efficient fault-tolerant encoded-state preparation methods. We propose such a fault-tolerant encoder for…
As quantum computing technology slowly matures and the number of available qubits on a QPU gradually increases, interest in assessing the capabilities of quantum computing hardware in a scalable manner is growing. One of the key properties…
We study an architecture for fault-tolerant measurement-based quantum computation (FT-MBQC) over optically-networked trapped-ion modules. The architecture is implemented with a finite number of modules and ions per module, and leverages…
In measurement-based quantum computing an algorithm is performed by measurements on highly-entangled resource states. To date, several implementations were demonstrated, all of them assuming perfect noise-free environments. Here we consider…
Measurement-based quantum computation (MBQC) is a universal platform to realize unitary gates, only using measurements which act on a pre-prepared entangled resource state. By deforming the measurement bases, as well as the geometry of the…
In the context of measurement-based quantum computation a way of maintaining the coherence of a graph state is to measure its stabilizer operators. Aside from performing quantum error correction, it is possible to exploit the information…
Measurement-Based Quantum Computation (MBQC) is a model of quantum computation, which uses local measurements instead of unitary gates. Here we explain that the MBQC procedure has a fundamental basis in an underlying gauge theory. This…
Steane code is one of the most widely studied quantum error-correction codes, which is a natural choice for fault-tolerant quantum computation (FTQC). However, the original Steane code is not fault-tolerant because the CNOT gates in an…
Early demonstrations of fault tolerant quantum systems have paved the way for logical-level compilation. For fault-tolerant applications to succeed, execution must finish with a low total program error rate (i.e., a low program failure…
Graph states (or cluster states) are the entanglement resource that enables one-way quantum computing. They can be grown by projective measurements on the component qubits. Such measurements typically carry a significant failure…
We present a simple protocol for certifying graph states in quantum networks using stabiliser measurements. The certification statements can easily be applied to different protocols using graph states. We see for example how it can be used…
Graph states -- one of the most representative families of multipartite entangled states, are important resources for multiparty quantum communication, quantum error correction, and quantum computation. Device-independent certification of…
We present a benchmarking protocol for universal quantum computers, achieved through the simulation of random dynamical quantum maps. This protocol provides a holistic assessment of system-wide error rates, encapsulating both gate…
In one-way quantum computation (1WQC) model, an initial highly entangled state called a graph state is used to perform universal quantum computations by a sequence of adaptive single-qubit measurements and post-measurement Pauli-X and…
Topological quantum computing promises intrinsic fault tolerance by encoding quantum information in non-Abelian anyons, where quantum gates are implemented via braiding. While braiding operations are robust against local perturbations, a…