Related papers: Computational self-testing for entangled magic sta…

We give an operator-algebraic formulation of robust self-testing in terms of states on C*-algebras. We show that a quantum correlation p is a robust self-test only if among all (abstract) states, there is a unique one achieving p. We show…

The initialization of a quantum system into a certain state is a crucial aspect of quantum information science. While a variety of measurement strategies have been developed to characterize how well the system is initialized, for a given…

We discuss and implement experimentally a method for characterizing quantum gates operating on superpositions of coherent states. The peculiarity of this encoding of qubits is to work with a non-orthogonal basis, and therefore some…

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…

Quantum correlations in Bell and prepare-and-measure experiments are central resources for probing nonclassicality and enabling device-based quantum information protocols. In the absence of shared public randomness (i.e., without run-to-run…

Non-stabilizerness, or magic, is a resource for universal quantum computation in most fault-tolerant architectures; access to states with non-stabilizerness allows for non-classically simulable quantum computation to be performed.…

How can one certify that an unknown quantum state possesses magic without resorting to full state tomography? We address this question by introducing two thermodynamic witnesses that rely solely on energy and heat measurements. First, we…

Localizability of entanglement in fully inseparable states is a key ingredient of assisted quantum information protocols as well as measurement-based models of quantum computing. We investigate the existence of fully inseparable states with…

Quantum circuit simulation is paramount to the verification and optimization of quantum algorithms, and considerable research efforts have been made towards efficient simulators. While circuits often contain high-level gates such as oracles…

Here we consider the task of device-independent certification of the quantum state distributed in a network when some of the nodes in this network may collude and act dishonestly. We introduce the paradigm of self-testing with dishonest…

We demonstrate one-sided device-independent self-testing of any pure entangled two-qubit state based on a fine-grained steering inequality. The maximum violation of a fine-grained steering inequality can be used to witness certain steerable…

Preparing and certifying bound entangled states in the laboratory is an intrinsically hard task, due to both the fact that they typically form narrow regions in the state space, and that a certificate requires a tomographic reconstruction…

Quantum mechanics provides means of generating genuine randomness that is impossible with deterministic classical processes. Remarkably, the unpredictability of randomness can be certified in a self-testing manner that is independent of…

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…

Quantum state verification (QSV) is the task of relying on local measurements only to verify that a given quantum device does produce the desired target state. Up to now, certain types of entangled states can be verified efficiently or even…

Efficient teleportation is a crucial step for quantum computation and quantum networking. In the case of qubits, four different entangled Bell states have to be distinguished. We have realized a probabilistic, but in principle…

Magic states can be used as a resource to circumvent the restrictions due to stabilizer-preserving operations, and magic-state conversion has not been studied in the single-copy regime thus far. Here we solve the question of whether a…

Self-testing results allow us to infer the underlying quantum mechanical description of states and measurements from classical outputs produced by non-communicating parties. The standard definition of self-testing does not apply in…

With the advent of delegated quantum computing as a service, verifying quantum computations is becoming a question of great importance. Existing information theoretically Secure Delegated Quantum Computing (SDQC) protocols require the…

We consider the task of secure multi-party distributed quantum computation on a quantum network. We propose a protocol based on quantum error correction which reduces the number of necessary qubits. That is, each of the $n$ nodes in our…