Aller au contenu principal
Découvrez le cloud d'infrastructure quantique En savoir plus

DéveloppeursHiQ / L'utiliser

Exemples

Chaque programme d'exemple du dépôt du langage, avec le code source complet. Chacun passe le vérificateur et indique son résultat attendu dans son premier commentaire. Copiez-en un dans un fichier et vérifiez-le avec softqcos lang check.

  • 24 programmes
  • Apache-2.0 une fois le dépôt ouvert

HiQ Assembly

Pour un contrôle exact de chaque porte, mesure et branche.

Paire de Bell

Deux qubits dont les mesures concordent toujours.

examples/l1/bell.qcosqcos/0
// Bell pair: the two measurements always agree.program bellqubits a, bbits m0, m1​h acx a, bmeasure a -> m0measure b -> m1

État GHZ

Quatre qubits qui donnent 0000 ou 1111.

examples/l1/ghz.qcosqcos/0
// GHZ state on four qubits: all bits read 0000 or 1111.program ghzqubits q[4]bits m[4]​h q[0]cx q[0], q[1]cx q[1], q[2]cx q[2], q[3]repeat i in 0..4 {  measure q[i] -> m[i]}

Téléportation

Déplacer un état avec deux mesures et des corrections en temps réel.

examples/l1/teleport.qcosqcos/0
// Teleportation: the state ry(pi / 3)|0> moves from msg to bob,// using two measurements and real-time corrections.program teleportqubits msg, alice, bobbits m0, m1, out​ry(pi / 3) msg​// Shared Bell pair between alice and bob.h alicecx alice, bob​// Bell measurement on msg and alice.cx msg, aliceh msgmeasure msg -> m0measure alice -> m1​// Corrections decided at run time.if m1 {  x bob}if m0 {  z bob}measure bob -> out

Codage superdense

Deux bits classiques transportés par un seul qubit d'une paire intriquée.

examples/l1/superdense.qcosqcos/0
// Superdense coding: two classical bits travel on one qubit.// Alice applies z to set b0 and x to set b1; here she sends b0 = 0, b1 = 1.program superdensequbits alice, bobbits b0, b1​h alicecx alice, bob​// Encode b1 = 1 with x. A z here would also set b0.x alice​cx alice, bobh alicemeasure alice -> b0measure bob -> b1

Deutsch-Jozsa

Constante ou équilibrée, en une seule requête.

examples/l1/deutsch_jozsa.qcosqcos/0
// Deutsch-Jozsa with a balanced oracle f(x) = x0 xor x1 xor x2.// A constant oracle reads 000; this one never does.program deutsch_jozsaqubits x[3], ybits m[3]​x yh yrepeat i in 0..3 {  h x[i]}​// Oracle: y ^= f(x).repeat i in 0..3 {  cx x[i], y}​repeat i in 0..3 {  h x[i]  measure x[i] -> m[i]}

Bernstein-Vazirani

Lire une chaîne cachée en une seule requête.

examples/l1/bernstein_vazirani.qcosqcos/0
// Bernstein-Vazirani: recover the hidden string s = 101 in one query.program bernstein_vaziraniqubits x[3], ybits m[3]​x yh yrepeat i in 0..3 {  h x[i]}​// Oracle for s = 101: y ^= x0 xor x2.cx x[0], ycx x[2], y​repeat i in 0..3 {  h x[i]  measure x[i] -> m[i]}

Recherche de Grover

Trouver l'état marqué 11 en une itération.

examples/l1/grover.qcosqcos/0
// Grover search on two qubits for the marked state 11.// One iteration finds it with certainty.program groverqubits a, bbits ma, mb​routine diffusion(p, q) {  within {    h p    h q    x p    x q  } do {    cz p, q  }}​h ah b​// Oracle: phase flip on 11.cz a, b​call diffusion(a, b)measure a -> mameasure b -> mb

Estimation de phase

Lire la phase d'un état propre dans un registre.

