Siddhartha Das

Siddhartha Dasdas.seed

Jan 17 2018 08:42 UTC
Dec 19 2017 15:45 UTC
Dec 05 2017 02:00 UTC
A bipartite quantum interaction corresponds to the most general quantum interaction that can occur between two quantum systems. In this work, we determine bounds on the capacities of bipartite interactions for entanglement generation and secret key agreement. Our upper bound on the entanglement generation capacity of a bipartite quantum interaction is given by a quantity that we introduce here, called the bidirectional max-Rains information. Our upper bound on the secret-key-agreement capacity of a bipartite quantum interaction is given by a related quantity introduced here also, called the bidirectional max-relative entropy of entanglement. We also derive tighter upper bounds on the capacities of bipartite interactions obeying certain symmetries. Observing that quantum reading is a particular kind of bipartite quantum interaction, we leverage our bounds from the bidirectional setting to deliver bounds on the capacity of a task that we introduce, called private reading of a memory cell. Given a set of point-to-point quantum channels, the goal of private reading is for an encoder to form codewords from these channels, in order to establish secret key with a party who controls one input and one output of the channels, while a passive eavesdropper has access to the environment of the channels. We derive both lower and upper bounds on the private reading capacities of a memory cell. We then extend these results to determine achievable rates for the generation of entanglement between two distant parties who have coherent access to a controlled point-to-point channel, which is a particular kind of bipartite interaction.
Nov 10 2017 02:00 UTC
We discuss quantum position verification (QPV) protocols in which the verifiers create and send single-qubit states to the prover. QPV protocols using single-qubit states are known to be insecure against adversaries that share a small number of entangled qubits. We introduce QPV protocols that are practically secure: they only require single-qubit states from each of the verifiers, yet their security is broken if the adversaries share an impractically large number of shared entangled qubits. These protocols are a modification of known QPV protocols in which we include a classical random oracle without altering the amount of quantum resources needed by the verifiers. We present a cheating strategy that requires a number of entangled qubits shared among the adversaries that grows exponentially with the size of the classical input of the random oracle.
Oct 30 2017 04:40 UTC
Oct 18 2017 15:16 UTC
Oct 18 2017 15:15 UTC
Oct 06 2017 03:18 UTC

Here is a work in related direction: "Unification of Bell, Leggett-Garg and Kochen-Specker inequalities: Hybrid spatio-temporal inequalities", Europhysics Letters 104, 60006 (2013), which may be relevant to the discussions in your paper. []

Sep 22 2017 02:00 UTC
Entanglement distribution is a prerequisite for several important quantum information processing and computing tasks, such as quantum teleportation, quantum key distribution, and distributed quantum computing. In this work, we focus on two-dimensional quantum networks based on optical quantum technologies using dual-rail photonic qubits for the building of a fail-safe quantum internet. We lay out a quantum network architecture for entanglement distribution between distant parties using a Bravais lattice topology, with the technological constraint that quantum repeaters equipped with quantum memories are not easily accessible. We provide a robust protocol for simultaneous entanglement distribution between two distant groups of parties on this network. We also discuss a memory-based quantum network architecture that can be implemented on networks with an arbitrary topology. We examine networks with bow-tie lattice and Archimedean lattice topologies and use percolation theory to quantify the robustness of the networks. In particular, we provide figures of merit on the loss parameter of the optical medium that depend only on the topology of the network and quantify the robustness of the network against intermittent photon loss and intermittent failure of nodes. These figures of merit can be used to compare the robustness of different network topologies in order to determine the best topology in a given real-world scenario, which is critical in the realization of the quantum internet.
Sep 07 2017 02:04 UTC
Sep 06 2017 02:24 UTC
Aug 22 2017 20:57 UTC
Siddhartha Das scited Quantum state certification
Aug 17 2017 02:40 UTC