[{"data":1,"prerenderedAt":967},["ShallowReactive",2],{"blog-post-quantum-courier":3,"sibling-dives-quantum-courier":965,"learn-track-quantum-courier":966},{"id":4,"title":5,"authors":6,"body":8,"breadcrumb":892,"builders":896,"byline":913,"challenge":918,"courseAuthor":918,"courseLead":918,"dek":919,"description":920,"draft":921,"extension":922,"eyebrow":923,"finish":918,"fork":924,"hero":926,"heroAlt":918,"heroCta":918,"heroImage":918,"kind":928,"lessonCount":918,"meta":929,"navigation":197,"newsItems":918,"next":918,"ogImage":918,"order":918,"outcomes":918,"path":930,"publishDate":931,"readingTime":932,"related":933,"relatedProjects":934,"seo":956,"stem":959,"tags":960,"track":918,"trackName":918,"__hash__":964},"blog\u002Fblog\u002Fquantum-courier.md","Project Showcase: Quantum Courier",[7],"Sitifar",{"type":9,"value":10,"toc":886},"minimark",[11,15,18,21,30,35,38,102,109,112,117,121,129,798,845,849,852,857,860,864,867,872,882],[12,13,14],"p",{},"Quantum Courier is a browser game that turns combinatorial optimisation into a five-stage delivery race. Two robots run the same logistics problem, one classical, one quantum, and you watch which solver wins.",[12,16,17],{},"Every stage is a real, published formulation pulled from logistics, from assigning pizzas to cutting graphs. And the game refuses to oversell: classical solvers win some stages, quantum methods win others, and it shows both, with the result and the reason on screen.",[12,19,20],{},"It is a Spring 2026 challenge project from Dr Siti Fariya, founder of Qatalyst Quantum and a postdoctoral researcher who spent two years optimising real vehicle routing at the Port of Dover. That industry background is where the whole project comes from.",[22,23,27],"pull-quote",{"avatar":24,"name":25,"role":26,"username":7},"\u002F_content\u002Fimages\u002Fbuilders\u002Fsiti-fariya.webp","Dr Siti Fariya","Creator, Quantum Courier",[12,28,29],{},"My background is classical, doing logistics optimisation at the Port of Dover. I got into quantum through a UK government programme for industry, and I saw the gap between real industry cases and quantum, especially in logistics.",[31,32,34],"h2",{"id":33},"five-stages-two-solvers","Five stages, two solvers",[12,36,37],{},"Each stage is a different optimisation problem, run by a classical planner using proven heuristics and a quantum-inspired one using QUBO-based search. Each has a clear winner, and the game is upfront about who it is:",[39,40,42],"repo-spec",{"lead":41},"Five published formulations, each with an honest result.",[43,44,45,58],"table",{},[46,47,48],"thead",{},[49,50,51,55],"tr",{},[52,53,54],"th",{},"Field",[52,56,57],{},"Detail",[59,60,61,70,78,86,94],"tbody",{},[49,62,63,67],{},[64,65,66],"td",{},"1 · Pizza assignment",[64,68,69],{},"Linear assignment, classical wins (Hungarian algorithm).",[49,71,72,75],{},[64,73,74],{},"2 · Single-vehicle routing",[64,76,77],{},"TSP, tied at small N, classical scales better.",[49,79,80,83],{},[64,81,82],{},"3 · Multi-vehicle, time windows",[64,84,85],{},"VRPTW, classical wins (annealing beats QAOA at 25 customers).",[49,87,88,91],{},[64,89,90],{},"4 · Graph cutting",[64,92,93],{},"MaxCut, quantum wins (+46.2% on real IonQ Forte).",[49,95,96,99],{},[64,97,98],{},"5 · Combined planning",[64,100,101],{},"Joint QUBO, depends on instance structure.",[103,104],"blog-figure",{"caption":105,"no":106,"poster":107,"video":108},"Quantum Courier in play: a stage runs, the classical and quantum solvers race the same instance, and the game shows the winner and the margin. Press play.","Fig. 1","\u002F_content\u002Fimages\u002Fquantum-courier\u002Fhero.webp","https:\u002F\u002Fapi.cms.qollab.xyz\u002Fassets\u002F30f10262-f772-4394-841b-365eac4a0c4a",[12,110,111],{},"The competitive framing does the teaching. Five stops feel easy; twenty stops feel brutal, and the difference between solvers stops being a claim in a lecture and becomes something you watch happen.",[22,113,114],{"avatar":24,"name":25,"role":26,"username":7},[12,115,116],{},"I wanted the focus to be on teaching quantum itself, so the optimisation is open, especially the classical part. There are already plenty of open papers on that anyway.",[31,118,120],{"id":119},"the-forte-result","The Forte result",[12,122,123,124,128],{},"Stage 4 is where quantum wins, and it runs on real hardware. The problem is ",[125,126,127],"strong",{},"MaxCut"," on a 24-node 3-regular graph: split the nodes into two groups so the number of edges crossing between them is as large as possible. Siti ran QAOA at depth p=1 with 4,096 shots on IonQ Forte, and the cut came back 46.2% above the classical baseline. On Qollab the same circuit runs on a simulator or a real QPU exactly as written:",[130,131,135],"code-block",{"name":132,"run-href":133,"tag":134},"quantum_courier_maxcut_forte.py","\u002Fu\u002FSitifar\u002Fquantum-game-pizza-race","Python",[136,137,142],"pre",{"className":138,"code":139,"language":140,"meta":141,"style":141},"language-python shiki shiki-themes one-dark-pro","# Stage 4 — MaxCut on a 24-node 3-regular graph, QAOA p=1.\nfrom qiskit import QuantumCircuit\nfrom qiskit.providers.jobstatus import JobStatus\nimport time\n\nN_NODES, SHOTS = 24, 4096\nEDGES = [(0,1), (0,7), (0,14), (1,2), (1,19), # ... 36 edges, 3 per node]\nGAMMA, BETA = 0.393, 0.785      # pre-tuned on a simulator sweep\n\ndef qaoa_circuit(gamma, beta):\n    qc = QuantumCircuit(N_NODES, N_NODES)\n    qc.h(range(N_NODES))\n    for (u, v) in EDGES:                 # cost layer\n        qc.cx(u, v); qc.rz(2 * gamma, v); qc.cx(u, v)\n    for q in range(N_NODES):\n        qc.rx(2 * beta, q)\n    qc.measure(range(N_NODES), range(N_NODES))\n    return qc\n\ndef cut_value(bitstring):\n    bits = [int(b) for b in bitstring[::-1]]\n    return sum(1 for (u, v) in EDGES if bits[u] != bits[v])\n\ncircuit = qaoa_circuit(GAMMA, BETA)\njob = backend.run(circuit, shots=SHOTS)\nwhile job.status() is not JobStatus.DONE:\n    time.sleep(5)\ncounts = job.result().get_counts()\nbest = max(counts, key=cut_value)        # best split in the shot pool\nprint(f\"Best cut: {cut_value(best)} of {len(EDGES)} edges\")\n","python","",[143,144,145,154,171,184,192,199,224,287,312,317,330,351,385,406,444,464,489,516,525,530,541,572,610,615,634,663,693,709,727,750],"code",{"__ignoreMap":141},[146,147,150],"span",{"class":148,"line":149},"line",1,[146,151,153],{"class":152},"sV9Aq","# Stage 4 — MaxCut on a 24-node 3-regular graph, QAOA p=1.\n",[146,155,157,161,165,168],{"class":148,"line":156},2,[146,158,160],{"class":159},"seHd6","from",[146,162,164],{"class":163},"sn6KH"," qiskit ",[146,166,167],{"class":159},"import",[146,169,170],{"class":163}," QuantumCircuit\n",[146,172,174,176,179,181],{"class":148,"line":173},3,[146,175,160],{"class":159},[146,177,178],{"class":163}," qiskit.providers.jobstatus ",[146,180,167],{"class":159},[146,182,183],{"class":163}," JobStatus\n",[146,185,187,189],{"class":148,"line":186},4,[146,188,167],{"class":159},[146,190,191],{"class":163}," time\n",[146,193,195],{"class":148,"line":194},5,[146,196,198],{"emptyLinePlaceholder":197},true,"\n",[146,200,202,206,209,212,216,219,221],{"class":148,"line":201},6,[146,203,205],{"class":204},"sVC51","N_NODES",[146,207,208],{"class":163},", ",[146,210,211],{"class":204},"SHOTS",[146,213,215],{"class":214},"sjrmR"," =",[146,217,218],{"class":204}," 24",[146,220,208],{"class":163},[146,222,223],{"class":204},"4096\n",[146,225,227,230,232,235,238,241,244,247,249,251,254,256,258,260,263,265,267,269,272,274,276,278,281,284],{"class":148,"line":226},7,[146,228,229],{"class":204},"EDGES",[146,231,215],{"class":214},[146,233,234],{"class":163}," [(",[146,236,237],{"class":204},"0",[146,239,240],{"class":163},",",[146,242,243],{"class":204},"1",[146,245,246],{"class":163},"), (",[146,248,237],{"class":204},[146,250,240],{"class":163},[146,252,253],{"class":204},"7",[146,255,246],{"class":163},[146,257,237],{"class":204},[146,259,240],{"class":163},[146,261,262],{"class":204},"14",[146,264,246],{"class":163},[146,266,243],{"class":204},[146,268,240],{"class":163},[146,270,271],{"class":204},"2",[146,273,246],{"class":163},[146,275,243],{"class":204},[146,277,240],{"class":163},[146,279,280],{"class":204},"19",[146,282,283],{"class":163},"), ",[146,285,286],{"class":152},"# ... 36 edges, 3 per node]\n",[146,288,290,293,295,298,301,304,306,309],{"class":148,"line":289},8,[146,291,292],{"class":204},"GAMMA",[146,294,208],{"class":163},[146,296,297],{"class":204},"BETA",[146,299,300],{"class":163}," = ",[146,302,303],{"class":204},"0.393",[146,305,208],{"class":163},[146,307,308],{"class":204},"0.785",[146,310,311],{"class":152},"      # pre-tuned on a simulator sweep\n",[146,313,315],{"class":148,"line":314},9,[146,316,198],{"emptyLinePlaceholder":197},[146,318,320,323,327],{"class":148,"line":319},10,[146,321,322],{"class":159},"def",[146,324,326],{"class":325},"sVbv2"," qaoa_circuit",[146,328,329],{"class":163},"(gamma, beta):\n",[146,331,333,336,339,342,344,346,348],{"class":148,"line":332},11,[146,334,335],{"class":163},"    qc = ",[146,337,338],{"class":325},"QuantumCircuit",[146,340,341],{"class":163},"(",[146,343,205],{"class":204},[146,345,208],{"class":163},[146,347,205],{"class":204},[146,349,350],{"class":163},")\n",[146,352,354,357,360,362,365,367,369,372],{"class":148,"line":353},12,[146,355,356],{"class":163},"    qc.",[146,358,359],{"class":325},"h",[146,361,341],{"class":163},[146,363,364],{"class":214},"range",[146,366,341],{"class":163},[146,368,205],{"class":204},[146,370,371],{"class":163},"))",[146,373,376,377],{"class":374,"tabindex":375},"qg-help",0,"?",[146,378,381,384],{"class":379,"role":380},"qg-help__tip","tooltip",[125,382,383],{},"Superposition."," A Hadamard on every node starts the circuit in an equal mix of all 2^24 ways to split the graph.",[146,386,388,391,394,397,400,403],{"class":148,"line":387},13,[146,389,390],{"class":159},"    for",[146,392,393],{"class":163}," (u, v) ",[146,395,396],{"class":159},"in",[146,398,399],{"class":204}," EDGES",[146,401,402],{"class":163},":                 ",[146,404,405],{"class":152},"# cost layer\n",[146,407,409,412,415,418,421,423,425,428,431,433,436],{"class":148,"line":408},14,[146,410,411],{"class":163},"        qc.",[146,413,414],{"class":325},"cx",[146,416,417],{"class":163},"(u, v); qc.",[146,419,420],{"class":325},"rz",[146,422,341],{"class":163},[146,424,271],{"class":204},[146,426,427],{"class":214}," *",[146,429,430],{"class":163}," gamma, v); qc.",[146,432,414],{"class":325},[146,434,435],{"class":163},"(u, v)",[146,437,376,438],{"class":374,"tabindex":375},[146,439,440,443],{"class":379,"role":380},[125,441,442],{},"Cost."," One ZZ term per edge. It rewards a cut edge: the two endpoints landing on opposite sides of the split.",[146,445,447,449,452,454,457,459,461],{"class":148,"line":446},15,[146,448,390],{"class":159},[146,450,451],{"class":163}," q ",[146,453,396],{"class":159},[146,455,456],{"class":214}," range",[146,458,341],{"class":163},[146,460,205],{"class":204},[146,462,463],{"class":163},"):\n",[146,465,467,469,472,474,476,478,481],{"class":148,"line":466},16,[146,468,411],{"class":163},[146,470,471],{"class":325},"rx",[146,473,341],{"class":163},[146,475,271],{"class":204},[146,477,427],{"class":214},[146,479,480],{"class":163}," beta, q)",[146,482,376,483],{"class":374,"tabindex":375},[146,484,485,488],{"class":379,"role":380},[125,486,487],{},"Mixer."," Nudges nodes between the two sides so the optimizer can explore different cuts.",[146,490,492,494,497,499,501,503,505,507,509,511,513],{"class":148,"line":491},17,[146,493,356],{"class":163},[146,495,496],{"class":325},"measure",[146,498,341],{"class":163},[146,500,364],{"class":214},[146,502,341],{"class":163},[146,504,205],{"class":204},[146,506,283],{"class":163},[146,508,364],{"class":214},[146,510,341],{"class":163},[146,512,205],{"class":204},[146,514,515],{"class":163},"))\n",[146,517,519,522],{"class":148,"line":518},18,[146,520,521],{"class":159},"    return",[146,523,524],{"class":163}," qc\n",[146,526,528],{"class":148,"line":527},19,[146,529,198],{"emptyLinePlaceholder":197},[146,531,533,535,538],{"class":148,"line":532},20,[146,534,322],{"class":159},[146,536,537],{"class":325}," cut_value",[146,539,540],{"class":163},"(bitstring):\n",[146,542,544,547,550,553,556,559,561,564,567,569],{"class":148,"line":543},21,[146,545,546],{"class":163},"    bits = [",[146,548,549],{"class":214},"int",[146,551,552],{"class":163},"(b) ",[146,554,555],{"class":159},"for",[146,557,558],{"class":163}," b ",[146,560,396],{"class":159},[146,562,563],{"class":163}," bitstring[::",[146,565,566],{"class":214},"-",[146,568,243],{"class":204},[146,570,571],{"class":163},"]]\n",[146,573,575,577,580,582,584,587,589,591,593,596,599,602,605],{"class":148,"line":574},22,[146,576,521],{"class":159},[146,578,579],{"class":214}," sum",[146,581,341],{"class":163},[146,583,243],{"class":204},[146,585,586],{"class":159}," for",[146,588,393],{"class":163},[146,590,396],{"class":159},[146,592,399],{"class":204},[146,594,595],{"class":159}," if",[146,597,598],{"class":163}," bits[u] ",[146,600,601],{"class":214},"!=",[146,603,604],{"class":163}," bits[v])",[146,606,376,607],{"class":374,"tabindex":375},[146,608,609],{"class":379,"role":380},"Counts how many edges a given split cuts. Maximizing this is the whole game of Stage 4.",[146,611,613],{"class":148,"line":612},23,[146,614,198],{"emptyLinePlaceholder":197},[146,616,618,621,624,626,628,630,632],{"class":148,"line":617},24,[146,619,620],{"class":163},"circuit = ",[146,622,623],{"class":325},"qaoa_circuit",[146,625,341],{"class":163},[146,627,292],{"class":204},[146,629,208],{"class":163},[146,631,297],{"class":204},[146,633,350],{"class":163},[146,635,637,640,643,646,650,653,655,658],{"class":148,"line":636},25,[146,638,639],{"class":163},"job = backend.",[146,641,642],{"class":325},"run",[146,644,645],{"class":163},"(circuit, ",[146,647,649],{"class":648},"s_ZVi","shots",[146,651,652],{"class":214},"=",[146,654,211],{"class":204},[146,656,657],{"class":163},")",[146,659,376,660],{"class":374,"tabindex":375},[146,661,662],{"class":379,"role":380},"Submitted to IonQ Forte (trapped-ion). On this 24-node graph the QAOA cut came in 46.2% above the classical baseline.",[146,664,666,669,672,675,678,681,684,687,690],{"class":148,"line":665},26,[146,667,668],{"class":159},"while",[146,670,671],{"class":163}," job.",[146,673,674],{"class":325},"status",[146,676,677],{"class":163},"() ",[146,679,680],{"class":159},"is",[146,682,683],{"class":159}," not",[146,685,686],{"class":163}," JobStatus.",[146,688,689],{"class":204},"DONE",[146,691,692],{"class":163},":\n",[146,694,696,699,702,704,707],{"class":148,"line":695},27,[146,697,698],{"class":163},"    time.",[146,700,701],{"class":325},"sleep",[146,703,341],{"class":163},[146,705,706],{"class":204},"5",[146,708,350],{"class":163},[146,710,712,715,718,721,724],{"class":148,"line":711},28,[146,713,714],{"class":163},"counts = job.",[146,716,717],{"class":325},"result",[146,719,720],{"class":163},"().",[146,722,723],{"class":325},"get_counts",[146,725,726],{"class":163},"()\n",[146,728,730,733,736,739,742,744,747],{"class":148,"line":729},29,[146,731,732],{"class":163},"best = ",[146,734,735],{"class":214},"max",[146,737,738],{"class":163},"(counts, ",[146,740,741],{"class":648},"key",[146,743,652],{"class":214},[146,745,746],{"class":163},"cut_value)        ",[146,748,749],{"class":152},"# best split in the shot pool\n",[146,751,753,756,758,761,765,768,771,774,777,780,782,785,787,789,791,793,796],{"class":148,"line":752},30,[146,754,755],{"class":214},"print",[146,757,341],{"class":163},[146,759,760],{"class":159},"f",[146,762,764],{"class":763},"subq3","\"Best cut: ",[146,766,767],{"class":204},"{",[146,769,770],{"class":325},"cut_value",[146,772,773],{"class":163},"(best)",[146,775,776],{"class":204},"}",[146,778,779],{"class":763}," of ",[146,781,767],{"class":204},[146,783,784],{"class":214},"len",[146,786,341],{"class":163},[146,788,229],{"class":204},[146,790,657],{"class":163},[146,792,776],{"class":204},[146,794,795],{"class":763}," edges\"",[146,797,350],{"class":163},[39,799,801],{"lead":800},"Quantum Courier is open source and MIT-licensed, built to be forked and rerun.",[43,802,803,811],{},[46,804,805],{},[49,806,807,809],{},[52,808,54],{},[52,810,57],{},[59,812,813,821,829,837],{},[49,814,815,818],{},[64,816,817],{},"Frontend",[64,819,820],{},"Vanilla HTML, CSS, and JavaScript, no framework.",[49,822,823,826],{},[64,824,825],{},"Classical solvers",[64,827,828],{},"Hungarian algorithm, 2-opt + simulated annealing, Goemans-Williamson SDP rounding.",[49,830,831,834],{},[64,832,833],{},"Quantum-inspired",[64,835,836],{},"QUBO simulated quantum annealing, in the browser.",[49,838,839,842],{},[64,840,841],{},"Real hardware",[64,843,844],{},"Qiskit + qiskit-ionq, IonQ Forte via qBraid, QAOA p=1 at 4,096 shots.",[31,846,848],{"id":847},"structure-beats-qubit-count","Structure beats qubit count",[12,850,851],{},"The most interesting result is the one that went the other way. For Stage 3, Siti tested four QAOA variants on Forte against classical simulated annealing on a 25-customer vehicle-routing instance with time windows. Classical won every time, and she left that result in the game on purpose.",[22,853,854],{"avatar":24,"name":25,"role":26,"username":7},[12,855,856],{},"Quantum people are looking for real cases to solve, but they don't really understand the real problems in industry, like logistics. I want to be a bridge between the two.",[12,858,859],{},"The reason is structure, not raw qubit count. MaxCut has a cost function that simply counts cut edges, which lines up naturally with what a shallow parameterised quantum circuit can express. Vehicle routing does not have that property at the scales we can run today, and classical routing heuristics are decades mature. That contrast is the real lesson Quantum Courier teaches: where quantum helps is a question of problem shape, and the honest answer is sometimes no. Siti is already extending the work toward grid-storage siting problems, with a finding written up for a 2026 submission.",[31,861,863],{"id":862},"make-it-yours","Make it yours",[12,865,866],{},"The game is open and forkable on Qollab, the full code is MIT-licensed on GitHub, and you can play all five stages in your browser right now. The Stage 4 MaxCut circuit runs on real IonQ hardware in a click, so you can rerun the result that beat the classical baseline yourself.",[22,868,869],{"avatar":24,"name":25,"role":26,"username":7},[12,870,871],{},"I hope this doesn't stop after Qollab and IonQ. I'd love to see more collaborations like this between industry and quantum.",[862,873,876],{"fork-href":133,"live-href":874,"title":875},"https:\u002F\u002Fqatalyst-quantum.co.uk\u002Fplay","Can you beat a quantum computer at route planning?",[12,877,878,879],{},"Play all five stages, fork the game, and rerun the MaxCut circuit on real IonQ Forte. ",[125,880,881],{},"Everything here is open and yours to build on.",[883,884,885],"style",{},"html pre.shiki code .sV9Aq, html code.shiki .sV9Aq{--shiki-default:#7F848E;--shiki-default-font-style:italic}html pre.shiki code .seHd6, html code.shiki .seHd6{--shiki-default:#C678DD}html pre.shiki code .sn6KH, html code.shiki .sn6KH{--shiki-default:#ABB2BF}html pre.shiki code .sVC51, html code.shiki .sVC51{--shiki-default:#D19A66}html pre.shiki code .sjrmR, html code.shiki .sjrmR{--shiki-default:#56B6C2}html pre.shiki code .sVbv2, html code.shiki .sVbv2{--shiki-default:#61AFEF}html pre.shiki code .s_ZVi, html code.shiki .s_ZVi{--shiki-default:#E06C75;--shiki-default-font-style:italic}html pre.shiki code .subq3, html code.shiki .subq3{--shiki-default:#98C379}html .default .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}",{"title":141,"searchDepth":156,"depth":156,"links":887},[888,889,890,891],{"id":33,"depth":156,"text":34},{"id":119,"depth":156,"text":120},{"id":847,"depth":156,"text":848},{"id":862,"depth":156,"text":863},[893,894,895],"Qollab","Blog","Quantum Courier",[897],{"username":7,"name":25,"role":898,"avatar":24,"bio":899,"links":900},"Founder · Qatalyst Quantum","Siti is a postdoctoral researcher at Heriot-Watt University and the founder of Qatalyst Quantum, a vehicle-routing optimisation startup combining classical and quantum approaches (Conception X, Microsoft Founders Hub, Quantinuum Q-NET, Kipu Quantum Hub). She spent two years at the Port of Dover as a KTP Associate, building traffic-simulation models and exploring quantum computing for routing operations, and has built Qatalyst's full optimisation pipeline, from agentic AI orchestration to custom solvers and quantum problem reformulation, with hands-on experience on D-Wave and ORCA hardware.",[901,904,907,910],{"label":902,"href":903},"Qollab ↗","https:\u002F\u002Fqollab.xyz\u002Fu\u002FSitifar",{"label":905,"href":906},"LinkedIn ↗","https:\u002F\u002Fwww.linkedin.com\u002Fin\u002Fsiti-fariya\u002F",{"label":908,"href":909},"GitHub ↗","https:\u002F\u002Fgithub.com\u002Fsitifariya",{"label":911,"href":912},"Qatalyst ↗","https:\u002F\u002Fqatalyst-quantum.co.uk\u002F",{"username":914,"name":915,"role":916,"avatar":917},"nico","Nicolaas Spijker","Community manager, Qollab","\u002F_content\u002Fimages\u002Fbuilders\u002Fnicolaas-spijker.webp",null,"Dr Siti Fariya built a browser game that races classical and quantum solvers across five real logistics problems, and shows honestly which one wins, and why.","Dr Siti Fariya built Quantum Courier, a browser game racing classical vs quantum solvers across five logistics problems, with a 46.2% MaxCut win on IonQ Forte.",false,"md","Quantum Creative Challenge · Spring 2026",{"href":133,"label":925},"Fork the game",{"image":107,"alt":927,"liveUrl":874},"Quantum Courier: Pizza Race, a browser game racing classical vs quantum solvers","news",{},"\u002Fblog\u002Fquantum-courier","2026-05-02","7 min read",[],[935,942,949],{"username":936,"project":937,"title":938,"category":939,"thumb":940,"to":941},"bawa27","qorbital","qOrbital","Education","\u002F_content\u002Fimages\u002Fqorbital\u002Fthumbnail.webp","\u002Fexplore\u002Fqorbital",{"username":943,"project":944,"title":945,"category":946,"thumb":947,"to":948},"lukeshim","entangled-body","Entangled Body","Art","\u002F_content\u002Fimages\u002Fentangled-body\u002Fthumbnail.webp","\u002Fexplore\u002Fentangled-body",{"username":950,"project":951,"title":952,"category":953,"thumb":954,"to":955},"incomputable","francisco","Superposition Sequencer","Music","\u002F_content\u002Fimages\u002Fsuperposition-sequencer\u002Fthumbnail.webp","\u002Fexplore\u002Ffrancisco",{"title":957,"description":958},"Quantum Creative Project Showcase: Quantum Courier","A browser game that races classical vs quantum solvers across five logistics problems, and shows honestly which wins and why.","blog\u002Fquantum-courier",[961,962,963],"optimization","quantum","games","vKX5WNXRiWNT2DtNBtSdf0UgvkASzpcM-Yd0SQJ21aA",[],[],1785631554621]