195 research outputs found
Single-shot security for one-time memories in the isolated qubits model
One-time memories (OTM's) are simple, tamper-resistant cryptographic devices,
which can be used to implement sophisticated functionalities such as one-time
programs. Can one construct OTM's whose security follows from some physical
principle? This is not possible in a fully-classical world, or in a
fully-quantum world, but there is evidence that OTM's can be built using
"isolated qubits" -- qubits that cannot be entangled, but can be accessed using
adaptive sequences of single-qubit measurements.
Here we present new constructions for OTM's using isolated qubits, which
improve on previous work in several respects: they achieve a stronger
"single-shot" security guarantee, which is stated in terms of the (smoothed)
min-entropy; they are proven secure against adversaries who can perform
arbitrary local operations and classical communication (LOCC); and they are
efficiently implementable.
These results use Wiesner's idea of conjugate coding, combined with
error-correcting codes that approach the capacity of the q-ary symmetric
channel, and a high-order entropic uncertainty relation, which was originally
developed for cryptography in the bounded quantum storage model.Comment: v2: to appear in CRYPTO 2014. 21 pages, 3 figure
Towards Quantum Repeaters with Solid-State Qubits: Spin-Photon Entanglement Generation using Self-Assembled Quantum Dots
In this chapter we review the use of spins in optically-active InAs quantum
dots as the key physical building block for constructing a quantum repeater,
with a particular focus on recent results demonstrating entanglement between a
quantum memory (electron spin qubit) and a flying qubit (polarization- or
frequency-encoded photonic qubit). This is a first step towards demonstrating
entanglement between distant quantum memories (realized with quantum dots),
which in turn is a milestone in the roadmap for building a functional quantum
repeater. We also place this experimental work in context by providing an
overview of quantum repeaters, their potential uses, and the challenges in
implementing them.Comment: 51 pages. Expanded version of a chapter to appear in "Engineering the
Atom-Photon Interaction" (Springer-Verlag, 2015; eds. A. Predojevic and M. W.
Mitchell
Privacy Amplification in the Isolated Qubits Model
Isolated qubits are a special class of quantum devices, which can be used to
implement tamper-resistant cryptographic hardware such as one-time memories
(OTM's). Unfortunately, these OTM constructions leak some information, and
standard methods for privacy amplification cannot be applied here, because the
adversary has advance knowledge of the hash function that the honest parties
will use.
In this paper we show a stronger form of privacy amplification that solves
this problem, using a fixed hash function that is secure against all possible
adversaries in the isolated qubits model. This allows us to construct
single-bit OTM's which only leak an exponentially small amount of information.
We then study a natural generalization of the isolated qubits model, where
the adversary is allowed to perform a polynomially-bounded number of entangling
gates, in addition to unbounded local operations and classical communication
(LOCC). We show that our technique for privacy amplification is also secure in
this setting.Comment: v2: 24 pages, stronger security definition, better proof technique,
improved presentatio
Quantum Cryptography Beyond Quantum Key Distribution
Quantum cryptography is the art and science of exploiting quantum mechanical
effects in order to perform cryptographic tasks. While the most well-known
example of this discipline is quantum key distribution (QKD), there exist many
other applications such as quantum money, randomness generation, secure two-
and multi-party computation and delegated quantum computation. Quantum
cryptography also studies the limitations and challenges resulting from quantum
adversaries---including the impossibility of quantum bit commitment, the
difficulty of quantum rewinding and the definition of quantum security models
for classical primitives. In this review article, aimed primarily at
cryptographers unfamiliar with the quantum world, we survey the area of
theoretical quantum cryptography, with an emphasis on the constructions and
limitations beyond the realm of QKD.Comment: 45 pages, over 245 reference
New Constructions for Quantum Money
We propose an information theoretically secure secret-key quantum money scheme in which the verification of a coin is classical and consists of only one round; namely, a classical query from the user to the bank and an accept/reject answer from the bank to the user. A coin can be verified polynomially (on the number of its qubits) many times before it expires. Our scheme is an improvement on Gavinsky\u27s scheme [Gavinsky, Computational Complexity, 2012], where three rounds of interaction are needed and is based on the notion of quantum retrieval games. Moreover, we propose a public-key quantum money scheme which uses one-time memories as a building block and is computationally secure in the random oracle model. This construction is derived naturally from our secret-key scheme using the fact that one-time memories are a special case of quantum retrieval games
Quantum information processing with atoms and photons
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/62643/1/416238a.pd
Implications of Electronics Constraints for Solid-State Quantum Error Correction and Quantum Circuit Failure Probability
In this paper we present the impact of classical electronics constraints on a
solid-state quantum dot logical qubit architecture. Constraints due to routing
density, bandwidth allocation, signal timing, and thermally aware placement of
classical supporting electronics significantly affect the quantum error
correction circuit's error rate. We analyze one level of a quantum error
correction circuit using nine data qubits in a Bacon-Shor code configured as a
quantum memory. A hypothetical silicon double quantum dot quantum bit (qubit)
is used as the fundamental element. A pessimistic estimate of the error
probability of the quantum circuit is calculated using the total number of
gates and idle time using a provably optimal schedule for the circuit
operations obtained with an integer program methodology. The micro-architecture
analysis provides insight about the different ways the electronics impact the
circuit performance (e.g., extra idle time in the schedule), which can
significantly limit the ultimate performance of any quantum circuit and
therefore is a critical foundation for any future larger scale architecture
analysis.Comment: 10 pages, 7 figures, 3 table
- …