examples/l1/phase_estimation.qcosqcos/0
// Phase estimation of the T gate (phase 1/8) with three counting qubits.// The counting register reads 001 (read backwards: 0.001 in binary = 1/8).program phase_estimationqubits c[3], targetbits m[3]​x targetrepeat i in 0..3 {  h c[i]}​// Controlled T^(2^k): c[0] applies T once, c[1] twice, c[2] four times.cp(pi / 4) c[0], targetcp(pi / 2) c[1], targetcp(pi) c[2], target​// Inverse QFT on the counting register.swap c[0], c[2]h c[0]cp(-pi / 2) c[1], c[0]h c[1]cp(-pi / 4) c[2], c[0]cp(-pi / 2) c[2], c[1]h c[2]​repeat i in 0..3 {  measure c[i] -> m[i]}

Répéter jusqu'au succès

Réessayer jusqu'à ce qu'une mesure donne 1, avec un budget de 16.

examples/l1/repeat_until_success.qcosqcos/0
// Repeat until success: try again until the ancilla reads 1, at most 16 times,// counting the attempts, then act on the count.program repeat_until_successqubits a, ancbits muint8 attempts​while !m budget 16 {  h anc  measure anc -> m  reset anc  attempts = attempts + 1}​match attempts {  1 => { x a }  2, 3 => { z a }  _ => { h a }}

Transformée de Fourier

La transformée de Fourier quantique sur trois qubits, appliquée à 101.

examples/l1/qft.qcosqcos/0
// Quantum Fourier transform on three qubits, applied to the basis state 101.program qftqubits q[3]bits m[3]​routine qft3(a, b, c) {  h a  cp(pi / 2) b, a  cp(pi / 4) c, a  h b  cp(pi / 2) c, b  h c  swap a, c}​x q[0]x q[2]call qft3(q[0], q[1], q[2])repeat i in 0..3 {  measure q[i] -> m[i]}

Parité avec un seul ancillaire

Chaque vérification alloue, mesure et libère un qubit réutilisé.

examples/l1/parity_ancilla.qcosqcos/0
// Parity checks with one reused ancilla: each check allocates a fresh// qubit, measures it and releases it with a reset, so the peak is the data// qubits plus one, not plus two.program parity_ancillaqubits d[3]bits syndrome[2]​x d[1]​alloc anccx d[0], anccx d[1], ancmeasure anc -> syndrome[0]release anc reset​alloc anccx d[1], anccx d[2], ancmeasure anc -> syndrome[1]release anc reset

HiQ Script

Pour les expériences qui mesurent, décident et réessaient.

Transformée de Fourier

La transformée de Fourier quantique avec constantes et boucles.

examples/l2/qft.qcos2qcos-l2/0
# Quantum Fourier transform on N qubits, for any N of 2 or more.# The controlled phase between qubits i and j is pi / 2^(j - i).program qftconst N = 4const HALF = N >> 1qubit q[N]bit m[N]​x q[0]for i = 0 to N - 2  h q[i]  for j = i + 1 to N - 1    cp(pi / (1 << (j - i))) q[j], q[i]  nextnexth q[N - 1]for i = 0 to HALF - 1  swap q[i], q[N - 1 - i]nextfor i = 0 to N - 1  measure q[i] into m[i]next

Code de répétition

Encoder, injecter une erreur, lire le syndrome et la corriger.

examples/l2/repetition_code.qcos2qcos-l2/0
# Three-qubit bit-flip code: encode, inject one error, measure the two# parities with a reused ancilla, and correct from the syndrome.program repetition_codequbit d[3]bit s[2], out[3]uint8 syndrome = 0​# Encode |1> as |111>.x d[0]cx d[0], d[1]cx d[0], d[2]​# The error: a flip on the middle qubit.x d[1]​for i = 0 to 1  alloc anc  cx d[i], anc  cx d[i + 1], anc  measure anc into s[i]  free anc resetnext​if s[0] then  let syndrome = syndrome + 1endif s[1] then  let syndrome = syndrome + 2end​select syndrome  case 1:    x d[0]  case 3:    x d[1]  case 2:    x d[2]end​for i = 0 to 2  measure d[i] into out[i]next

