Related papers: Nonstabilizerness without Magic: Classically Simul…
In quantum information and computation, the generation of entanglement through unitary gates remains a significant and active area of research. However, there are states termed as absolutely separable, from which entanglement cannot be…
We study the local indistinguishability problem of quantum states. By introducing an easily calculated quantity, non-commutativity, we present an criterion which is both necessary and sufficient for the local indistinguishability of a…
Classical and quantum states can be distinguished by entanglement entropy, which can be viewed as a measure of quantum resources. Entanglement entropy also plays a pivotal role in understanding computational complexity in simulating quantum…
Quantum mechanics of composite systems, gives rise to certain special states called entangled states. A physical system, that is in an entangled state displays an intricate correlation between its subsystems. There are also some composite…
Discordant states appear in a large number of quantum phenomena and seem to be a good indicator of divergence from classicality. While there is evidence that they are essential for a quantum algorithm to have an advantage over a classical…
We investigate how non-stabilizer resources enable the emergence of quantum state designs within the projected ensemble. Starting from initial states with finite magic and applying resource-free Clifford circuits to scramble them, we…
In this paper, we study the problem of learning an unknown quantum circuit of a certain structure. If the unknown target is an $n$-qubit Clifford circuit, we devise an efficient algorithm to reconstruct its circuit representation by using…
Quantum state discrimination is a fundamental information processing task that serves as a building block for numerous applications and provides implications at the foundational level. In this work, we consider minimum error discrimination…
Stabilizer states are a prime resource for a number of applications in quantum information science, such as secret-sharing and measurement-based quantum computation. This motivates us to study the entanglement of noisy stabilizer states…
We give a pair of algorithms that efficiently learn a quantum state prepared by Clifford gates and $O(\log n)$ non-Clifford gates. Specifically, for an $n$-qubit state $|\psi\rangle$ prepared with at most $t$ non-Clifford gates, our…
We introduce a hitherto unexplored form of quantum nonlocality, termed local subset unidentifiability, that arises from the limitation of spatially separated parties to perfectly identify a subset of mutually orthogonal multipartite quantum…
Ensembles containing orthogonal product states are found to be indistinguishable under local operations and classical communication (LOCC), thereby showing irreversibility in the preparation and distinguishing processes, which is commonly…
We develop connections between generalised notions of entanglement and quantum computational devices where the measurements available are restricted, either because they are noisy and/or because by design they are only along Pauli…
A set of quantum states is said to be antidistinguishable if, upon being given a randomly chosen state, it is possible to identify a state that the system was definitively not prepared in. In this work, we begin with a study of quantum…
We experimentally demonstrate, with an all-optical setup, a nonlocal deterministic quantum non-demolition interaction gate applicable to quantum states at nodes separated by a physical distance and connected by classical communication…
Recently, Halder \emph{et al.} [Phys. Rev. Lett. \textbf{122}, 040403 (2019)] proposed the concept strong nonlocality without entanglement: an orthogonal set of fully product states in multipartite quantum systems that is locally…
Graph states are quantum states that can be described by a stabilizer formalism and play an important role in quantum information processing. We consider the action of local unitary operations on graph states and hypergraph states. We focus…
We show that quantum states with "low stabilizer complexity" can be efficiently distinguished from Haar-random. Specifically, given an $n$-qubit pure state $|\psi\rangle$, we give an efficient algorithm that distinguishes whether…
The Wigner function formalism has played a pivotal role in examining the non-classical aspects of quantum states and their classical simulatability. Nevertheless, its application in qubit systems faces limitations due to negativity induced…
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.…