Related papers: Computational self-testing for entangled magic sta…
The verification of quantum devices is an important aspect of quantum information, especially with the emergence of more advanced experimental implementations of computation and secure communication. Within this, the theory of…
Magic (non-stabilizerness) is a necessary but "expensive" kind of "fuel" to drive universal fault-tolerant quantum computation. To properly study and characterize the origin of quantum "complexity" in computation as well as physics, it is…
Soon after the dawn of quantum error correction, DiVincenzo and Peres observed that stabilizer codewords could give rise to simple proofs of quantumness via contextuality. This discovery can be recast in the language of nonlocal games:…
One of the great challenges of quantum foundations and quantum information theory is the characterisation of the relationship between entanglement and the violation of Bell inequalities. It is well known that in specific scenarios these two…
Magic refers to the degree of "quantumness" in a system that cannot be fully described by stabilizer states and Clifford operations alone. In quantum computing, stabilizer states and Clifford operations can be efficiently simulated on a…
We study a configuration of devices that includes (1) a source of some unknown bipartite quantum state that is claimed to be the Bell state $\Phi^+$ and (2) two commuting but otherwise unknown measurement apparatus, one on each side, that…
Magic states enable universal, fault-tolerant quantum computation within the stabilizer framework. Their non-stabilizerness supplies the resource needed to bypass the Eastin-Knill theorem while allowing fault-tolerant distillation. Although…
Magic state distillation is a key component of fault-tolerant quantum computation, as it enables the implementation of non-Clifford gates such as the $T$ gate and the $CCZ$ gate via gate teleportation. However, conventional distillation…
Device-independent self-testing is the possibility of certifying the quantum state and the measurements, up to local isometries, using only the statistics observed by querying uncharacterized local devices. In this paper, we study parallel…
Statistical verification of a quantum state aims to certify whether a given unknown state is close to the target state with confidence. So far, sample-optimal verification protocols based on local measurements have been found only for…
The emergence of quantum devices has raised a significant issue: how to certify the quantum properties of a device without placing trust in it. To characterise quantum states and measurements in a device-independent way, up to some degree…
In quantum theory, a quantum state on a composite system of two parties realizes a non-negative probability with any measurement element with a tensor product form. However, there also exist non-quantum states which satisfy the above…
Self-testing refers to the certification of quantum states and measurements based entirely on the correlations exhibited by measurements on separate subsystems. In the bipartite case, self-testing of states has been completely…
Non-stabilizerness - also colloquially referred to as magic - is the a resource for advantage in quantum computing and lies in the access to non-Clifford operations. Developing a comprehensive understanding of how non-stabilizerness can be…
Recent results on the non-universality of fault-tolerant gate sets underline the critical role of resource states, such as magic states, to power scalable, universal quantum computation. Here we develop a resource theory, analogous to the…
Random number has many applications, it plays an important role in quantum information processing. It's not difficult to generate true random numbers, the main difficulty is how to certify the random numbers generated by untrusted devices.…
We show that the Quantum State Distinguishability (QSD), which is a QSZK-complete problem, and the Quantum Circuit Distinguishability (QCD), which is a QIP-complete problem, can be solved by the verifier who can perform only single-qubit…
Self-testing allows us to determine, through classical interaction only, whether some players in a non-local game share particular quantum states. Most work on self-testing has concentrated on developing tests for small states like one pair…
Non-Clifford gates are frequently exclusively implemented on fault-tolerant architectures by first distilling magic states in specialised magic-state factories. In the rest of the architecture, the computational space, magic states can then…
Finding ways to quantify magic is an important problem in quantum information theory. Recently Leone, Oliviero and Hamma introduced a class of magic measures for qubits, the stabilizer entropies of order $\alpha$, to aid in studying…