arrow left

Summary of "Quantum Computing: The Past, Present, and Future" | Jonathan Wurtz's Presentation at Pawsey

calender icon
April 22, 2025
clock icon
min read
Events
Share

This blog summarizes the presentation "Quantum Computing: The Past, Present, and Future" given by QuEra's Quantum Solutions Lead, Jonathan Wurtz, at Pawsey Supercomputing Centre in Australia on March 17, 2025. The high-level talk covered QuEra's background, the theory behind quantum computing, hardware & algorithms quintessential to advancement today, and quantum co-design. He offers a unique expert perspective on the state of quantum computing today and what it means for real-world applications. This blog was authored by a listener to Jonathan's talk, not by Jonathan himself.

1. A New Lens on Science and Computation

One of the most memorable analogies from Jonathan Wurtz’s presentation is that quantum computers might become our era’s “microscope.” Just as early microscopes revealed a hidden universe of single-celled life that no one had previously imagined, quantum computers could serve as an instrument to unlock entirely new scientific vistas—even yielding insights or applications we have yet to conceive. This possibility underscores the excitement that has been building around the field.

But, as with microscopes in the seventeenth century, the quantum computing field is still taking shape. Tools are emerging and capabilities are being demonstrated, but many breakthroughs await. The talk’s central message is that quantum computing is advancing rapidly, and organizations across industry and academia are investing now to be ready for—and help shape—the remarkable possibilities that could arrive.

2. Why Quantum? A Look at the Big Four Applications

Wurtz highlights four broad areas that drive most discussions on quantum computing’s potential. While these categories are not all-encompassing, they serve as a good starting point for understanding why people see quantum computing as a paradigm shift.

  • 2.1 Optimization
    Why it matters:
    Many of today’s biggest computational challenges boil down to optimization. You want to minimize cost, maximize output, or find the best way to route a fleet of trucks. If you have thousands or even millions of interrelated variables, the search space grows exponentially, and classical computers often resort to heuristics or approximations.
    Quantum’s role:
    Quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) or Grover’s search show promise. They leverage “entanglement” and “interference” to guide the system toward optimal solutions faster than classical methods can—at least for certain structured problems. While the race isn’t yet definitively won, researchers keep refining quantum-heuristic approaches, pushing the boundary beyond what classical tools alone can achieve.
  • 2.2 Quantum Simulation
    Why it matters:
    “Simulate nature with nature” is how some enthusiasts describe quantum simulation. Standard (classical) computers find it notoriously difficult to simulate quantum effects in materials, proteins, and molecular processes—these are inherently quantum phenomena. But by building a controlled quantum system, you can effectively “mirror” the physics of, say, a new material or a complex molecule.
    Quantum’s role:
    Quantum devices can emulate chemical bonds, exotic phases of matter, or even quantum field theories that are otherwise intractable with classical computers. Such simulations could be pivotal for discovering new pharmaceuticals or designing advanced materials (e.g., better energy storage, improved superconductors). Even near-term quantum devices, operating with dozens or hundreds of qubits in specialized “analog” modes, can already yield valuable insight into quantum chemistry and condensed matter—no error correction required.
  • 2.3 Machine Learning
    Why it matters:
    From product recommendations to autonomous vehicles, machine learning is transforming the modern enterprise. But training large models or generating realistic data can overwhelm even today’s best high-performance computers.
    Quantum’s role:
    While quantum machine learning is still a young topic, quantum computers excel at sampling from complex probability distributions—arguably one of the hardest tasks in ML. The hope is that a quantum system acting as a specialized “kernel” or “reservoir” might provide richer, more powerful transformations than its classical counterpart. That could mean faster learning or the ability to tackle highly correlated data that is difficult for classical methods. Research in this area is burgeoning, although most demonstrations are still confined to small- or medium-scale devices.
  • 2.4 Code-Breaking & Cryptography
    Why it matters:
    The mere possibility that quantum computers can factor large numbers much faster has rattled the world of cryptography. Modern secure communication—think online banking—relies heavily on encryption whose strength comes from the difficulty of factoring large integers.
    Quantum’s role:
    Shor’s algorithm shows that factoring can, in principle, be done exponentially faster on a quantum computer. But this feat requires thousands (if not more) of stable, error-corrected qubits. No one is close to that level of hardware yet, but governments and companies aren’t waiting. They are developing “post-quantum” cryptographic standards that aim to withstand a future quantum threat.

