Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1103/physrevd.52.5980 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
The Structure of Bit-String Similarity Networks.
Entropy (Basel)
January 2025
Centro Atómico Bariloche and Instituto Balseiro, Comisión Nacional de Energía Atómica, Universidad Nacional de Cuyo, Av. E. Bustillo 9500, San Carlos de Bariloche 8400, Argentina.
We study the structural properties of networks formed by random sets of bit strings-namely the ordered arrays of binary variables representing, for instance, genetic information or cultural profiles. Two bit strings are connected by a network link when they are sufficiently similar to each other, i.e.
View Article and Find Full Text PDFSemi-quantum key distribution (SQKD) allows a quantum user and a classical user to share a string of secret keys, providing support for application scenarios that cannot withstand the high cost of quantum resources. In this paper, we propose what we believe to be the first proof-of-principle experimental demonstration of free space SQKD based on the single-state protocol, which is equipped with polarization encoding scheme employing the method of selective modulation. During the half-hour test time for each operation, the overall experiment obtained the original key rate of 107.
View Article and Find Full Text PDFProvable bounds for noise-free expectation values computed from noisy samples.
Nat Comput Sci
November 2024
IBM Quantum, IBM Research Europe-Zurich, Rueschlikon, Switzerland.
Article Synopsis
- Quantum computing offers capabilities that surpass classical computers, but current quantum machines produce noisy outputs, complicating result accuracy.
- This study assesses how noise affects bit string sampling and its consequences for optimization and machine learning tasks.
- By quantifying the sampling overhead and relating it to layer fidelity, the research establishes provable bounds on noise-free expectation values, validated through experiments on quantum computers with up to 127 qubits, showing good alignment with theoretical outcomes.*
Resilience evaluation of memristor based PUF against machine learning attacks.
Sci Rep
October 2024
EMARATSEC, New York Univeristy Abu Dhabi, Saadiyat Island, Abu Dhabi, 129188, United Arab Emirates.
Physical unclonable functions (PUFs) have emerged as a favorable hardware security primitive, they exploit the process variations to provide unique signatures or secret keys amidst other critical cryptographic applications. CMOS-based PUFs are the most popular type, they generate unique bit strings using process variations in semiconductor fabrication. However, most existing CMOS PUFs are found to be vulnerable to modeling attacks based on machine learning (ML) algorithms.
View Article and Find Full Text PDFOn complexity of colloid cellular automata.
Sci Rep
September 2024
Unconventional Computing Laboratory, UWE, Bristol, UK.
The colloid cellular automata do not imitate the physical structure of colloids but are governed by logical functions derived from them. We analyze the space-time complexity of Boolean circuits derived from the electrical responses of colloids-specifically ZnO (zinc oxide, an inorganic compound also known as calamine or zinc white, which naturally occurs as the mineral zincite), proteinoids (microspheres and crystals of thermal abiotic proteins), and their combinations in response to electrical stimulation. To extract Boolean circuits from colloids, we send all possible configurations of two-, four-, and eight-bit binary strings, encoded as electrical potential values, to the colloids, record their responses, and infer the Boolean functions they implement.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!