Préparation parallèle

Des tâches sur des qubits disjoints, vérifiées pour que l'ordre n'ait aucune importance.

examples/l2/parallel_preparation.qcos2qcos-l2/0
# Two independent preparations written as tasks. The checker proves they# share no qubit and no variable, so the reported depth overlaps them.program parallel_preparationqubit a[2], b[2]bit ma[2], mb[2]​parallel  task bell_a    h a[0]    cx a[0], a[1]  end  task bell_b    h b[0]    cx b[0], b[1]  endend​for i = 0 to 1  measure a[i] into ma[i]  measure b[i] into mb[i]next

État GHZ

GHZ sur N qubits. Changez N, rien d'autre.

examples/l2/ghz.qcos2qcos-l2/0
# GHZ state on N qubits. Change N and nothing else.program ghzconst N = 5qubit q[N]bit m[N]​h q[0]for i = 0 to N - 2  cx q[i], q[i + 1]nextfor i = 0 to N - 1  measure q[i] into m[i]next

Bernstein-Vazirani

La chaîne cachée 1011 lue en une seule requête, avec une boucle sur N bits.

examples/l2/bernstein_vazirani.qcos2qcos-l2/0
# Bernstein-Vazirani on N bits: the oracle adds every bit of x where the# hidden string s has a 1. Here s = 1011, read as q[0] q[1] q[2] q[3].program bernstein_vaziraniconst N = 4qubit x[N], ybit m[N]​x yh yfor i = 0 to N - 1  h x[i]next​cx x[0], ycx x[2], ycx x[3], y​for i = 0 to N - 1  h x[i]  measure x[i] into m[i]next

Recherche de Grover

Trois qubits, état marqué 111, deux itérations.

examples/l2/grover.qcos2qcos-l2/0
# Grover search on three qubits for the marked state 111.# Two iterations find it with probability about 0.95.program groverconst N = 3const ROUNDS = 2qubit q[N]bit m[N]​sub diffusion(a, b, c)  compute    h a    h b    h c    x a    x b    x c  do    ccz a, b, c  endend​for i = 0 to N - 1  h q[i]nextfor r = 1 to ROUNDS  ccz q[0], q[1], q[2]  call diffusion(q[0], q[1], q[2])nextfor i = 0 to N - 1  measure q[i] into m[i]next

Répéter jusqu'au succès

Exécuter le corps, puis réessayer jusqu'à ce qu'une mesure donne 1, huit fois au maximum.

examples/l2/repeat_until_success.qcos2qcos-l2/0
# Repeat until success in L2: run the body, then try again until the# measurement reads 1, at most eight times in total.program repeat_until_successqubit a, ancbit muint8 tries = 0​repeat  h anc  measure anc into m  reset anc  let tries = tries + 1until m limit 8​if m and tries <= 2 then  x aend

HiQ Objects

Pour les bibliothèques d'algorithmes et les briques réutilisables.

Grover avec des objets oracle

Toute classe qui implémente Oracle peut faire l'objet d'une recherche.

examples/l3/grover_oracles.qcos3qcos-l3/0
// Grover search with the oracle passed as an object. Any class that// implements Oracle can be searched for; dispatch is resolved at compile time.​interface Oracle { def mark(a: qubit, b: qubit) }​// Marks 11.class MarkEleven implements Oracle {  public def mark(a: qubit, b: qubit) { cz a, b }}​// Marks 01 (a = 0, b = 1).class MarkZeroOne implements Oracle {  public def mark(a: qubit, b: qubit) {    within {      x a    } do {      cz a, b    }  }}​class Search(oracle: Oracle) {  public qubit a  public qubit b  public bit ma  public bit mb​  def diffuse() {    within {      h a      h b      x a      x b    } do {      cz a, b    }  }​  public def run() {    h a    h b    oracle.mark(a, b)    diffuse()    measure a -> ma    measure b -> mb  }}​main {  MarkZeroOne target  Search search(target)  search.run()}

