{c}
{tag=Company}
{wiki}

= Xanadu
{disambiguate=quantum}
{c}
{synonym}

= Xanadu
{disambiguate=quantum computing company}
{c}
{synonym}

Rounds:
* 2022-11: 100m USD https://www.prnewswire.com/news-releases/xanadu-closes-100m-usd-series-c-to-accelerate-development-of-fault-tolerant-quantum-computers-301672611.html

https://www.youtube.com/watch?v=v7iAqcFCTQQ shows their base technology:
* <laser> beam comes in
* input set via of <optical ring resonators> that form a <squeezed state of light>. Does not seem to rely on <single photon production and detection experiments>?


Xanadu Quantum Technologies

Beam splitter

Diaphragm

Diaphragm (optics)

Disk storage

python/typing_cheat/infer.py

Node.js ORM library

{c}
{tag=UKRI}
{wiki}

\Video[https://www.youtube.com/watch?v=aV1wL5jsfRU]
{title=Quantum Computing with Networked <Ion traps> by <NQIT> (2018)}
{description=The video is a bit useless. But it does show the networked approach proposal a little bit. <Universal Quantum>'s homepage particularly rejects that.}


NQIT

{c}
{tag=American company}
{tag=Analog quantum computer}
{title2=2018}

* https://www.quera.com/about
* https://mobile.twitter.com/queracomputing


QuEra

Frontier

Frontier (supercomputer)

{wiki}

<Protein dimer> made up of two identical proteins, e.g. https://en.wikipedia.org/wiki/Fatty_acid_synthase


Homodimer

Independently wealthy

Kitware

{c}

https://netron.app/

<ONNX> visualizer.

\Image[https://raw.githubusercontent.com/cirosantilli/media/e9225ddf4bb8ce4bad8cc2a9d6503d683dec5db6/activatedgeek_LeNet-5_onnx.svg]
{title=<Netron> visualization of the <activatedgeek LeNet-5> <ONNX> output}
{disambiguate=netron}
{height=1000}


Netron

{c}
{tag=Quantum algorithm}

A <quantum algorithm> that is thought to be more likely to be useful in the <NISQ> era of <quantum computing>.


NISQ algorithm

{c}
{wiki=NP-hardness}

A problem such that all NP problems can be reduced in polynomial time to it.


NP-hard

{c}
{wiki}

This is the most interesting class of problems for <BQP> as we haven't proven that they are neither:
* <P (complexity)>: would be boring on quantum computer
* <NP-complete>: would likely be impossible on a quantum computer

Big list: https://cstheory.stackexchange.com/questions/79/problems-between-p-and-npc/460#460


NP-intermediate

{c}
{tag=British company}

https://www.orcacomputing.com/

* 2022: \$15 million https://www.orcacomputing.com/blog/orca-computing-completes-15-million-series-a-funding-round
* 2021: \$14.5 million for an <Innovate UK> project


Ciro Santilli @cirosantilli 40