Debopriyo Biswas
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
Research Subjects
Debopriyo Biswas has a total of 62 co-authors. Here are the top co-authors by number of shared publications:
- Crystal Noel
Duke University
6 shared publications Christopher Monroe
Duke University
4 shared publicationsAndrew Risinger
Joint Quantum Institute, and Department of Physics, NIST/University of Maryland, College Park, USA
3 shared publications- Andrew Risinger
Joint Quantum Institute
3 shared publications Bahaa Harraz
Duke University
3 shared publications- Daiwei Zhu
Joint Quantum Institute and Department of Physics, University of Maryland, College Park, Maryland 20742, USA
3 shared publications
Latest Publications
- Open Access
- 31 December 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (4)
In situ midcircuit qubit measurement and reset in a single-species trapped-ion quantum computing system
We implement midcircuit measurement and reset (MCMR) operations on a full-scale trapped-ion quantum computing system by using metastable qubit states in Yb + 171 ions. We compare two methods for isolating data qubits from measured qubits: one shelves the data qubits into the metastable state and the other drives the measured qubit to the metastable state without disturbing the other qubits. We experimentally demonstrate both methods on a crystal of two Yb + 171 ions using both the S 1 / 2 ground-state hyperfine clock qubit and the S 1 / 2 − D 3 / 2 optical qubit. These MCMR methods result in errors on the data qubit of about 2 % without degrading the measurement fidelity. With straightforward reductions in laser noise, these errors can be suppressed to less than 0.1 % . The demonstrated methods allow MCMR to be performed in a single-species ion chain without shuttling or additional qubit-addressing optics, greatly simplifying the system architecture and allowing straightforward integration with existing trapped-ion quantum computers.
- 31 December 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (4)
Open AccessIn situ midcircuit qubit measurement and reset in a single-species trapped-ion quantum computing system
We implement midcircuit measurement and reset (MCMR) operations on a full-scale trapped-ion quantum computing system by using metastable qubit states in Yb + 171 ions. We compare two methods for isolating data qubits from measured qubits: one shelves the data qubits into the metastable state and the other drives the measured qubit to the metastable state without disturbing the other qubits. We experimentally demonstrate both methods on a crystal of two Yb + 171 ions using both the S 1 / 2 ground-state hyperfine clock qubit and the S 1 / 2 − D 3 / 2 optical qubit. These MCMR methods result in errors on the data qubit of about 2 % without degrading the measurement fidelity. With straightforward reductions in laser noise, these errors can be suppressed to less than 0.1 % . The demonstrated methods allow MCMR to be performed in a single-species ion chain without shuttling or additional qubit-addressing optics, greatly simplifying the system architecture and allowing straightforward integration with existing trapped-ion quantum computers.
- Open Access
- 17 November 2023
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 9 (46) , eadh2594
Digital quantum simulation of NMR experiments
Simulations of nuclear magnetic resonance (NMR) experiments can be an important tool for extracting information about molecular structure and optimizing experimental protocols but are often intractable on classical computers for large molecules such as proteins and for protocols such as zero-field NMR. We demonstrate the first quantum simulation of an NMR spectrum, computing the zero-field spectrum of the methyl group of acetonitrile using four qubits of a trapped-ion quantum computer. We reduce the sampling cost of the quantum simulation by an order of magnitude using compressed sensing techniques. We show how the intrinsic decoherence of NMR systems may enable the zero-field simulation of classically hard molecules on relatively near-term quantum hardware and discuss how the experimentally demonstrated quantum algorithm can be used to efficiently simulate scientifically and technologically relevant solid-state NMR experiments on more mature devices. Our work opens a practical application for quantum computation.
- 17 November 2023
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 9 (46) , eadh2594
Open AccessDigital quantum simulation of NMR experiments
Simulations of nuclear magnetic resonance (NMR) experiments can be an important tool for extracting information about molecular structure and optimizing experimental protocols but are often intractable on classical computers for large molecules such as proteins and for protocols such as zero-field NMR. We demonstrate the first quantum simulation of an NMR spectrum, computing the zero-field spectrum of the methyl group of acetonitrile using four qubits of a trapped-ion quantum computer. We reduce the sampling cost of the quantum simulation by an order of magnitude using compressed sensing techniques. We show how the intrinsic decoherence of NMR systems may enable the zero-field simulation of classically hard molecules on relatively near-term quantum hardware and discuss how the experimentally demonstrated quantum algorithm can be used to efficiently simulate scientifically and technologically relevant solid-state NMR experiments on more mature devices. Our work opens a practical application for quantum computation.
- 3 August 2023
- Published by Springer Nature in Nature Physics
- Vol. 19 (11) , 1725-1731
Interactive cryptographic proofs of quantumness using mid-circuit measurements
- 3 August 2023
- Published by Springer Nature in Nature Physics
- Vol. 19 (11) , 1725-1731
Interactive cryptographic proofs of quantumness using mid-circuit measurements
- Open Access
- 4 November 2022
- Published by Springer Nature in Nature Communications
- Vol. 13 (1) , 1-6
Cross-platform comparison of arbitrary quantum states
As we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can be easily verified in some instances such as number factoring or oracular algorithms, these approaches only provide pass/fail information of executing specific tasks for a single QC. On the other hand, a comparison between different QCs preparing nominally the same arbitrary circuit provides an insight for generic validation: a quantum computation is only as valid as the agreement between the results produced on different QCs. Such an approach is also at the heart of evaluating metrological standards such as disparate atomic clocks. In this paper, we report a cross-platform QC comparison using randomized and correlated measurements that results in a wealth of information on the QC systems. We execute several quantum circuits on widely different physical QC platforms and analyze the cross-platform state fidelities.
- 4 November 2022
- Published by Springer Nature in Nature Communications
- Vol. 13 (1) , 1-6
Open AccessCross-platform comparison of arbitrary quantum states
As we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can be easily verified in some instances such as number factoring or oracular algorithms, these approaches only provide pass/fail information of executing specific tasks for a single QC. On the other hand, a comparison between different QCs preparing nominally the same arbitrary circuit provides an insight for generic validation: a quantum computation is only as valid as the agreement between the results produced on different QCs. Such an approach is also at the heart of evaluating metrological standards such as disparate atomic clocks. In this paper, we report a cross-platform QC comparison using randomized and correlated measurements that results in a wealth of information on the QC systems. We execute several quantum circuits on widely different physical QC platforms and analyze the cross-platform state fidelities.
- Open Access
Interactive Protocols for Classically-Verifiable Quantum Advantage
Achieving quantum computational advantage requires solving a classically intractable problem on a quantum device. Natural proposals rely upon the intrinsic hardness of classically simulating quantum mechanics; however, verifying the output is itself classically intractable. On the other hand, certain quantum algorithms (e.g. prime factorization via Shor's algorithm) are efficiently verifiable, but require more resources than what is available on near-term devices. One way to bridge the gap between verifiability and implementation is to use "interactions" between a prover and a verifier. By leveraging cryptographic functions, such protocols enable the classical verifier to enforce consistency in a quantum prover's responses across multiple rounds of interaction. In this work, we demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer. We execute two complementary protocols -- one based upon the learning with errors problem and another where the cryptographic construction implements a computational Bell test. To perform multiple rounds of interaction, we implement mid-circuit measurements on a subset of trapped ion qubits, with subsequent coherent evolution. For both protocols, the performance exceeds the asymptotic bound for classical behavior; maintaining this fidelity at scale would conclusively demonstrate verifiable quantum advantage.
Open AccessInteractive Protocols for Classically-Verifiable Quantum Advantage
Achieving quantum computational advantage requires solving a classically intractable problem on a quantum device. Natural proposals rely upon the intrinsic hardness of classically simulating quantum mechanics; however, verifying the output is itself classically intractable. On the other hand, certain quantum algorithms (e.g. prime factorization via Shor's algorithm) are efficiently verifiable, but require more resources than what is available on near-term devices. One way to bridge the gap between verifiability and implementation is to use "interactions" between a prover and a verifier. By leveraging cryptographic functions, such protocols enable the classical verifier to enforce consistency in a quantum prover's responses across multiple rounds of interaction. In this work, we demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer. We execute two complementary protocols -- one based upon the learning with errors problem and another where the cryptographic construction implements a computational Bell test. To perform multiple rounds of interaction, we implement mid-circuit measurements on a subset of trapped ion qubits, with subsequent coherent evolution. For both protocols, the performance exceeds the asymptotic bound for classical behavior; maintaining this fidelity at scale would conclusively demonstrate verifiable quantum advantage.
- Open Access
- 2 March 2022
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 3 (1) , 010334
Control of Transverse Motion for Quantum Gates on Individually Addressed Atomic Qubits
Individual trapped atomic qubits represent one of the most promising technologies to scale quantum computers, owing to their low idle errors and the ability to implement a full set of reconfigurable gate operations via focused optical fields. However, the fidelity of quantum gate operations can be limited by weak confinement of the atoms transverse to the laser. We present measurements of this effect by performing individually addressed entangling gates in chains of up to 25 trapped atomic ions. We present a semiclassical model that accurately describes the observed decoherence from the residual heating of the ions caused by noisy electric fields. We suppress these effects by cotrapping ancilla ions for sympathetically cooling the qubit ions throughout a quantum circuit.
- 2 March 2022
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 3 (1) , 010334
Open AccessControl of Transverse Motion for Quantum Gates on Individually Addressed Atomic Qubits
Individual trapped atomic qubits represent one of the most promising technologies to scale quantum computers, owing to their low idle errors and the ability to implement a full set of reconfigurable gate operations via focused optical fields. However, the fidelity of quantum gate operations can be limited by weak confinement of the atoms transverse to the laser. We present measurements of this effect by performing individually addressed entangling gates in chains of up to 25 trapped atomic ions. We present a semiclassical model that accurately describes the observed decoherence from the residual heating of the ions caused by noisy electric fields. We suppress these effects by cotrapping ancilla ions for sympathetically cooling the qubit ions throughout a quantum circuit.
- Top Cited Papers
- 4 October 2021
- Published by Springer Nature in Nature
- Vol. 598 (7880) , 281-286
Fault-tolerant control of an error-corrected qubit
Quantum error correction protects fragile quantum information by encoding it into a larger quantum system1,2. These extra degrees of freedom enable the detection and correction of errors, but also increase the control complexity of the encoded logical qubit. Fault-tolerant circuits contain the spread of errors while controlling the logical qubit, and are essential for realizing error suppression in practice3,4,5,6. Although fault-tolerant design works in principle, it has not previously been demonstrated in an error-corrected physical system with native noise characteristics. Here we experimentally demonstrate fault-tolerant circuits for the preparation, measurement, rotation and stabilizer measurement of a Bacon–Shor logical qubit using 13 trapped ion qubits. When we compare these fault-tolerant protocols to non-fault-tolerant protocols, we see significant reductions in the error rates of the logical primitives in the presence of noise. The result of fault-tolerant design is an average state preparation and measurement error of 0.6 per cent and a Clifford gate error of 0.3 per cent after offline error correction. In addition, we prepare magic states with fidelities that exceed the distillation threshold7, demonstrating all of the key single-qubit ingredients required for universal fault-tolerant control. These results demonstrate that fault-tolerant circuits enable highly accurate logical primitives in current quantum systems. With improved two-qubit gates and the use of intermediate measurements, a stabilized logical qubit can be achieved.
- 4 October 2021
- Published by Springer Nature in Nature
- Vol. 598 (7880) , 281-286
Top Cited PapersFault-tolerant control of an error-corrected qubit
Quantum error correction protects fragile quantum information by encoding it into a larger quantum system1,2. These extra degrees of freedom enable the detection and correction of errors, but also increase the control complexity of the encoded logical qubit. Fault-tolerant circuits contain the spread of errors while controlling the logical qubit, and are essential for realizing error suppression in practice3,4,5,6. Although fault-tolerant design works in principle, it has not previously been demonstrated in an error-corrected physical system with native noise characteristics. Here we experimentally demonstrate fault-tolerant circuits for the preparation, measurement, rotation and stabilizer measurement of a Bacon–Shor logical qubit using 13 trapped ion qubits. When we compare these fault-tolerant protocols to non-fault-tolerant protocols, we see significant reductions in the error rates of the logical primitives in the presence of noise. The result of fault-tolerant design is an average state preparation and measurement error of 0.6 per cent and a Clifford gate error of 0.3 per cent after offline error correction. In addition, we prepare magic states with fidelities that exceed the distillation threshold7, demonstrating all of the key single-qubit ingredients required for universal fault-tolerant control. These results demonstrate that fault-tolerant circuits enable highly accurate logical primitives in current quantum systems. With improved two-qubit gates and the use of intermediate measurements, a stabilized logical qubit can be achieved.
- Open Access
- 27 August 2021
- Published by Springer Nature in Research Square
Cross-Platform Comparison of Arbitrary Quantum Computations
As we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can be easily verified in some instances such as number factoring or oracular algorithms, these approaches only provide pass/fail information for a single QC. On the other hand, a comparison between different QCs on the same arbitrary circuit provides a lower-bound for generic validation: a quantum computation is only as valid as the agreement between the results produced on different QCs. Such an approach is also at the heart of evaluating metrological standards such as disparate atomic clocks. In this paper, we report a cross-platform QC comparison using randomized and correlated measurements that results in a wealth of information on the QC systems. We execute several quantum circuits on widely different physical QC platforms and analyze the cross-platform fidelities.
- 27 August 2021
- Published by Springer Nature in Research Square
Open AccessCross-Platform Comparison of Arbitrary Quantum Computations
As we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can be easily verified in some instances such as number factoring or oracular algorithms, these approaches only provide pass/fail information for a single QC. On the other hand, a comparison between different QCs on the same arbitrary circuit provides a lower-bound for generic validation: a quantum computation is only as valid as the agreement between the results produced on different QCs. Such an approach is also at the heart of evaluating metrological standards such as disparate atomic clocks. In this paper, we report a cross-platform QC comparison using randomized and correlated measurements that results in a wealth of information on the QC systems. We execute several quantum circuits on widely different physical QC platforms and analyze the cross-platform fidelities.