QFT sur registre

La transformée de Fourier sous forme de classe sur un registre.

examples/l3/register_qft.qcos3qcos-l3/0
// A quantum register class with a Fourier transform and its inverse,// sized at compile time. Applying qft then iqft returns the input.​class Register(n: int) {  public qubit q[n]  public bit m[n]​  public def load_one(k: int) { x q[k] }​  public def qft() {    for i in 0..n {      h q[i]      for j in i + 1..n {        cp(pi / (1 << (j - i))) q[j], q[i]      }    }  }​  public def iqft() {    inverse {      self.qft()    }  }​  public def read() {    for i in 0..n {      measure q[i] -> m[i]    }  }}​main {  Register r(3)  r.load_one(1)  r.qft()  r.iqft()  r.read()}

Code de répétition

Un code de retournement de bit sous forme de classe, et une sous-classe qui ajoute une erreur.

examples/l3/repetition_code.qcos3qcos-l3/0
// A three-qubit bit-flip code as a class hierarchy: a base code that// encodes and decodes, and a subclass that adds a deliberate error.​class BitFlipCode {  public qubit d[3]  public bit s0  public bit s1  public bit out[3]​  public def encode() {    cx d[0], d[1]    cx d[0], d[2]  }​  def error() { }​  public def correct() {    qubit anc    cx d[0], anc    cx d[1], anc    measure anc -> s0    reset anc    cx d[1], anc    cx d[2], anc    measure anc -> s1    reset anc    if s0 {      if s1 { x d[1] } else { x d[0] }    } else {      if s1 { x d[2] }    }  }​  public def run() {    x d[0]    encode()    error()    correct()    for i in 0..3 {      measure d[i] -> out[i]    }  }}​class NoisyChannel extends BitFlipCode {  override def error() { x d[2] }}​main {  NoisyChannel channel  channel.run()}

HiQ Pulse

Pour les ingénieurs de contrôle qui façonnent le signal lui-même.

Rabi

Une impulsion de pilotage construite à partir d'une gaussienne et d'une forme d'onde constante.

examples/pulse/rabi.qcospqcos-pulse/0
# A Rabi point: one Gaussian drive pulse on qubit 0, then a readout.# Sweep amp across programs to trace the Rabi oscillation.pulse rabidt 0.5 nsbits 1port d0 drive qubits 0port m0 measure qubits 0frame drive on d0 freq 5.1 GHzframe read on m0 freq 7.2 GHzwaveform pi_half gaussian duration 40 ns amp 0.25 sigma 10 nswaveform tone constant duration 1 us amp 0.1play pi_half on drivebarrierplay tone on readcapture read 1 us -> 0

Ramsey

Deux impulsions demi-pi autour d'un délai d'évolution libre.

examples/pulse/ramsey.qcospqcos-pulse/0
# Ramsey: two half-pi pulses separated by a free evolution delay,# with a virtual phase advance on the second pulse.pulse ramseydt 1 nsbits 1port d0 drive qubits 0port m0 measure qubits 0frame drive on d0 freq 5.1 GHzframe read on m0 freq 7.2 GHzwaveform half gaussian duration 32 ns amp 0.25 sigma 8 nsplay half on drivedelay 200 ns on driveshift_phase drive pi/2play half on drivebarriercapture read 2 us -> 0

Écho

Une impulsion de refocalisation entre deux délais.

examples/pulse/echo.qcospqcos-pulse/0
# Hahn echo: half-pi, wait, pi, wait, half-pi. The pi pulse is a# Blackman window at twice the amplitude.pulse echodt 1 nsbits 1port d0 drive qubits 0port m0 measure qubits 0frame drive on d0 freq 5.1 GHzframe read on m0 freq 7.2 GHzwaveform half blackman duration 40 ns amp 0.2waveform full blackman duration 40 ns amp 0.4play half on drivedelay 500 ns on driveplay full on drivedelay 500 ns on driveplay half on drivebarriercapture read 2 us -> 0