Carleton Coffrin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Carleton Coffrin has a total of 151 co-authors. Here are the top co-authors by number of shared publications:
- Marc Vuffray
Theoretical Division, Los Alamos National Laboratory, Los Alamos, NM, USA
9 shared publications - Andrey Y. Lokhov
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
7 shared publications - Russell Bent
Los Alamos National Laboratory Los Alamos NM USA
7 shared publications - Byron Tasseff
Los Alamos National Laboratory, Los Alamos, New Mexico 87545
6 shared publications - Andreas Bärtschi
Los Alamos National Laboratory
5 shared publications - Zachary Alexander Morrell
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
4 shared publications
Latest Publications
- Open Access
- 26 August 2026
- Published by Office of Scientific and Technical Information (OSTI)
Quantum Computing at Los Alamos [Poster]
- 26 August 2026
- Published by Office of Scientific and Technical Information (OSTI)
Open AccessQuantum Computing at Los Alamos [Poster]
- Open Access
- 3 June 2026
- Published by Office of Scientific and Technical Information (OSTI)
Potential Applications of Quantum Computing at Los Alamos National Laboratory, v0.3.0
- 3 June 2026
- Published by Office of Scientific and Technical Information (OSTI)
Open AccessPotential Applications of Quantum Computing at Los Alamos National Laboratory, v0.3.0
- 17 February 2026
- Published by Office of Scientific and Technical Information (OSTI)
Quantum Computing for Power Systems
- 17 February 2026
- Published by Office of Scientific and Technical Information (OSTI)
Quantum Computing for Power Systems
- 29 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (2) , 811-820
Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow
Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. We investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.
- 29 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (2) , 811-820
Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow
Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. We investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.
- 29 June 2025
- Published by Springer Nature
- p. 52-67
Leveraging Quantum Computing for Accelerated Classical Algorithms in Power Systems Optimization
- 29 June 2025
- Published by Springer Nature
- p. 52-67
Leveraging Quantum Computing for Accelerated Classical Algorithms in Power Systems Optimization
- Open Access
- 4 June 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (6)
Cost of emulating a small quantum annealing problem in the circuit model
Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-model quantum computers, which represent quantum programs as a sequence of quantum gates acting on a finite number of qubits. Amongst this excitement, analog quantum computation has become less prominent, with the expectation that circuit-model quantum computers will eventually be sufficient for emulating analog quantum computation and thus rendering analog quantum computation obsolete. In this work we explore the basic requirements for emulating a specific analog quantum computation in the circuit model: the preparation of a biased superposition of degenerate ground states of an Ising Hamiltonian using an adiabatic evolution. We show that the overhead of emulation is substantial even for this simple problem. This supports using analog quantum computation for solving time-dependent Hamiltonian dynamics in the short term and midterm, assuming analog errors can be made low enough and coherence times long enough to solve problems of practical interest.
- 4 June 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (6)
Open AccessCost of emulating a small quantum annealing problem in the circuit model
Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-model quantum computers, which represent quantum programs as a sequence of quantum gates acting on a finite number of qubits. Amongst this excitement, analog quantum computation has become less prominent, with the expectation that circuit-model quantum computers will eventually be sufficient for emulating analog quantum computation and thus rendering analog quantum computation obsolete. In this work we explore the basic requirements for emulating a specific analog quantum computation in the circuit model: the preparation of a biased superposition of degenerate ground states of an Ising Hamiltonian using an adiabatic evolution. We show that the overhead of emulation is substantial even for this simple problem. This supports using analog quantum computation for solving time-dependent Hamiltonian dynamics in the short term and midterm, assuming analog errors can be made low enough and coherence times long enough to solve problems of practical interest.
- Open Access
Leveraging Quantum Computing for Accelerated Classical Algorithms in Power Systems Optimization
The recent advent of commercially available quantum annealing hardware (QAH) has expanded opportunities for research into quantum annealing-based algorithms. In the domain of power systems, this advancement has driven increased interest in applying such algorithms to mixed-integer problems (MIP) like Unit Commitment (UC). UC focuses on minimizing power generator operating costs while adhering to physical system constraints. Grid operators solve UC instances daily to meet power demand and ensure safe grid operations. This work presents a novel hybrid algorithm that leverages quantum and classical computing to solve UC more efficiently. We introduce a novel Benders-cut generation technique for UC, thereby enhancing cut quality, reducing expensive quantum-classical hardware interactions, and lowering qubit requirements. Additionally, we incorporate a $k$-local neighborhood search technique as a recovery step to ensure a higher quality solution than current QAH alone can achieve. The proposed algorithm, QC4UC, is evaluated on a modified instance of the IEEE RTS-96 test system. Results from both a simulated annealer and real QAH are compared, demonstrating the effectiveness of this algorithm in reducing qubit requirements and producing near-optimal solutions on noisy QAH.
Open AccessLeveraging Quantum Computing for Accelerated Classical Algorithms in Power Systems Optimization
The recent advent of commercially available quantum annealing hardware (QAH) has expanded opportunities for research into quantum annealing-based algorithms. In the domain of power systems, this advancement has driven increased interest in applying such algorithms to mixed-integer problems (MIP) like Unit Commitment (UC). UC focuses on minimizing power generator operating costs while adhering to physical system constraints. Grid operators solve UC instances daily to meet power demand and ensure safe grid operations. This work presents a novel hybrid algorithm that leverages quantum and classical computing to solve UC more efficiently. We introduce a novel Benders-cut generation technique for UC, thereby enhancing cut quality, reducing expensive quantum-classical hardware interactions, and lowering qubit requirements. Additionally, we incorporate a $k$-local neighborhood search technique as a recovery step to ensure a higher quality solution than current QAH alone can achieve. The proposed algorithm, QC4UC, is evaluated on a modified instance of the IEEE RTS-96 test system. Results from both a simulated annealer and real QAH are compared, demonstrating the effectiveness of this algorithm in reducing qubit requirements and producing near-optimal solutions on noisy QAH.
- Top Cited Papers
- 28 October 2024
- Published by Springer Nature in Nature Reviews Physics
- Vol. 6 (12) , 718-735
Challenges and opportunities in quantum optimization
- 28 October 2024
- Published by Springer Nature in Nature Reviews Physics
- Vol. 6 (12) , 718-735
Top Cited PapersChallenges and opportunities in quantum optimization