BlueQubit

🤔 Curious about how much running large quantum circuits on BlueQubit will cost? Here are some examples to give you an idea. 👉 Run Quantum now at bluequbit.io #BlueQubit #QuantumComputing #Tech #FutureOfComputing

The BlueQubit Quantum Hackathon has officially wrapped up—and what a ride it’s been! Here’s a quick look at some highlights from our first-ever Peaked Circuits challenge 👇 🔹 2000+ total submissions from over 400 participants 🔹 1000+ executions on real quantum hardware 🔹 5 out of 6 peaked circuits successfully cracked—our hardest one remains undefeated! Only one participant managed to solve 5 of the 6 problems 📈 A huge thank you to everyone who made this event possible — our incredible hackathon partners IBM, IonQ, Q-CTRL, Quantinuum, Rigetti Computing, Xanadu, the Yale University team for hosting the in-person component, and of course, all of our brilliant participants 🤝 This is just the beginning for Peaked Circuits. Next time, we’re pushing further—toward quantum advantage ⚛️ Get ready for challenges that can only be solved on actual quantum computers!

BlueQubit Quantum Hackathon concluded with some amazing results! Here are some stats from our first Peaked Circuits hackathon 👇 🔵 2000+ submissions from 400+ participants 🔵 1000+ runs on Quantum Computers 🔵 5/6 Peaked circuits cracked - our toughest peaked circuit still stands! Only one person was able to solve 5 out of 6 problems and below you can see the overall distribution of participants and solved problems 📈 We want to thank everyone who took part in this amazing event - our hackathon partners, the Yale University team who organized the in-person part of the event and of course the hundreds of participants 🤝 Peaked circuits will be back soon - and next time we will be going for quantum advantage ⚛️ We will have circuits that can only be cracked with actual quantum hardware!

Big congrats to IonQ on teaming up with Intellian Technologies! 🚀 This MoU marks a huge step toward transforming satellite communication with secure quantum networking. Waiting for the future of space-based quantum tech! 🌐🔐

🚀 Join the #LetsPulse414 Challenge by Pasqal! 🎉 Create your own antiferromagnetic state in Pulser Studio and dive into quantum simulation! It's simple and perfect for anyone curious about quantum materials. 🏆 Prize: 1 hour of QPU time ($300 value) and expert support for your simulation on the Pasqal Quantum Processor. 👉 Explore | Design | Share

BlueQubit Quantum Hackathon concluded with some amazing results! Here are some stats from our first Peaked Circuits hackathon 👇 🔵 2000+ submissions from 400+ participants 🔵 1000+ runs on Quantum Computers 🔵 5/6 Peaked circuits cracked - our toughest peaked circuit still stands! Only one person was able to solve 5 out of 6 problems and below you can see the overall distribution of participants and solved problems 📈 We want to thank everyone who took part in this amazing event - our hackathon partners, the Yale University team who organized the in-person part of the event and of course the hundreds of participants 🤝 Peaked circuits will be back soon - and next time we will be going for quantum advantage ⚛️ We will have circuits that can only be cracked with actual quantum hardware!

🎉 Congratulations to PsiQuantum on this incredible milestone! 🎉 Securing a $10.8 million contract with the Air Force Research Laboratory is a significant step forward in advancing quantum technology for critical defense applications. Excited to see the impact your work will have on the future of quantum computing! 🚀🔬

Last weekend part of our team participated in the BlueQubit hackathon, where the challenge was to find the peak bitstring on 6 different quantum circuits, ranging from a toy 4 qubit problem to a large 62x218 circuit. This was an open competition between classical methods (including AI) and quantum approaches to extract circuit-encoded bitstrings. The problem of peaked circuit calculation that the hackathon was designed to test, is an example of a problem that is non-trivial to solve classically, but where the answers are known, and so makes a good test for quantum advantage. To prove quantum advantage beyond any doubts, we must either be able to verify the answer given by the quantum computer (as we can here with peaked circuits), or build robust trust in each step of the algorithmic pathway. For more background on peaked circuits, and how they may be used as a verifiable approach to quantum advantage, I suggest reading Scott Aaranson’s paper here: https://lnkd.in/ehAUc_8g. The IBM team tried three approaches to solving the peaked circuits challenge: - IBM Quantum hardware execution: Petar Jurcevic solved the first 3 problems which was the best of any quantum hardware tested. - Tensor network methods: Kevin C. Smith and Haimeng Zhang secured 2nd and 6th place, solving 4 of 6 problems - The winning strategy came from David Kremer, influenced by machine learning inspiration, combining high-error tensor network simulation with bitstring distillation to solve 5 problems in just 3 hours, taking 1st place! While classical methods won this round, we're approaching the scale where they may no longer be viable, leaving quantum as the only option. I look forward to a future where we have peaked circuits hidden by a 3rd party and see the best of classical competing against the best of quantum. Congrats to BlueQubit for this initiative and to the team for their outstanding achievements. We are excited to be part of this effort to achieve quantum advantage together with our community!

🚀 Tile Codes: High-Efficiency Quantum Codes on a Lattice with Boundary 🧩 🔍 Key Insights: 1️⃣ Simplified Construction: Tile codes are built on a planar 2D lattice with open boundary conditions, offering greater flexibility. 2️⃣ Outstanding Performance: - [[288, 8, 12]] and [[288, 8, 14]] codes using weight-6 and weight-8 stabilizers outperform previous constructions. - [[512, 18, 19]] code using weight-8 stabilizers beats the rotated surface code by 12x. 3️⃣ Versatile Design: Accommodates various boundary conditions and stabilizer configurations, making it a flexible tool for code design. 📊 Figure 1: Visualizes [[288, 8, 12]] tile code with stabilizer tiles on a lattice, showing both X-type and Z-type stabilizer tiles and their overlap. 📖 Read more: https://lnkd.in/dFUjnQMR #QubitScript #QuantumComputing #QuantumErrorCorrection #TileCodes #SurfaceCode #QEC

🚀 Group Order is in QCMA 🚀 This paper proves that verifying the order of a finite group, when given as a black box, is in the QCMA complexity class. This answers an open problem from Watrous (2000) and proves that the Group Non-Membership problem is also in QCMA. 🔍 Key Insights: - Solves an open problem in quantum complexity. - Proves that Group Non-Membership is in QCMA. - Improves quantum upper bounds for group-theoretical problems like group isomorphism in black-box groups. 📖 Dive into the full paper: https://lnkd.in/d5eMYYbH #QubitScript #QuantumComputing #QCMA #QuantumComplexity #GroupTheory