3. Four Modes of Quantum Computation

Wurtz classifies quantum computing approaches into four conceptual “modes.” Each reflects a different way of controlling and orchestrating qubits.

  1. Adiabatic (Annealing): The system slowly evolves from a simple quantum state into a target ground state encoding the solution to a problem (often combinatorial optimization). Annealers like D-Wave specialize in this approach.
  2. Analog: You program a continuous “Hamiltonian” (the energy landscape) that operates on many interacting qubits or atoms. This can be extremely powerful for simulating physics directly, but it is not universally applicable to all algorithms. Neutral-atom devices, like QuEra's Aquila for instance, frequently use analog methods to simulate quantum materials.
  3. Digital (“Noisy” Gate-Based): Gates—analogous to logic operations in classical computing—are applied in sequences (circuits). You can program a wide variety of algorithms, but noise and decoherence limit how many gates you can apply before errors become overwhelming.
  4. Error-Corrected (Logical Qubits): By encoding a single “logical” qubit into many physical qubits, one can detect and correct errors on the fly. This is the holy grail for large-scale quantum computing, allowing for deep, complex computations. Until recently, demonstrations were minimal, but multiple hardware players have shown progress toward scaling up logical qubits.

4. The Hardware Landscape

Quantum hardware, the engines behind all these modes, typically revolves around four primary modalities:

  1. Neutral Atoms – Arrays of individual atoms (e.g., rubidium), held in place by laser light. They offer a path to large numbers of qubits and can be reconfigured mid-circuit.
  2. Trapped Ions – Chains of ions controlled via electromagnetic fields. They have long coherence times and relatively uniform qubits.
  3. Superconductors – Qubits built out of superconducting circuits, controlled by microwave pulses. Major players like IBM and Google have bet heavily on this technology.
  4. Photonics – Qubits encoded in light (photons). These promise natural connectivity and the potential for interesting networking applications, but face challenges in scaling stable gates.

No single approach “wins” outright; each has advantages for particular needs. In the longer run, specialized tasks may benefit from specialized hardware. The community is also investigating the possibility of combining multiple types of hardware via quantum interconnects.

5. The Road to Fault Tolerance

A recurring theme is how to push forward from today’s “NISQ” (Noisy Intermediate Scale Quantum) devices—where noise limits the depth of algorithms—toward large, error-corrected machines. Error correction encodes one logical qubit across many physical qubits, frequently using sophisticated techniques such as:

  • Surface Codes: Arrange qubits on a grid and measure “syndromes” to detect and correct errors.
  • Color Codes or LDPC Codes: Alternative structures that also permit error detection and correction with certain advantages, such as potentially fewer overhead qubits or faster decoding.

Although a fully fault-tolerant processor that can handle tens of thousands of qubits is likely years away, each incremental step—demonstrating, for instance, a single logical qubit that outperforms its best physical qubits—represents a milestone. Reaching “utility-scale” quantum computing will hinge on continuing these advances while keeping noise at bay.

6. Quantum Co-Design and Hybrid Integration

Wurtz strongly emphasizes the role of “co-design,” a process in which hardware, algorithms, and applications are crafted with an awareness of one another. Rather than waiting for a universal quantum computer that can do anything, a co-design mindset says:

  1. Identify a high-impact problem (or set of problems).
  2. Match it to the right hardware modality (such as analog quantum simulation for certain physics or chemistry tasks).
  3. Optimize the algorithm to exploit that hardware’s strengths while respecting its constraints (e.g., connectivity, coherence times).

In parallel, we should expect tight integration between quantum processors (“QPUs”) and classical resources. Many quantum algorithms require extensive classical supervision: from scheduling gates, to decoding error syndromes in real time, to analyzing measurement outputs. Thus, in the not-so-distant future, organizations may see quantum acceleration living alongside—or even within—existing HPC (High-Performance Computing) environments, rather than as a standalone box.

7. Why This Matters Now

7.1 Readiness and Early Prototypes

While “useful” quantum advantage for commercial applications remains an open question, many enterprises, governments, and researchers are investing heavily to prepare. This is no longer purely a world of fundamental physics. Cloud-accessible quantum hardware already exists, allowing scientists to test small algorithms in real environments.

7.2 Avoiding Missed Opportunities

