Related papers: Hashing protocol for distilling multipartite CSS s…
The cryptographic task of secure multi-party (classical) computation has received a lot of attention in the last decades. Even in the extreme case where a computation is performed between $k$ mutually distrustful players, and security is…
Hashing that projects data into binary codes has shown extraordinary talents in cross-modal retrieval due to its low storage usage and high query speed. Despite their empirical success on some scenarios, existing cross-modal hashing methods…
Current quantum computing hardware is restricted by the availability of only few, noisy qubits which limits the investigation of larger, more complex molecules in quantum chemistry calculations on quantum computers in the near-term. In this…
The performance of computational methods for many-body physics and chemistry is strongly dependent on the choice of basis used to cast the problem; hence, the search for better bases and similarity transformations is important for progress…
Detecting multipartite entanglement in many qubit systems is measurement-intensive, motivating protocols that estimate only selected observables with provable efficiency. In this work we use the classical shadow protocol to study the sample…
A single quantum state can be shared by many distant parties. In this thesis, we try to characterize the information contents of such distributed states by defining the multiparty information and the multiparty squashed entanglement, two…
We suggest the use of hash functions to cut down the communication costs when counting subgraphs under edge local differential privacy. While various algorithms exist for computing graph statistics, including the count of subgraphs, under…
We consider the task of distilling local purity from a noisy quantum state $\rho^{ABC}$, wherein we provide a protocol for three parties, Alice, Bob and Charlie, to distill local purity (at a rate $P$) from many independent copies of a…
This paper presents a novel framework, namely Deep Cross-modality Spectral Hashing (DCSH), to tackle the unsupervised learning problem of binary hash codes for efficient cross-modal retrieval. The framework is a two-step hashing approach…
The security of quantum key distribution has traditionally been analyzed in either the asymptotic or non-asymptotic regimes. In this paper, we provide a bridge between these two regimes, by determining second-order coding rates for key…
We provide a simple security proof for prepare & measure quantum key distribution protocols employing noisy processing and one-way postprocessing of the key. This is achieved by showing that the security of such a protocol is equivalent to…
We present a planar surface-code-based scheme for fault-tolerant quantum computation which eliminates the time overhead of single-qubit Clifford gates, and implements long-range multi-target CNOT gates with a time overhead that scales only…
We present a protocol for growing graph states, the resource for one-way quantum computing, when the available entanglement mechanism is highly imperfect. The distillation protocol is frugal in its use of ancilla qubits, requiring only a…
Classical shadow tomography is a powerful randomized measurement protocol for predicting many properties of a quantum state with few measurements. Two classical shadow protocols have been extensively studied in the literature: the…
We develop an efficient local operation and classical communication (LOCC) scheme for the distillation of Greenberger-Horne-Zeilinger (GHZ) states from tripartite systems subjected to both coherent and incoherent errors. The proposed method…
Various realizations of Kitaev's surface code perform surprisingly well for biased Pauli noise. Attracted by these potential gains, we study the performance of Clifford-deformed surface codes (CDSCs) obtained from the surface code by…
We discuss a method to adapt the codeword stabilized (CWS) quantum code framework to the problem of finding asymmetric quantum codes. We focus on the corresponding Pauli error models for amplitude damping noise and phase damping noise. In…
Entanglement distillation is a well-studied problem in quantum information, where one typically starts with $n$ noisy Bell pairs and distills $k$ Bell pairs of higher fidelity. While distilling Bell pairs is the canonical setting, it is…
Local pure states are an important resource for quantum computing. The problem of distilling local pure states from mixed ones can be cast in an information theoretic paradigm. The bipartite version of this problem where local purity must…
Common random string model is a popular model in classical cryptography. We study a quantum analogue of this model called the common Haar state (CHS) model. In this model, every party participating in the cryptographic system receives many…