Michael Cubeddu
Research Subjects
Michael Cubeddu has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Michelle Chalupnik
Raytheon BBN Technologies 02138 Cambridge MA USA
2 shared publications - Abdella Battou
National Institute of Standards and Technology
1 shared publication - Amar Abane
National Institute of Standards and Technology, Gaithersburg, MD, USA
1 shared publication - Brian Doolittle
Aliro Technologies, Inc., Brighton, MA, USA
1 shared publication Cara Alexander
Aliro Technologies, Inc., Brighton, MA, USA
1 shared publicationDaniel Sanchez-Rosales
Aliro Technologies, Inc., Brighton, MA, USA
1 shared publication
Latest Publications
- Open Access
- 9 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 7, 1-10
Realistic Quantum Network Simulation for Experimental BBM92 Key Distribution
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.
- 9 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 7, 1-10
Open AccessRealistic Quantum Network Simulation for Experimental BBM92 Key Distribution
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 PapersOpen Access
- 1 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 6, 1-39
Entanglement Routing in Quantum Networks: A Comprehensive Survey
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.
- 1 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 6, 1-39
Top Cited PapersOpen AccessEntanglement Routing in Quantum Networks: A Comprehensive Survey
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
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 19-24
Scheduling Compact Error Correcting Codes in Entanglement Distribution Networks
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 19-24
Open AccessScheduling Compact Error Correcting Codes in Entanglement Distribution Networks
- Open Access
Qubit Allocation for Noisy Intermediate-Scale Quantum Computers
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.
Open AccessQubit Allocation for Noisy Intermediate-Scale Quantum Computers
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.