Alastair A. Abbott

dblp:60/8261 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
1since 2021 · last 2023
0000-0002-2759-633XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 3 first-author · 1 since 2021Artificial intelligence and machine learning · 2 · 2 first-author
YearPublicationVenuePosition
2023 Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude)
Alastair A. Abbott, Cezar Câmpeanu, Ludwig Staiger, Marius Zimand, Arto Salomaa
Theor. Comput. Sci.1
2014 A quantum random number generator certified by value indefiniteness
abstract
In this paper we propose a quantum random number generator (QRNG) that uses an entangled photon pair in a Bell singlet state and is certified explicitly by value indefiniteness. While ‘true randomness’ is a mathematical impossibility, the certification by value indefiniteness ensures that the quantum random bits are incomputable in the strongest sense. This is the first QRNG setup in which a physical principle (Kochen–Specker value indefiniteness) guarantees that no single quantum bit that is produced can be classically computed (reproduced and validated), which is the mathematical form of bitwise physical unpredictability. We discuss the effects of various experimental imperfections in detail: in particular, those related to detector efficiencies, context alignment and temporal correlations between bits. The analysis is very relevant for the construction of any QRNG based on beam-splitters. By measuring the two entangled photons in maximally misaligned contexts and using the fact that two bitstrings, rather than just one, are obtained, more efficient and robust unbiasing techniques can be applied. We propose a robust and efficient procedure based onXORing the bitstrings together – essentially using one as a one-time-pad for the other – to extract random bits in the presence of experimental imperfections, as well as a more efficient modification of the von Neumann procedure for the same task. We also discuss some open problems.
Alastair A. Abbott, Cristian S. Calude, Karl Svozil
Math. Struct. Comput. Sci.1
2012 The Deutsch-Jozsa problem: de-quantisation and entanglement
Alastair A. Abbott
Nat. Comput.1
2011 Ontology-Aided Product Classification: A Nearest Neighbour Approach
Alastair A. Abbott, Ian D. Watson
ICCBR1
2011 Von Neumann Normalisation and Symptoms of Randomness: An Application to Sequences of Quantum Random Bits
Alastair A. Abbott, Cristian S. Calude
UC1