Back to News
quantum-computing

How can I know how much time the quantum computer can run the parallelism for 65.535 states? Using Composer (IBM Quantum Plataform)

Matheus Gabriel Da Silva
Loading...
3 min read
0 likes
⚡ Quantum Brief
A developer compared classical and quantum performance by implementing a 16-bit LFSR circuit (65,535 states) using a primitive polynomial, with classical execution taking 647 microseconds on an Intel i5 processor. The quantum version leverages superposition to evaluate all 65,535 states simultaneously, but measuring collapses the system, raising questions about parallelism duration before decoherence or operational limits on IBM’s quantum hardware. The core challenge is determining how long a quantum computer can maintain parallel state evaluation without measurement, with estimates suggesting nanosecond-scale coherence times for such circuits. Using IBM Quantum Composer, the developer seeks to benchmark initialization-to-parallelism duration for the LFSR circuit, though platform-specific constraints like gate times and qubit coherence remain unaddressed. The query highlights a key quantum-classical gap: while classical systems process states sequentially, quantum parallelism’s temporal efficiency depends on hardware stability, not just algorithmic design.
AI Audio Summary
0:00 / 0:00
Click to play
dcbb6659-0daf-4a2e-923f-3b6f2f91cf21.jpeg
Quantum News · Media Library

Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers. Stack Overflow for Teams is now called Stack Internal. Bring the best of human thought and AI automation together at your work. Bring the best of human thought and AI automation together at your work. Learn more Stack InternalKnowledge at workBring the best of human thought and AI automation together at your work.I faced the challenge of comparing the performance of my classical computer with that of a quantum computer.First of all, the challenge is to execute an LFSR circuit in both bases (classical and computer). The LFSR circuit is a circuit for pseudorandom numbers, using a certain type of configuration (Fibonacci or Galois) and a primitive equation to determine how long is the period of the ramdom numbers.I asked ChatGPT to generate an assembly code for a LFSR circuit Galois for the primitive equation: x^16 + x^14 + x^13 +x^11 + 1. This equation results a total of 65.536 states, however, the state 0 is prohibited. So, 65.535 possible states.I ran the code generated im my CPU and i got as result that my Intel i5 11th Gen took 647 us to execute just 1 period of this LFSR. So, 647 us to go through for the 65.535 possibilities from the seed 0xA101.For this, everything fine. I know that I cann't do this sequencial circuit on Quantum computer because in the first colapse (a string classical bits representing a number) my system is destroyed. But, in the moment I iniciallize my circuit, the parallelism occurs and if I don't measure, the system will be in the parallelism until someone measure. I need this. I need the time (how much time) the quantum computer takes from iniciallize my LFSR circuit and make the parallelism. I suppose it will be approx. ns, idk.How can I do it the IBM Quantum Plataform Composer (https://quantum.cloud.ibm.com/composer?initial=N4IgjghgzgtiBcIDyAFAogOQIoEEDKAsgAQBMAdAAwDcAOgHYCWdAxgDYCuAJgKZE3jdWDAEYBGMk2b9ademABO3AOZEwAbQAsAXRnNFK5pp316IADQg6EGNwQgAqnQAuDJ626cizBvObtXIAC%2BQA)In attached, I tried to draw this "quantum" LFSR with the seed 0xA101 proposedThanks for contributing an answer to Quantum Computing Stack Exchange!But avoid …Use MathJax to format equations. MathJax reference.To learn more, see our tips on writing great answers.Required, but never shown By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy. Start asking to get answersFind the answer to your question by asking.Explore related questionsSee similar questions with these tags.To subscribe to this RSS feed, copy and paste this URL into your RSS reader. Site design / logo © 2025 Stack Exchange Inc; user contributions licensed under CC BY-SA . rev 2025.11.27.37399

Read Original

Tags

quantum-computing
ibm

Source Information

Source: Quantum Computing Stack Exchange

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.