          Agree & Join LinkedIn
        
  By clicking Continue to join or sign in, you agree to LinkedIn’s User Agreement, Privacy Policy, and Cookie Policy.
🚀 Our paper has been accepted at the 19th IEEE International Conference on Software Testing, Verification and Validation (ICST 2026).

📄 𝘛𝘰𝘸𝘢𝘳𝘥 𝘓𝘪𝘷𝘦 𝘕𝘰𝘪𝘴𝘦 𝘍𝘪𝘯𝘨𝘦𝘳𝘱𝘳𝘪𝘯𝘵𝘪𝘯𝘨 𝘧𝘰𝘳 𝘋𝘪𝘴𝘤𝘳𝘦𝘱𝘢𝘯𝘤𝘺 𝘈𝘯𝘢𝘭𝘺𝘴𝘪𝘴 𝘪𝘯 𝘘𝘶𝘢𝘯𝘵𝘶𝘮 𝘚𝘰𝘧𝘵𝘸𝘢𝘳𝘦 𝘌𝘯𝘨𝘪𝘯𝘦𝘦𝘳𝘪𝘯𝘨 🔗 https://lnkd.in/ehw2Mskw

Noise remains a fundamental obstacle to reliable quantum software — yet current models are often static, coarse, and misaligned with real system behaviour.

In this work, we introduce 𝒍𝒊𝒗𝒆 𝒏𝒐𝒊𝒔𝒆 𝒇𝒊𝒏𝒈𝒆𝒓𝒑𝒓𝒊𝒏𝒕𝒊𝒏𝒈, a lightweight and empirical approach to characterising noisy quantum systems.

Our key idea: → leverage 𝒄𝒍𝒂𝒔𝒔𝒊𝒄𝒂𝒍 𝒔𝒉𝒂𝒅𝒐𝒘 𝒕𝒆𝒄𝒉𝒏𝒊𝒒𝒖𝒆𝒔 to build compact, updatable fingerprints of noise → enable efficient comparison of quantum states and platforms (e.g., Qiskit vs Cirq) → support practical workflows for 𝒕𝒆𝒔𝒕𝒊𝒏𝒈, 𝒅𝒆𝒃𝒖𝒈𝒈𝒊𝒏𝒈, and 𝒄𝒓𝒐𝒔𝒔-𝒑𝒍𝒂𝒕𝒇𝒐𝒓𝒎 𝒗𝒂𝒍𝒊𝒅𝒂𝒕𝒊𝒐𝒏

We implement this vision in SIMSHADOW, showing that fingerprints: • capture structured, interpretable noise patterns • reveal systematic cross-platform discrepancies • correlate with observable divergences in program outputs

More broadly, this work bridges 𝒒𝒖𝒂𝒏𝒕𝒖𝒎 𝒊𝒏𝒇𝒐𝒓𝒎𝒂𝒕𝒊𝒐𝒏 𝒕𝒉𝒆𝒐𝒓𝒚 and 𝒔𝒐𝒇𝒕𝒘𝒂𝒓𝒆 𝒕𝒆𝒔𝒕𝒊𝒏𝒈, moving toward more reliable and portable quantum software systems.Faculty of Natural, Mathematical & Engineering SciencesCongratulations Elena, Karine, Sophie, Mohammad!Congratulations, Avner! I hope to see you in Daejeon! 😉 To view or add a comment, sign in Our latest paper was accepted for ICST short papers, vision and emerging result track! 🥳

“Towards Live Noise Fingerprinting for Discrepancy Analysis in Quantum Software Engineering”

            PhD Candidate | Hybrid Quantum–Classical Architectures | Quantum Software Testability | King’s College London
        🚀 Our paper has been accepted at the 19th IEEE International Conference on Software Testing, Verification and Validation (ICST 2026).

Noise remains a fundamental obstacle to reliable quantum software — yet current models are often static, coarse, and misaligned with real system behaviour.

More broadly, this work bridges 𝒒𝒖𝒂𝒏𝒕𝒖𝒎 𝒊𝒏𝒇𝒐𝒓𝒎𝒂𝒕𝒊𝒐𝒏 𝒕𝒉𝒆𝒐𝒓𝒚 and 𝒔𝒐𝒇𝒕𝒘𝒂𝒓𝒆 𝒕𝒆𝒔𝒕𝒊𝒏𝒈, moving toward more reliable and portable quantum software systems. To view or add a comment, sign in Exploring unit testing of quantum subroutines raises interesting challenges due to non-deterministic outcomes and the rich semantics of quantum operations. Testing in this setting involves important trade-offs between computational cost and coverage, where context plays a key role in selecting appropriate verification protocols.

https://lnkd.in/gi9PiUTY To view or add a comment, sign in After more than 15 years of working in similar fields, this week marked a first—attending a conference together. (Having it right here in Halifax helped!)

At IEEE SYSCON 2026, Adam Weissman and I both had the opportunity to present and share perspectives from our respective corners of systems engineering.

I presented “Evolving Approaches to Requirements Management in Defence Programs: Balancing As-Built Fidelity and Forward-Looking Intent in the Era of Digital Engineering”, focusing on how we adapt requirements practices in increasingly complex, model-based environments.

