activity
20012020
most citedStrong Kochen-Specker theorem and incomputability of quantum randomness

91 citations · 594 across the 36 of their papers we have counts for

collaborators

37 papers

quant-ph2020

A New Quantum Random Number Generator Certified by Value Indefiniteness

José Manuel Agüero Trejo, Cristian S. Calude

In this paper we propose a new ternary QRNG based on measuring located value indefinite observables with probabilities and prove that every sequence generated is max…

physics.gen-ph2018★ 5 cited

Spurious, Emergent Laws in Number Worlds

Cristian S. Calude, Karl Svozil

We study some aspects of the emergence of logos from chaos on a basal model of the universe using methods and techniques from algorithmic information and Ramsey theories. Thereby a…

cs.DS2018★ 3 cited

A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing---Abridged Version

Alastair A. Abbott, Cristian S. Calude, Michael J. Dinneen +1

Quantum annealing has shown significant potential as an approach to near-term quantum computing. Despite promising progress towards obtaining a quantum speedup, quantum annealers a…

quant-ph2018★ 21 cited

Experimentally Probing the Algorithmic Randomness and Incomputability of Quantum Randomness

Alastair A. Abbott, Cristian S. Calude, Michael J. Dinneen +1

The advantages of quantum random number generators (QRNGs) over pseudo-random number generators (PRNGs) are normally attributed to the nature of quantum measurements. This is often…

quant-ph2018★ 2 cited

Quassical Computing

Edward H. "Ned" Allen, Cristian S. Calude

We present a class of hybrid classical systems using quantum co-processors and point out that unlike purely quantum computers, such hybrids can be both universal and Turing complet…

cs.DS2018★ 13 cited

A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing

Alastair A. Abbott, Cristian S. Calude, Michael J. Dinneen +1

Despite rapid recent progress towards the development of quantum computers capable of providing computational advantages over classical computers, it seems likely that such compute…