相关论文: Translating Between the Common Haar Random State M…
Tamper-detection codes (TDCs) are fundamental objects at the intersection of cryptography and coding theory. A TDC encodes messages in such a manner that tampering the codeword causes the decoder to either output the original message, or…
Quantum algorithms are typically understood in terms of the evolution of a multi-qubit quantum system under a prescribed sequence of unitary transformations. The input to the algorithm prescribes some of the unitary transformations in the…
Certified randomness has a long history in quantum information, with many potential applications. Recently Aaronson (2018, 2020) proposed a novel public certified randomness protocol based on existing random circuit sampling (RCS)…
In order to test different models proposed for some states discovered recently in the charmonium mass range that do not fit into the pattern predicted by the conventional quark model, we derive predictions for the spectrum within the…
It is a key issue to characterize the model of standard quantum theory out of general models by an operational condition. The framework of General Probabilistic Theories (GPTs) is a new information theoretical approach to single out…
Two of the fundamental no-go theorems of quantum information are the no-cloning theorem (that it is impossible to make copies of general quantum states) and the no-teleportation theorem (the prohibition on telegraphing, or sending quantum…
Models with transparent inner structure and high classification performance are required to reduce potential risk and provide trust for users in domains like health care, finance, security, etc. However, existing models are hard to…
Quantum data hiding stores classical information in bipartite quantum states that are, in principle, perfectly distinguishable, yet remain almost indistinguishable without access to a quantum communication channel. Here, we investigate…
Fully homomorphic encryption is an encryption method with the property that any computation on the plaintext can be performed by a party having access to the ciphertext only. Here, we formally define and give schemes for quantum homomorphic…
While uniform sampling has been widely studied in the matrix completion literature, CUR sampling approximates a low-rank matrix via row and column samples. Unfortunately, both sampling models lack flexibility for various circumstances in…
Breakthroughs in machine learning (ML) and advances in quantum computing (QC) drive the interdisciplinary field of quantum machine learning to new levels. However, due to the susceptibility of ML models to adversarial attacks, practical use…
In a series of recent works, we have generalised the consistency results in the stochastic block model literature to the case of uniform and non-uniform hypergraphs. The present paper continues the same line of study, where we focus on…
We consider the entanglement marginal problem, which consists of deciding whether a number of reduced density matrices are compatible with an overall separable quantum state. To tackle this problem, we propose hierarchies of semidefinite…
The distinction between pure states and mixed states is a kernel ingredient of what is considered to be the standard formulation of quantum mechanics and plays today a kernel role in foundational debates about the meaning of quantum…
We propose an alternative approach for the construction of the unitary matrix which performs generalized unitary rotations of the system consisting of independent identical subsystems (for example spin system). This matrix, when applied to…
In the present paper I formulate a framework that accommodates many unambiguous discrimination problems. I show that the prior information about any type of constituent (state, channel, or observable) allows us to reformulate the…
In quantum resource theories (QRTs) certain quantum states and operations are deemed more valuable than others. While the determination of the ``free'' elements is usually guided by the constraints of some experimental setup, this can make…
In this thesis we study the problem of unambiguously discriminating two mixed quantum states. We first present reduction theorems for optimal unambiguous discrimination of two generic density matrices. We show that this problem can be…
Quantum complexity is a measure of the minimal number of elementary operations required to approximately prepare a given state or unitary channel. Recently, this concept has found applications beyond quantum computing -- in studying the…
Since masking of quantum information was introduced by Modi et al. in [PRL 120, 230501 (2018)], many discussions on this topic have been published. In this paper, we consider relationship between quantum multipartite maskers (QMMs) and…