MCMichael Cubeddu

Michael Cubeddu

*This is an algorithmically generated author record based on publicly available information.

Michael Cubeddu has a total of 20 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Realistic Quantum Network Simulation for Experimental BBM92 Key Distribution

    by Michelle Chalupnik, Brian Doolittle, Suparna Seshadri, Eric G. Brown, Keith Kenemer, Daniel Winton, Daniel Sanchez-Rosales, Matthew Skrzypczyk, Cara Alexander, Eric Ostby, et al.

    Quantum key distribution (QKD) can provide secure key material between two parties without relying on assumptions about the computational power of an eavesdropper. QKD is performed over quantum links and quantum networks, systems which are resource-intensive to deploy and maintain. To evaluate and optimize performance prior to, during, and after deployment, accurate simulations with attention to physical realism are necessary. Quantum network simulators can simulate a variety of quantum and classical protocols and can assist in quantum network design and optimization by offering realism and flexibility beyond mathematical models which rely on simplifying assumptions and can be intractable to solve as network complexity increases. We use a versatile discrete event quantum network simulator to simulate the entanglement-based QKD protocol BBM92 and compare it to our experimental implementation and to existing theory. We find the discrete event quantum network simulator can match experimental key rates and error rates with a lower mean squared error than analytical theory. Furthermore, we simulate secure key rates in a repeater key distribution scenario for which no experimental implementations exist and find agreement between simulation and analytical theory. Hence, we demonstrate discrete event simulators can meet needs in quantum network simulations which cannot be filled solely by experiment or theory: discrete event simulators can accurately simulate QKD protocols and match experiments in regimes where theoretical models may require more simplifying assumptions, and they can match theoretical models in the opposite scenario where experiments have not yet been performed but theoretical models exist.


  • Top Cited Papers
    Open Access

    Entanglement Routing in Quantum Networks: A Comprehensive Survey

    by Amar Abane, Michael Cubeddu, Van Sy Mai, Abdella Battou

    Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine through swapping operations to establish end-to-end entanglement between two distant nodes. Similar to traditional routing technologies, a quantum routing protocol uses network information to choose the best paths to satisfy a set of end-to-end entanglement requests. However, in addition to network state information, a quantum routing protocol must also take into account the requested entanglement fidelity, the probabilistic nature of swapping operations, and the short lifetime of entangled states. In this work, we formulate a practical entanglement routing problem and analyze and categorize the main approaches to address it, drawing comparisons to, and inspiration from, classical network routing strategies where applicable. We classify and discuss the studied quantum routing schemes into reactive, proactive, and hybrid routing.


  • Open Access

    Scheduling Compact Error Correcting Codes in Entanglement Distribution Networks

    by Keith Kenemer, Michelle Chalupnik, Michelle Fernandez, Michael Cubeddu, Eric G. Brown

  • Open Access

    Qubit Allocation for Noisy Intermediate-Scale Quantum Computers

    by Will Finigan, Michael Cubeddu, Thomas Lively, Johannes Flick, Prineha Narang

    In the era of noisy-intermediate-scale quantum computers, we expect to see quantum devices with increasing numbers of qubits emerge in the foreseeable future. To practically run quantum programs, logical qubits have to be mapped to the physical qubits by a qubit allocation algorithm. However, on present day devices, qubits differ by their error rate and connectivity. Here, we establish and demonstrate on current experimental devices a new allocation algorithm that combines the simulated annealing method with local search of the solution space using Dijkstra's algorithm. Our algorithm takes into account the weighted connectivity constraints of both the quantum hardware and the quantum program being compiled. New quantum programs will enable unprecedented developments in physics, chemistry, and materials science and our work offers an important new pathway toward optimizing compilers for quantum programs.