English
Related papers

Related papers: Two-Bit Messages are Sufficient to Implement Atomi…

200 papers

Hybrid quantum systems seek to combine the strength of its constituents to master the fundamental conflicting requirements of quantum technology: fast and accurate systems control together with perfect shielding from the environment,…

Neutral-atom arrays are a leading platform for quantum technologies, offering a promising route toward large-scale, fault-tolerant quantum computing. We propose a novel quantum processing architecture based on dual-type, dual-element atom…

Atomic Physics · Physics 2025-03-24 Zhanchuan Zhang , Jeth Arunseangroj , Wenchao Xu

Single electron spins coupled to multiple nuclear spins provide promising multi-qubit registers for quantum sensing and quantum networks. The obtainable level of control is determined by how well the electron spin can be selectively coupled…

We consider a two-user random access system in which each user independently selects a coding scheme from a finite set for every message, without sharing these choices with the other user or with the receiver. The receiver aims to decode…

Information Theory · Computer Science 2025-12-01 Nazanin Mirhosseini , Jie Luo

Long range Rydberg blockade interactions have the potential for efficient implementation of quantum gates between multiple atoms. Here we present and analyze a protocol for implementation of a $k$-atom controlled NOT (C$_k$NOT) neutral atom…

Quantum Physics · Physics 2012-06-05 L. Isenhower , M. Saffman , K. Molmer

It is well known that n bits of entropy are necessary and sufficient to perfectly encrypt n bits (one-time pad). Even if we allow the encryption to be approximate, the amount of entropy needed doesn't asymptotically change. However, this is…

Quantum Physics · Physics 2015-06-26 Iordanis Kerenidis , Daniel Nagaj

Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally…

Quantum Physics · Physics 2009-10-31 S. C. Benjamin

Neutral atoms are a promising platform for scalable quantum computing, however prior demonstration of high fidelity gates or low-loss readout methods have employed restricted numbers of qubits. Using randomized benchmarking of…

Quantum Physics · Physics 2023-07-20 B. Nikolov , E. Diamond-Hitchcock , J. Bass , N. L. R. Spong , J. D. Pritchard

Quantum Random Access Memory (QRAM) is a critical component for loading classical data into quantum computers. While constructing a practical QRAM presents several challenges, including the impracticality of an infinitely large QRAM size…

Oblivious transfer is a fundamental cryptographic primitive which is useful for secure multiparty computation. There are several variants of oblivious transfer. We consider 1 out of 2 oblivious transfer, where a sender sends two bits of…

Quantum Physics · Physics 2025-11-12 David Reichmuth , Ittoop Vergheese Puthoor , Petros Wallden , Erika Andersson

Samples with few hundred atoms within a few micrometer sized region of space are large enough to provide efficient cooperative absorption and emission of light, and small enough to ensure strong dipole-dipole interactions when atoms are…

Quantum Physics · Physics 2013-05-29 Line Hjortshoj Pedersen , Klaus Molmer

Atom interferometers require precise control of digital, analog, and radio frequency signals for effective operation. In this paper, we propose and implement a control system for mobile atom interferometers. The system consists of a…

Atomic Physics · Physics 2019-09-04 Bola Malek , Zachary Pagel , Xuejian Wu , Holger Müller

In our earlier work [Appl. Phys. Lett. 92, 022509 (2008)], we proposed nonvolatile vortex random access memory (VRAM) based on the energetically stable twofold ground state of vortex-core magnetizations as information carrier. Here we…

Materials Science · Physics 2011-08-12 Young-Sang Yu , Hyunsung Jung , Ki-Suk Lee , Peter Fischer , Sang-Koog Kim

For a machine to be useful in practice, it preferably has to meet two requirements: namely, (i) to be able to perform work under a load and (ii) its operational regime should ideally not depend on the time at which the machine is…

Quantum Physics · Physics 2010-09-14 Alexey V. Ponomarev , Sergey Denisov , Peter Hanggi

In many embedded real-time systems, applications often interact with I/O devices via read/write operations, which may incur considerable suspension delays. Unfortunately, prior analysis methods for validating timing correctness in embedded…

Other Computer Science · Computer Science 2014-07-22 Guangmo Tong , Cong Liu

This paper considers the communication and storage costs of emulating atomic (linearizable) multi-writer multi-reader shared memory in distributed message-passing systems. The paper contains three main contributions: (1) We present a atomic…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-07-17 Viveck R. Cadambe , Nancy Lynch , Muriel Médard , Peter Musial

An absolutely secure, fast, inexpensive, robust, maintenance-free and low-power- consumption communication is proposed. The states of the information bit are represented by two resistance values. The sender and the receiver have such…

Classical Physics · Physics 2008-04-23 Laszlo B. Kish

The advent of devices based on single dopants, such as the single atom transistor, the single spin magnetometer and the single atom memory, motivates the quest for strategies that permit to control matter with atomic precision. Manipulation…

Mesoscale and Nanoscale Physics · Physics 2016-07-29 F. E. Kalff , M. P. Rebergen , E. Fahrenfort , J. Girovsky , R. Toskovic , J. L. Lado , J. Fernández-Rossier , A. F. Otte

Memoryless computation is a new technique to compute any function of a set of registers by updating one register at a time while using no memory. Its aim is to emulate how computations are performed in modern cores, since they typically…

Computational Complexity · Computer Science 2013-10-23 Peter J. Cameron , Ben Fairbairn , Maximilien Gadouleau

Entry in: Encyclopedia of Algorithms, Ming-Yang Kao, Ed., Springer, To appear. Synonyms: Wait-free registers, wait-free shared variables, asynchronous communication hardware. Problem Definition: Consider a system of asynchronous processes…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-05-23 Paul M. B. Vitanyi
‹ Prev 1 3 4 5 6 7 10 Next ›