相关论文: Continuous Variable Solution for Byzantine Agreeme…

In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, given that the sum capacity of all links in between nodes in the system is finite. We have proposed a highly efficient Byzantine agreement algorithm…

We study Gaussian valence bond states of continuous variable systems, obtained as the outputs of projection operations from an ancillary space of M infinitely entangled bonds connecting neighboring sites, applied at each of $N$ sites of an…

Entanglement is a key property of quantum states that acts as a resource for a wide range of tasks in quantum computing. Entanglement detection is a key conceptual and practical challenge. Without adaptive or joint measurements,…

This paper introduces a deterministic Byzantine consensus algorithm that relies on a new weak coordinator. As opposed to previous algorithms that cannot terminate in the presence of a faulty or slow coordinator, our algorithm can terminate…

This work performs an experimental evaluation of four asynchronous binary Byzantine consensus algorithms [11,16,18] in various configurations. In addition to being asynchronous these algorithms run in rounds, tolerate up to one third of…

We present a theory of entanglement transformations of Gaussian pure states with local Gaussian operations and classical communication. This is the experimentally accessible set of operations that can be realized with optical elements such…

We consider the problem of reliably broadcasting information in a multihop asynchronous network, despite the presence of Byzantine failures: some nodes are malicious and behave arbitrarly. We focus on non-cryptographic solutions. Most…

This thesis deals with the study of quantum communication protocols with Continuous Variable (CV) systems. Continuous Variable systems are those described by canonical conjugated coordinates x and p endowed with infinite dimensional Hilbert…

The phase conjugation of an unknown Gaussian state cannot be realized perfectly by any physical process. A semi-classical argument is used to derive a tight lower bound on the noise that must be introduced by an approximate phase…

Randomisation is a critical tool in designing distributed systems. The common coin primitive, enabling the system members to agree on an unpredictable random number, has proven to be particularly useful. We observe, however, that it is…

To circumvent the FLP impossibility result in a deterministic way several protocols have been proposed on top of an asynchronous distributed system enriched with additional assumptions. In the context of Byzantine failures for systems where…

This paper is concerned with the computation of the capacity region of a continuous, Gaussian vector broadcast channel (BC) with covariance matrix constraints. Since the decision variables of the corresponding optimization problem are…

Quadratically Constrained Quadratic Programs (QCQPs) are an important class of optimization problems with diverse real-world applications. In this work, we propose a variational quantum algorithm for general QCQPs. By encoding the variables…

In this chapter we review the characterization of entanglement in Gaussian states of continuous variable systems. For two-mode Gaussian states, we discuss how their bipartite entanglement can be accurately quantified in terms of the global…

Two parties, Alice and Bob, wish to distill a binary secret key out of a list of correlated variables that they share after running a quantum key distribution protocol based on continuous-spectrum quantum carriers. We present a novel…

In this paper we address Approximate Agreement problem in the Mobile Byzantine faults model. Our contribution is threefold. First, we propose the the first mapping from the existing variants of Mobile Byzantine models to the Mixed-Mode…

For continuous-variable systems, we introduce a measure of entanglement, the continuous variable tangle ({\em contangle}), with the purpose of quantifying the distributed (shared) entanglement in multimode, multipartite Gaussian states.…

We formulate a two-party communication complexity problem and present its quantum solution that exploits the entanglement between two qutrits. We prove that for a broad class of protocols the entangled state can enhance the efficiency of…

Most methods for Byzantine fault tolerance (BFT) in the partial synchrony setting divide the local state of the nodes into views, and the transition from one view to the next dictates a leader change. In order to provide liveness, all…

We propose a method to witness entanglement between two continuous-variable systems in a Gaussian state. Its key ingredient is a local lossy state transfer from the original spatially separated systems onto two spatially separated qubits.…