Related papers: Irreducible magic sets for $n$-qubit systems
In this paper, we study quantum query complexity of the following rather natural tripartite generalisations (in the spirit of the 3-sum problem) of the hidden shift and the set equality problems, which we call the 3-shift-sum and the…
We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to…
In this sequence of papers, noncommutative analysis is used to give a consistent axiomatic approach to a unified conceptual foundation of classical and quantum physics. The present Part I defines the concepts of observables, states and…
Magic states are essential for achieving universal quantum computation. This study introduces a reversible framework for the manipulation of magic states in odd dimensions, delineating a necessary and sufficient condition for the exact…
A magic square of order $n$ with all subsquares of possible orders (ASMS$(n)$) is a magic square which contains a general magic square of each order $k\in\{3, 4, \cdots, n-2\}$. Since the conjecture on the existence of an ASMS was proposed…
An orthogonal set of states in multipartite systems is called to be strong quantum nonlocality if it is locally irreducible under every bipartition of the subsystems…
Ensembles of composite quantum states can exhibit nonlocal behaviour in the sense that their optimal discrimination may require global operations. Such an ensemble containing N pairwise orthogonal pure states, however, can always be…
A game is rigid if a near-optimal score guarantees, under the sole assumption of the validity of quantum mechanics, that the players are using an approximately unique quantum strategy. Rigidity has a vital role in quantum cryptography as it…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
A longstanding goal in quantum information science is to demonstrate quantum computations that cannot be feasibly reproduced on a classical computer. Such demonstrations mark major milestones: they showcase fine control over quantum systems…
We study linear constraint system (LCS) games over the ring of arithmetic modulo $d$. We give a new proof that certain LCS games (the Mermin--Peres Magic Square and Magic Pentagram over binary alphabets, together with parallel repetitions…
In this article, we revisit the century-old question of the minimal set of observables needed to identify a quantum state: here, we replace the natural coincidences in their spectra by effective ones, induced by an imperfect measurement. We…
Motivated by their necessity for most fault-tolerant quantum computation schemes, we formulate a resource theory for magic states. We first show that robustness of magic is a well-behaved magic monotone that operationally quantifies the…
This paper characterizes two forms of separability of pure states of systems of n qubits: (i) into a tensor product of n qubit states, and (ii), into a tensor product of 2 subsystems states of p and q qubits respectively with p+q=n. For…
Unspeakable coherence is a key feature separating quantum and classical physics. Modelled as asymmetry with respect to a continuous transformation generated by a physically relevant observable, such as the Hamiltonian or angular moment,…
Eigenstates of permutation gates are either stabilizer states (for gates in the Pauli group) or magic states, thus allowing universal quantum computation [M. Planat and Rukhsan-Ul-Haq, Preprint 1701.06443]. We show in this paper that a…
A fundamental resource in any communication and computation task is the amount of information that can be transmitted and processed. Information encoded in a classical system is limited by the dimension d_c of the system, i.e., the number…
Optimizing over separable quantum objects is challenging for two key reasons: determining separability is NP-hard, and the dimensionality of the problem grows exponentially with the number of qubits. We address both challenges by…
The separability from spectrum problem asks for a characterization of the eigenvalues of the bipartite mixed states {\rho} with the property that U^*{\rho}U is separable for all unitary matrices U. This problem has been solved when the…
We address the problem of unambiguous discrimination and identification among quantum observables. We set a general framework and investigate in details the case of qubit observables. In particular, we show that perfect discrimination with…