Adam presented “From Blueprint to Reality: A Practitioner’s Method for SysML Hardware and Software Deployment Tracking”, bringing a practical lens to bridging design intent and real-world implementation.

With participants from over 27 countries across academia, industry, and government, it was inspiring to see where systems engineering is heading—and to learn from the breadth of perspectives shaping its future.

    To view or add a comment, sign in
What is the best quantum SDK?

Different quantum Software Development Kits are built with very different priorities: some are education-first, some are hardware-first, some are machine-learning-first, and some are just research playgrounds.

If you want to cut through the noise, the most used options break down like this:

Table taken from this practical guide: https://lnkd.in/epVfNE-r To view or add a comment, sign in

New Post: Efficient Parallel Proof Assembly for zk‑Rollup: Adaptive Circuit Pruning and Transaction Batching to Minimise Generation Latency and Gas Costs - Abstract Zero‑knowledge rollups (zk‑Rollups) transfer the bulk of transaction validation off‑chain while preserving succinct proofs on the main chain, yet the time to generate a valid zk‑SNARK can become a bottleneck for high‑throughput applications. We propose a practical framework that jointly optimises circuit design and transaction aggregation. Our contributions are: (1) a lightweight active‑resizing routine […]

[Source & Legal Disclaimer] This is an AI-generated simulation research dataset provided by Freederia.com, released under the Apache 2.0 License. Users may freely modify and commercially use this data (including patenting novel improvements); however, obtaining exclusive patent rights on the original raw data itself is prohibited. As this is AI-simulated data, users are strictly responsible for independently verifying existing copyrights and patents before use. The provider assumes no legal liability. For future Enterprise API access and bulk dataset purchase inquiries, please contact Freederia.com. To view or add a comment, sign in

New Post: Hybrid Classical‑Quantum Scheduling for Quantum Volume Benchmarking in Trapped‑Ion Qubit Architectures - Abstract Simulated results indicate that our hybrid classical‑quantum workflow jointly optimizes gate scheduling and employs error‑mitigation techniques tailored to trapped‑ion architectures, maximizing the logical depth attainable within the error budget. Using the IonQ H‑bucket trapped‑ion platform, we performed extensive classical simulations of 7‑qubit random Clifford circuits, exploring schedules that minimize simultaneous multi‑qubit operations while respecting […]

New Post: Frequency‑Selective Ancilla‑Assisted Measurement‑Based Quantum Error Mitigation for Surface Code Architectures - Abstract (212 words) Reliable quantum computation hinges on the suppression of decoherence and operational noise. Surface code architectures offer high thresholds but still suffer from measurement‑induced error propagation, especially in large‑scale fault‑tolerant processors. We propose a measurement‑based quantum error mitigation scheme that employs frequency‑selective ancilla qubits to isolate and correct probabilistic leakage and dephasing errors […]

The letter presents a dipole flux transport (DFT) model, which simulates the evolution of the solar dipole vector under the dynamics of the classic surface flux transport (SFT) model.

The trick is that the dynamics of the SFT model are captured with a precomputed propagation matrices that allows speedups of up to four orders of magnitude compared to SFT calculations.

Just as an example, with DFT, I can simulate the four-year time evolution of 10,000 active regions in less than 30 seconds with my basic laptop from 2019. This speedup makes the calculations from my previous paper, which were done with the computing cluster at CSC, computationally trivial.

As the magnitude of the solar dipole vector closely matches the open solar flux from the most commonly used PFSS model, the DFT can be used to study the development of the open flux extremely efficiently in various scenarios, for example, with probabilistic ensemble methods.

I have shared my DFT code together with precomputed propagation matrices on GitHub. I am not a software developer, so the code is not pretty, but I intend to keep the repository updated as I am now using DFT exclusively for my dipole calculations.

In the spirit of one of the great scientific virtues, laziness, the idea of DFT was born when I got tired of sending endless SFT runs to the computing cluster and then waiting in the queue. To view or add a comment, sign in

New Post: Adaptive Resource‑Efficient Scheduling for 15‑to‑1 T‑State Distillation on Surface‑Code Architectures - Abstract (235 words) Magic‑state distillation remains the dominant bottleneck for implementing non‑Clifford gates in fault‑tolerant quantum computers, particularly on surface‑code hardware where qubit overhead and execution latency directly impact logical‑error rate and throughput. We introduce an adaptive scheduling framework that maps the 15‑to‑1 Bravyi–Kitaev T‑state distillation protocol onto a fixed square logical‑qubit lattice while dynamically […]

New Post: Geometric Phase‑Only Quantum Gate Design for Fault‑Tolerant Surface Code Architectures - Advances in Quantum Information, 2025, Vol. 12, No. 4 — ### Abstract Fault‑tolerant quantum computing with surface codes requires a repertoire of logical gates that preserve computational integrity under realistic noise models. Conventional implementations of non‑Clifford gates rely on costly magic‑state distillation, whereas geometric phase gates offer a pathway to deterministic, hardware‑efficient operations. Here we present a […]

        973 followers
      
                  Create your free account or sign in to continue your search
                
                  or
                
                New to LinkedIn? Join now
              
  By clicking Continue to join or sign in, you agree to LinkedIn’s User Agreement, Privacy Policy, and Cookie Policy.