相关论文: Translating Between the Common Haar Random State M…

We demonstrate a new construction for perfect quantum secret sharing (QSS) schemes based on imperfect "ramp" secret sharing combined with classical encryption, in which the individual parties' shares are split into quantum and classical…

We study unitary property testing, where a quantum algorithm is given query access to a black-box unitary and has to decide whether it satisfies some property. In addition to containing the standard quantum query complexity model (where the…

We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case of two-party protocols with security against malicious…

This paper initiates the study of hidden variables from the discrete, abstract perspective of quantum computing. For us, a hidden-variable theory is simply a way to convert a unitary matrix that maps one quantum state to another, into a…

The Clauser-Horne-Shimony-Holt (CHSH) inequality is a constraint that local theories must obey. Quantum Mechanics predicts a violation of this inequality in certain experimental settings. Treatments of this subject frequently make…

It is well known that different preparations of a mixed state cannot be distinguished by a measurement of that state. Yet we show that some other experiments let us make this distinction despite a very general belief that this would not be…

Quantum theory is consistent with a computational model permitting black-box operations to be applied in an indefinite causal order, going beyond the standard circuit model of computation. The quantum switch -- the simplest such example --…

Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…

Classical shadows (CS) have emerged as a powerful way to estimate many properties of quantum states based on random measurements and classical post-processing. In their original formulation, they come with optimal (or close to) sampling…

The discrimination of coherent states is a crucial component in quantum communication with continuous variables, especially in quantum key distribution protocols (CV-QKD), which rely on the ability to distinguish among different coherent…

A separable covariance model for a random matrix provides a parsimonious description of the covariances among the rows and among the columns of the matrix, and permits likelihood-based inference with a very small sample size. However, in…

Entangled systems in experiments may be lost or offline in distributed quantum information processing. This inspires a general problem to characterize quantum operations which result in breaking of entanglement or not. Our goal in this work…

This work presents an effective microscopic, time-dependent Hamiltonian framework for investigating information dynamics during black hole evaporation. While current approaches often rely on gravitational path integrals or statistical…

Within the framework of the individuality interpretation of quantum theory (QT), the basic equations of QT cannot be derived from the basic equations of classical mechanics (CM). The unbridgeable gap between CM and QT is given by the fact…

After introducing the partially separable concept, we proved the equivalence between the partial separability of a given $m$-partite subsystem with $m$ qubits and the purity of states of this $m$-partite subsystem for a pure state in…

Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard. There is a highly inefficient `basic algorithm'…

This paper introduces a unified model of consistency and isolation that minimizes the gap between how these guarantees are defined and how they are perceived. Our approach is premised on a simple observation: applications view storage…

Motivated by the understanding of holography as realized in tensor networks, we develop a bulk procedure that can be interpreted as generating a sequence of coarse-grained holographic states. The coarse-graining procedure involves…

Classical-quantum computational complexity separations are an important motivation for the long-term development of digital quantum computers, but classical-quantum complexity equivalences are just as important in our present era of noisy…

Understanding and quantifying uncertainty in black box Neural Networks (NNs) is critical when deployed in real-world settings such as healthcare. Recent works using Bayesian and non-Bayesian methods have shown how a unified predictive…