Much like 3G networks in the early 2000s, large sums are being spent before all end uses are clear. Years ago, most of us did not foresee smartphones, let alone app stores. By building out quantum hardware and the surrounding ecosystem, we create a foundation upon which “unexpected applications” could flourish—ranging from new materials discovery to specialized optimization for finance, logistics, or pharmaceuticals.

7.3 Post-Quantum Cryptography

Shor’s algorithm famously looms over standard encryption. While the quantum threat might lie five, ten, or even more years away, industries responsible for long-lived sensitive data are transitioning toward post-quantum encryption today. The talk underscores that though full-scale code-breaking is not imminent, prudent cybersecurity strategies can’t ignore the forward march of quantum hardware.

8. The Path Forward

Jonathan Wurtz’s message is equal parts anticipation and pragmatism. Quantum computing is already advancing beyond the lab-bench prototype stage; companies, universities, and national labs around the world are using or building near-term systems for tasks in quantum simulation, small-scale algorithm demonstrations, and error-correction experiments.

Yet significant challenges remain, from scaling up qubit counts to refining error-correction strategies that will allow extended computations. As hardware designers continue to iterate and software developers learn how to run more clever quantum-classical “hybrid” workflows, it’s conceivable that quantum hardware could evolve into a specialized—but indispensable—accelerator in a future HPC ecosystem.

From a business standpoint, it’s wise to consider quantum as a strategic horizon technology. Many organizations are investigating potential “killer apps” or forging partnerships to access quantum hardware in the cloud. In the same way that HPC became essential for data-intensive tasks, quantum may become essential (in certain scenarios) where even HPC struggles.

9. Final Thoughts

Wurtz’s talk ends with a call to action for collaboration across all layers—hardware, algorithms, and real-world use cases. The quantum computing community is no longer just about theory or small proof-of-concept systems. It’s about bridging the gap between research and meaningful commercial or scientific application.\

  • Co-design stands out as a guiding principle: find problems that match the right kind of quantum platform, and tailor the approach to those strengths.
  • Integration with powerful classical computing resources is equally important: as quantum devices scale, real-time error correction and large-scale data handling will require HPC-like infrastructures.
  • Practical readiness must also guide CIOs and strategists: it’s never too early to investigate possible use-cases, skill up teams, or start pilot programs—even if “full-scale” quantum won’t arrive for several more years.

In sum, quantum computing has the potential to transform entire sectors, from materials science to finance to cryptography. As Wurtz’s lecture makes clear, this technology has matured significantly in a short time. While hurdles remain, the pace of breakthroughs—in hardware fidelity, logical qubit demonstrations, and real-world tests—suggests that quantum computing is swiftly moving from a theoretical frontier to a strategic resource that forward-looking organizations should keep firmly on their radars.


machine learning
with QuEra

