A Framework for Heterotic Computing

@inproceedings{Stepney2012AFF,
  title={A Framework for Heterotic Computing},
  author={Susan Stepney and Viv Kendon and Peter M. Hines and Angelika Sebald},
  booktitle={QPL},
  year={2012}
}
Computational devices combining two or more different parts, one controlling the operation of the other, for example, derive their power from the interaction, in addition to the capabilities of the parts. Non-classical computation has tended to consider only single computational models: neural, analog, quantum, chemical, biological, neglecting to account for the contribution from the experimental controls. In this position paper, we propose a framework suitable for analysing combined… 

Figures from this paper

Heterotic computing: past, present and future

  • V. KendonA. SebaldS. Stepney
  • Computer Science, Psychology
    Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2015
This work introduces and defines ‘heterotic computing’ as a combination of two or more computational systems such that they provide an advantage over either substrate used separately, and outlines how to compose such computational systems.

Anti-heterotic Computing

  • V. Kendon
  • Physics
    From Astrophysics to Unconventional Computation
  • 2019
When two or more different computational components are combined to produce computational power greater than the sum of the parts, this has been called heterotic computing (Stepney et al in 8th

Heterotic Computing Examples with Optics, Bacteria, and Chemicals

Heterotic unconventional computation is described, an approach that focusses on combinations of unconventional devices and a suite of diverse physical implementations of heterotic unconventional computers, comprising computation performed by bacteria hosted in chemically built material, sensed and controlled optically and chemically.

Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond

It is argued that the evolution of quantum computing is unlikely to be different: hybrid algorithms are likely to stay well past the NISQ era and even into full fault-tolerance, with the quantum processors augmenting the already powerful classical processors which exist by performing specialized tasks.

Heterotic Continuous Time Real-valued/Boolean-valued Networks

The purpose of the proposed differential calculus in this application to HBN’s is to allow for the uniform and seamless specification of an HBN via such systems of 1st-order differential equations, since the calculus is mathematically rigorous it provides a formal semantics for such specifications and therefore a rigorous basis for verification and validation of a HBN with respect to those specifications.

Hybrid quantum computing with ancillas

This review provides an overview of the basic concepts of the gate model quantum computer architecture, including the different possible forms of information encodings – from base two up to continuous variables – and a more detailed description of how the main types of ancilla-mediated quantum operations provide efficient quantum gates.

Heterotic computing: exploiting hybrid computational devices

  • V. KendonA. SebaldS. Stepney
  • Computer Science
    Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2015
A post-meeting collection of articles provides a wide-ranging survey of the state of the art in diverse computational paradigms, together with reflections on their future combination into powerful and practical applications.

References

SHOWING 1-10 OF 61 REFERENCES

Heterotic Computing

This work outlines a proposed new approach to heterotic computing, and describes a range of physical exemplars (combinations of classical discrete, quantum discrete, classical analog, and quantum analog) that could be used to demonstrate the capability.

The neglected pillar of material computation

Parallel and Sequential Optical Computing

It is argued that the optical computing community should focus their attention on problems within P (and especially NC), rather than developing systems for tackling intractable problems.

Unconventional complexity measures for unconventional computers

  • Ed Blakey
  • Computer Science
    Natural Computing
  • 2010
Various resources beyond merely time and space are discussed, advocating such resources’ consideration when analysing the complexity of unconventional computers.

Classical Computing in Nuclear Magnetic Resonance

This work describes three different approaches of using NMR to implement a single universal logic gate, and a circuit of these gates combined in parallel and in sequence that implement other logic gates, including various optimisations, and, in one case, a half-adder circuit.

Some recent developments on Shannon's General Purpose Analog Computer

  • D. Graça
  • Mathematics, Computer Science
    Math. Log. Q.
  • 2004
It is shown that if a new notion of computability is introduced for the GPAC, based on ideas from computable analysis, then one can compute transcendentally transcendental functions such as the Gamma function or Riemann's Zeta function.

The nature of the Extended Analog Computer

A categorical framework for finite state machines

  • P. Hines
  • Mathematics
    Mathematical Structures in Computer Science
  • 2003
It is claimed that the natural representation of transitions of finite state Machines is in terms of monoid homomorphisms, and distinct generalisation processes that can be applied to finite state machines correspond to distinct categorical generalisation process at the level of the algebraic models.

Three-valued logic gates in reaction–diffusion excitable media

The Physical Implementation of Quantum Computation

After a brief introduction to the principles and promise of quantum information processing, the requirements for the physical implementation of quantum computation are discussed. These five
...