相关论文: Local encoding of classical information onto quant…
As we continue to find applications where the currently available noisy devices exhibit an advantage over their classical counterparts, the efficient use of quantum resources is highly desirable. The notion of quantum autoencoders was…
The celebrated quantum no-cloning theorem states that an arbitrary quantum state cannot be cloned perfectly. This raises questions about cloning of classical states, which have also attracted attention. Here, we present a physical approach…
In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is,…
Local operations assisted by classical communication (LOCC) constitute the free operations in entanglement theory. Hence, the determination of LOCC transformations is crucial for the understanding of entanglement. We characterize here…
We obtain a necessary and sufficient condition for a finite set of states of a finite dimensional multiparticle quantum system to be amenable to unambiguous discrimination using local operations and classical communication. This condition…
We present a construction of Hermitian operators and quantum states labelled by strings from a finite field. The distance between these operators or states is then simply related (typically, proportional) to the Hamming distance between…
Stochastic local operations and classical communication (SLOCC), also called local filtering operations, are a convenient, useful set of quantum operations in grasping essential properties of entanglement. We give a quick overview about the…
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…
There is a large body of work studying what forms of computational hardness are needed to realize classical cryptography. In particular, one-way functions and pseudorandom generators can be built from each other, and thus require equivalent…
We present a classical protocol, using the matrix product state representation, to simulate cluster-state quantum computation at a cost polynomial in the number of qubits in the cluster and exponential in d -- the width of the cluster. We…
Recent work has exposed the idea that interesting quantum-like probability laws, including interference effects, can be manifest in classical systems. Here we propose a model for quantum-like (QL) states and QL bits. We suggest a way that…
We study the entanglement structure of tripartite stabilizer states on $N$ qudits of dimension $D$, distributed across parties $A$, $B$, and $C$, under arbitrary local unitaries. Prior work by Bravyi et al. and Looi et al. showed that qubit…
The information in quantum computers is often stored in identical two-level systems (spins or pseudo-spins) that are separated by a distance shorter than the characteristic wavelength of a reservoir which is responsible for decoherence. In…
Classical data encoding is usually treated as a black-box in the oracle-based quantum algorithms. On the other hand, their constructions are crucial for practical algorithm implementations. Here, we open the black-boxes of data encoding and…
We study here the conditions to perform the distribution of a pure state on a quantum network using quantum operations which can succeed with a non-zero probability, the Stochastic Local Operation and Classical Communication (SLOCC)…
Recent work has extended Bell's theorem by quantifying the amount of communication required to simulate entangled quantum systems with classical information. The general scenario is that a bipartite measurement is given from a set of…
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…
We investigate optimal encoding and retrieval of digital data, when the storage/communication medium is described by quantum mechanics. We assume an m-ary alphabet with arbitrary prior distribution, and an n-dimensional quantum system.…
We show that there exist bipartite quantum states which contain large hidden classical correlation that can be unlocked by a disproportionately small amount of classical communication. In particular, there are $(2n+1)$-qubit states for…
We exhibit a simple procedure to find how classical signals should be processed in cluster-state quantum computation. Using stabilizers characterizing a cluster state, we can easily find a precise classical signal-flow that is required in…