Listen to the podcast
No items found.
You can use the keyboard arrows to navigate between the component buttons
",e=e.removeChild(e.firstChild)):"string"==typeof o.is?e=l.createElement(a,{is:o.is}):(e=l.createElement(a),"select"===a&&(l=e,o.multiple?l.multiple=!0:o.size&&(l.size=o.size))):e=l.createElementNS(e,a),e[Ni]=t,e[Pi]=o,Pl(e,t,!1,!1),t.stateNode=e,l=Ae(a,o),a){case"iframe":case"object":case"embed":Te("load",e),u=o;break;case"video":case"audio":for(u=0;u<$a.length;u++)Te($a[u],e);u=o;break;case"source":Te("error",e),u=o;break;case"img":case"image":case"link":Te("error",e),Te("load",e),u=o;break;case"form":Te("reset",e),Te("submit",e),u=o;break;case"details":Te("toggle",e),u=o;break;case"input":A(e,o),u=M(e,o),Te("invalid",e),Ie(n,"onChange");break;case"option":u=B(e,o);break;case"select":e._wrapperState={wasMultiple:!!o.multiple},u=Uo({},o,{value:void 0}),Te("invalid",e),Ie(n,"onChange");break;case"textarea":V(e,o),u=H(e,o),Te("invalid",e),Ie(n,"onChange");break;default:u=o}Me(a,u);var s=u;for(i in s)if(s.hasOwnProperty(i)){var c=s[i];"style"===i?ze(e,c):"dangerouslySetInnerHTML"===i?(c=c?c.__html:void 0,null!=c&&Aa(e,c)):"children"===i?"string"==typeof c?("textarea"!==a||""!==c)&&X(e,c):"number"==typeof c&&X(e,""+c):"suppressContentEditableWarning"!==i&&"suppressHydrationWarning"!==i&&"autoFocus"!==i&&(ea.hasOwnProperty(i)?null!=c&&Ie(n,i):null!=c&&x(e,i,c,l))}switch(a){case"input":L(e),j(e,o,!1);break;case"textarea":L(e),$(e);break;case"option":null!=o.value&&e.setAttribute("value",""+P(o.value));break;case"select":e.multiple=!!o.multiple,n=o.value,null!=n?q(e,!!o.multiple,n,!1):null!=o.defaultValue&&q(e,!!o.multiple,o.defaultValue,!0);break;default:"function"==typeof u.onClick&&(e.onclick=Fe)}Ve(a,o)&&(t.effectTag|=4)}null!==t.ref&&(t.effectTag|=128)}return null;case 6:if(e&&null!=t.stateNode)Ll(e,t,e.memoizedProps,o);else{if("string"!=typeof o&&null===t.stateNode)throw Error(r(166));n=yn(yu.current),yn(bu.current),Jn(t)?(n=t.stateNode,o=t.memoizedProps,n[Ni]=t,n.nodeValue!==o&&(t.effectTag|=4)):(n=(9===n.nodeType?n:n.ownerDocument).createTextNode(o),n[Ni]=t,t.stateNode=n)}return null;case 13:return zt(vu),o=t.memoizedState,0!==(64&t.effectTag)?(t.expirationTime=n,t):(n=null!==o,o=!1,null===e?void 0!==t.memoizedProps.fallback&&Jn(t):(a=e.memoizedState,o=null!==a,n||null===a||(a=e.child.sibling,null!==a&&(i=t.firstEffect,null!==i?(t.firstEffect=a,a.nextEffect=i):(t.firstEffect=t.lastEffect=a,a.nextEffect=null),a.effectTag=8))),n&&!o&&0!==(2&t.mode)&&(null===e&&!0!==t.memoizedProps.unstable_avoidThisFallback||0!==(1&vu.current)?rs===Qu&&(rs=Yu):(rs!==Qu&&rs!==Yu||(rs=Gu),0!==us&&null!==es&&(To(es,ns),Co(es,us)))),(n||o)&&(t.effectTag|=4),null);case 4:return wn(),Ol(t),null;case 10:return Zt(t),null;case 17:return It(t.type)&&Ft(),null;case 19:if(zt(vu),o=t.memoizedState,null===o)return null;if(a=0!==(64&t.effectTag),i=o.rendering,null===i){if(a)mr(o,!1);else if(rs!==Qu||null!==e&&0!==(64&e.effectTag))for(i=t.child;null!==i;){if(e=_n(i),null!==e){for(t.effectTag|=64,mr(o,!1),a=e.updateQueue,null!==a&&(t.updateQueue=a,t.effectTag|=4),null===o.lastEffect&&(t.firstEffect=null),t.lastEffect=o.lastEffect,o=t.child;null!==o;)a=o,i=n,a.effectTag&=2,a.nextEffect=null,a.firstEffect=null,a.lastEffect=null,e=a.alternate,null===e?(a.childExpirationTime=0,a.expirationTime=i,a.child=null,a.memoizedProps=null,a.memoizedState=null,a.updateQueue=null,a.dependencies=null):(a.childExpirationTime=e.childExpirationTime,a.expirationTime=e.expirationTime,a.child=e.child,a.memoizedProps=e.memoizedProps,a.memoizedState=e.memoizedState,a.updateQueue=e.updateQueue,i=e.dependencies,a.dependencies=null===i?null:{expirationTime:i.expirationTime,firstContext:i.firstContext,responders:i.responders}),o=o.sibling;return Mt(vu,1&vu.current|2),t.child}i=i.sibling}}else{if(!a)if(e=_n(i),null!==e){if(t.effectTag|=64,a=!0,n=e.updateQueue,null!==n&&(t.updateQueue=n,t.effectTag|=4),mr(o,!0),null===o.tail&&"hidden"===o.tailMode&&!i.alternate)return t=t.lastEffect=o.lastEffect,null!==t&&(t.nextEffect=null),null}else 2*ru()-o.renderingStartTime>o.tailExpiration&&1t)&&vs.set(e,t)))}}function Ur(e,t){e.expirationTimee?n:e,2>=e&&t!==e?0:e}function qr(e){if(0!==e.lastExpiredTime)e.callbackExpirationTime=1073741823,e.callbackPriority=99,e.callbackNode=$t(Vr.bind(null,e));else{var t=Br(e),n=e.callbackNode;if(0===t)null!==n&&(e.callbackNode=null,e.callbackExpirationTime=0,e.callbackPriority=90);else{var r=Fr();if(1073741823===t?r=99:1===t||2===t?r=95:(r=10*(1073741821-t)-10*(1073741821-r),r=0>=r?99:250>=r?98:5250>=r?97:95),null!==n){var o=e.callbackPriority;if(e.callbackExpirationTime===t&&o>=r)return;n!==Yl&&Bl(n)}e.callbackExpirationTime=t,e.callbackPriority=r,t=1073741823===t?$t(Vr.bind(null,e)):Wt(r,Hr.bind(null,e),{timeout:10*(1073741821-t)-ru()}),e.callbackNode=t}}}function Hr(e,t){if(ks=0,t)return t=Fr(),No(e,t),qr(e),null;var n=Br(e);if(0!==n){if(t=e.callbackNode,(Ju&(Wu|$u))!==Hu)throw Error(r(327));if(lo(),e===es&&n===ns||Kr(e,n),null!==ts){var o=Ju;Ju|=Wu;for(var a=Yr();;)try{eo();break}catch(t){Xr(e,t)}if(Gt(),Ju=o,Bu.current=a,rs===Ku)throw t=os,Kr(e,n),To(e,n),qr(e),t;if(null===ts)switch(a=e.finishedWork=e.current.alternate,e.finishedExpirationTime=n,o=rs,es=null,o){case Qu:case Ku:throw Error(r(345));case Xu:No(e,2=n){e.lastPingedTime=n,Kr(e,n);break}}if(i=Br(e),0!==i&&i!==n)break;if(0!==o&&o!==n){e.lastPingedTime=o;break}e.timeoutHandle=Si(oo.bind(null,e),a);break}oo(e);break;case Gu:if(To(e,n),o=e.lastSuspendedTime,n===o&&(e.nextKnownPendingLevel=ro(a)),ss&&(a=e.lastPingedTime,0===a||a>=n)){e.lastPingedTime=n,Kr(e,n);break}if(a=Br(e),0!==a&&a!==n)break;if(0!==o&&o!==n){e.lastPingedTime=o;break}if(1073741823!==is?o=10*(1073741821-is)-ru():1073741823===as?o=0:(o=10*(1073741821-as)-5e3,a=ru(),n=10*(1073741821-n)-a,o=a-o,0>o&&(o=0),o=(120>o?120:480>o?480:1080>o?1080:1920>o?1920:3e3>o?3e3:4320>o?4320:1960*Uu(o/1960))-o,n=o?o=0:(a=0|l.busyDelayMs,i=ru()-(10*(1073741821-i)-(0|l.timeoutMs||5e3)),o=i<=a?0:a+o-i),10 component higher in the tree to provide a loading indicator or placeholder to display."+N(i))}rs!==Zu&&(rs=Xu),l=yr(l,i),f=a;do{switch(f.tag){case 3:u=l,f.effectTag|=4096,f.expirationTime=t;var w=Ar(f,u,t);ln(f,w); break e;case 1:u=l;var E=f.type,k=f.stateNode;if(0===(64&f.effectTag)&&("function"==typeof E.getDerivedStateFromError||null!==k&&"function"==typeof k.componentDidCatch&&(null===ms||!ms.has(k)))){f.effectTag|=4096,f.expirationTime=t;var _=Ir(f,u,t);ln(f,_);break e}}f=f.return}while(null!==f)}ts=no(ts)}catch(e){t=e;continue}break}}function Yr(){var e=Bu.current;return Bu.current=Cu,null===e?Cu:e}function Gr(e,t){eus&&(us=e)}function Jr(){for(;null!==ts;)ts=to(ts)}function eo(){for(;null!==ts&&!Gl();)ts=to(ts)}function to(e){var t=Fu(e.alternate,e,ns);return e.memoizedProps=e.pendingProps,null===t&&(t=no(e)),qu.current=null,t}function no(e){ts=e;do{var t=ts.alternate;if(e=ts.return,0===(2048&ts.effectTag)){if(t=br(t,ts,ns),1===ns||1!==ts.childExpirationTime){for(var n=0,r=ts.child;null!==r;){var o=r.expirationTime,a=r.childExpirationTime;o>n&&(n=o),a>n&&(n=a),r=r.sibling}ts.childExpirationTime=n}if(null!==t)return t;null!==e&&0===(2048&e.effectTag)&&(null===e.firstEffect&&(e.firstEffect=ts.firstEffect),null!==ts.lastEffect&&(null!==e.lastEffect&&(e.lastEffect.nextEffect=ts.firstEffect),e.lastEffect=ts.lastEffect),1e?t:e}function oo(e){var t=qt();return Vt(99,ao.bind(null,e,t)),null}function ao(e,t){do lo();while(null!==gs);if((Ju&(Wu|$u))!==Hu)throw Error(r(327));var n=e.finishedWork,o=e.finishedExpirationTime;if(null===n)return null;if(e.finishedWork=null,e.finishedExpirationTime=0,n===e.current)throw Error(r(177));e.callbackNode=null,e.callbackExpirationTime=0,e.callbackPriority=90,e.nextKnownPendingLevel=0;var a=ro(n);if(e.firstPendingTime=a,o<=e.lastSuspendedTime?e.firstSuspendedTime=e.lastSuspendedTime=e.nextKnownPendingLevel=0:o<=e.firstSuspendedTime&&(e.firstSuspendedTime=o-1),o<=e.lastPingedTime&&(e.lastPingedTime=0),o<=e.lastExpiredTime&&(e.lastExpiredTime=0),e===es&&(ts=es=null,ns=0),1u&&(c=u,u=l,l=c),c=Ue(w,l),f=Ue(w,u),c&&f&&(1!==k.rangeCount||k.anchorNode!==c.node||k.anchorOffset!==c.offset||k.focusNode!==f.node||k.focusOffset!==f.offset)&&(E=E.createRange(),E.setStart(c.node,c.offset),k.removeAllRanges(),l>u?(k.addRange(E),k.extend(f.node,f.offset)):(E.setEnd(f.node,f.offset),k.addRange(E)))))),E=[];for(k=w;k=k.parentNode;)1===k.nodeType&&E.push({element:k,left:k.scrollLeft,top:k.scrollTop});for("function"==typeof w.focus&&w.focus(),w=0;w=t&&e<=t}function To(e,t){var n=e.firstSuspendedTime,r=e.lastSuspendedTime;nt||0===n)&&(e.lastSuspendedTime=t),t<=e.lastPingedTime&&(e.lastPingedTime=0),t<=e.lastExpiredTime&&(e.lastExpiredTime=0)}function Co(e,t){t>e.firstPendingTime&&(e.firstPendingTime=t);var n=e.firstSuspendedTime;0!==n&&(t>=n?e.firstSuspendedTime=e.lastSuspendedTime=e.nextKnownPendingLevel=0:t>=e.lastSuspendedTime&&(e.lastSuspendedTime=t+1),t>e.nextKnownPendingLevel&&(e.nextKnownPendingLevel=t))}function No(e,t){var n=e.lastExpiredTime;(0===n||n>t)&&(e.lastExpiredTime=t)}function Po(e,t,n,o){var a=t.current,i=Fr(),l=su.suspense;i=jr(i,a,l);e:if(n){n=n._reactInternalFiber;t:{if(J(n)!==n||1!==n.tag)throw Error(r(170));var u=n;do{switch(u.tag){case 3:u=u.stateNode.context;break t;case 1:if(It(u.type)){u=u.stateNode.__reactInternalMemoizedMergedChildContext;break t}}u=u.return}while(null!==u);throw Error(r(171))}if(1===n.tag){var s=n.type;if(It(s)){n=Dt(n,s,u);break e}}n=u}else n=Al;return null===t.context?t.context=n:t.pendingContext=n,t=on(i,l),t.payload={element:e},o=void 0===o?null:o,null!==o&&(t.callback=o),an(a,t),Dr(a,i),i}function Oo(e){if(e=e.current,!e.child)return null;switch(e.child.tag){case 5:return e.child.stateNode;default:return e.child.stateNode}}function Ro(e,t){e=e.memoizedState,null!==e&&null!==e.dehydrated&&e.retryTime