Nathan Earnest-Noble
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
Nathan Earnest-Noble has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- André Melo
Kavli Institute of Nanoscience Delft University of Technology P.O. Box 4056 2600 GA Delft The Netherlands
2 shared publications - Francesco Tacchino
IBM Quantum, IBM Research Zurich, 8803 Rüschlikon, Switzerland
2 shared publications - Ali Javadi-Abhari
IBM Quantum IBM T.J. Watson Research Center 10598 Yorktown Heights NY USA
1 shared publication - Andrew N. Cleland
Pritzker School of Molecular Engineering, University of Chicago, Chicago, USA
1 shared publication - Arian Vezvaee
Department of Electrical & Computer Engineering, University of Southern California, Los Angeles, USA
1 shared publication - David I. Schuster
Stanford University
1 shared publication
Latest Publications
- Open Access
Quantum simulation of Fermi-Hubbard model based on transmon qudit interaction
The Fermi-Hubbard model, a fundamental framework for studying strongly correlated phenomena could significantly benefit from quantum simulations when exploring non-trivial settings. However, simulating this problem requires twice as many qubits as the physical sites, in addition to complicated on-chip connectivities and swap gates required to simulate the physical interactions. In this work, we introduce a novel quantum simulation approach utilizing qudits to overcome such complexities. Leveraging on the symmetries of the Fermi-Hubbard model and their intrinsic relation to Clifford algebras, we first demonstrate a Qudit Fermionic Mapping (QFM) that reduces the encoding cost associated with the qubit-based approach. We then describe the unitary evolution of the mapped Hamiltonian by interpreting the resulting Majorana operators in terms of physical single- and two-qudit gates. While the QFM can be used for any quantum hardware with four accessible energy levels, we demonstrate the specific reduction in overhead resulting from utilizing the native Controlled-SUM gate (equivalent to qubit CNOT) for a fixed-frequency ququart transmon. We further transpile the resulting two transmon-qudit gates by demonstrating a qudit operator Schmidt decomposition using the Controlled-SUM gate. Finally, we demonstrate the efficacy of our proposal by numerical simulation of local observables such as the filling factor and Green's function for various Trotter steps. The compatibility of our approach with different qudit platforms paves the path for achieving quantum advantage in simulating non-trivial quantum many-body systems.
Open AccessQuantum simulation of Fermi-Hubbard model based on transmon qudit interaction
The Fermi-Hubbard model, a fundamental framework for studying strongly correlated phenomena could significantly benefit from quantum simulations when exploring non-trivial settings. However, simulating this problem requires twice as many qubits as the physical sites, in addition to complicated on-chip connectivities and swap gates required to simulate the physical interactions. In this work, we introduce a novel quantum simulation approach utilizing qudits to overcome such complexities. Leveraging on the symmetries of the Fermi-Hubbard model and their intrinsic relation to Clifford algebras, we first demonstrate a Qudit Fermionic Mapping (QFM) that reduces the encoding cost associated with the qubit-based approach. We then describe the unitary evolution of the mapped Hamiltonian by interpreting the resulting Majorana operators in terms of physical single- and two-qudit gates. While the QFM can be used for any quantum hardware with four accessible energy levels, we demonstrate the specific reduction in overhead resulting from utilizing the native Controlled-SUM gate (equivalent to qubit CNOT) for a fixed-frequency ququart transmon. We further transpile the resulting two transmon-qudit gates by demonstrating a qudit operator Schmidt decomposition using the Controlled-SUM gate. Finally, we demonstrate the efficacy of our proposal by numerical simulation of local observables such as the filling factor and Green's function for various Trotter steps. The compatibility of our approach with different qudit platforms paves the path for achieving quantum advantage in simulating non-trivial quantum many-body systems.
- Open Access
- 9 October 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 1130
Pulse-efficient quantum machine learning
Quantum machine learning algorithms based on parameterized quantum circuits are promising candidates for near-term quantum advantage. Although these algorithms are compatible with the current generation of quantum processors, device noise limits their performance, for example by inducing an exponential flattening of loss landscapes. Error suppression schemes such as dynamical decoupling and Pauli twirling alleviate this issue by reducing noise at the hardware level. A recent addition to this toolbox of techniques is pulse-efficient transpilation, which reduces circuit schedule duration by exploiting hardware-native cross-resonance interaction. In this work, we investigate the impact of pulse-efficient circuits on near-term algorithms for quantum machine learning. We report results for two standard experiments: binary classification on a synthetic dataset with quantum neural networks and handwritten digit recognition with quantum kernel estimation. In both cases, we find that pulse-efficient transpilation vastly reduces average circuit durations and, as a result, significantly improves classification accuracy. We conclude by applying pulse-efficient transpilation to the Hamiltonian Variational Ansatz and show that it delays the onset of noise-induced barren plateaus.
- 9 October 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 1130
Open AccessPulse-efficient quantum machine learning
Quantum machine learning algorithms based on parameterized quantum circuits are promising candidates for near-term quantum advantage. Although these algorithms are compatible with the current generation of quantum processors, device noise limits their performance, for example by inducing an exponential flattening of loss landscapes. Error suppression schemes such as dynamical decoupling and Pauli twirling alleviate this issue by reducing noise at the hardware level. A recent addition to this toolbox of techniques is pulse-efficient transpilation, which reduces circuit schedule duration by exploiting hardware-native cross-resonance interaction. In this work, we investigate the impact of pulse-efficient circuits on near-term algorithms for quantum machine learning. We report results for two standard experiments: binary classification on a synthetic dataset with quantum neural networks and handwritten digit recognition with quantum kernel estimation. In both cases, we find that pulse-efficient transpilation vastly reduces average circuit durations and, as a result, significantly improves classification accuracy. We conclude by applying pulse-efficient transpilation to the Hamiltonian Variational Ansatz and show that it delays the onset of noise-induced barren plateaus.
- Open Access
Pulse-efficient quantum machine learning
Quantum machine learning algorithms based on parameterized quantum circuits are promising candidates for near-term quantum advantage. Although these algorithms are compatible with the current generation of quantum processors, device noise limits their performance, for example by inducing an exponential flattening of loss landscapes. Error suppression schemes such as dynamical decoupling and Pauli twirling alleviate this issue by reducing noise at the hardware level. A recent addition to this toolbox of techniques is pulse-efficient transpilation, which reduces circuit schedule duration by exploiting hardware-native cross-resonance interaction. In this work, we investigate the impact of pulse-efficient circuits on near-term algorithms for quantum machine learning. We report results for two standard experiments: binary classification on a synthetic dataset with quantum neural networks and handwritten digit recognition with quantum kernel estimation. In both cases, we find that pulse-efficient transpilation vastly reduces average circuit durations and, as a result, significantly improves classification accuracy. We conclude by applying pulse-efficient transpilation to the Hamiltonian Variational Ansatz and show that it delays the onset of noise-induced barren plateaus.
Open AccessPulse-efficient quantum machine learning
Quantum machine learning algorithms based on parameterized quantum circuits are promising candidates for near-term quantum advantage. Although these algorithms are compatible with the current generation of quantum processors, device noise limits their performance, for example by inducing an exponential flattening of loss landscapes. Error suppression schemes such as dynamical decoupling and Pauli twirling alleviate this issue by reducing noise at the hardware level. A recent addition to this toolbox of techniques is pulse-efficient transpilation, which reduces circuit schedule duration by exploiting hardware-native cross-resonance interaction. In this work, we investigate the impact of pulse-efficient circuits on near-term algorithms for quantum machine learning. We report results for two standard experiments: binary classification on a synthetic dataset with quantum neural networks and handwritten digit recognition with quantum kernel estimation. In both cases, we find that pulse-efficient transpilation vastly reduces average circuit durations and, as a result, significantly improves classification accuracy. We conclude by applying pulse-efficient transpilation to the Hamiltonian Variational Ansatz and show that it delays the onset of noise-induced barren plateaus.
- Open Access
- 21 October 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 4 (1) , 1-27
TimeStitch: Exploiting Slack to Mitigate Decoherence in Quantum Circuits
Quantum systems have the potential to demonstrate significant computational advantage, but current quantum devices suffer from the rapid accumulation of error that prevents the storage of quantum information over extended periods. The unintentional coupling of qubits to their environment and each other adds significant noise to computation, and improved methods to combat decoherence are required to boost the performance of quantum algorithms on real machines. While many existing techniques for mitigating error rely on adding extra gates to the circuit [ 13 , 20 , 56 ], calibrating new gates [ 50 ], or extending a circuit’s runtime [ 32 ], this article’s primary contribution leverages the gates already present in a quantum program without extending circuit duration. We exploit circuit slack for single-qubit gates that occur in idle windows, scheduling the gates such that their timing can counteract some errors. Spin-echo corrections that mitigate decoherence on idling qubits act as inspiration for this work. Theoretical models, however, fail to capture all sources of noise in Noisy Intermediate Scale Quantum devices, making practical solutions necessary that better minimize the impact of unpredictable errors in quantum machines. This article presents TimeStitch: a novel framework that pinpoints the optimum execution schedules for single-qubit gates within quantum circuits. TimeStitch, implemented as a compilation pass, leverages the reversible nature of quantum computation to boost the success of circuits on real quantum machines. Unlike past approaches that apply reversibility properties to improve quantum circuit execution [ 35 ], TimeStitch amplifies fidelity without violating critical path frontiers in either the slack tuning procedures or the final rescheduled circuit. On average, compared to a state-of-the-art baseline, a practically constrained TimeStitch achieves a mean 38% relative improvement in success rates, with a maximum of 106%, while observing bounds on circuit depth. When unconstrained by depth criteria, TimeStitch produces a mean relative fidelity increase of 50% with a maximum of 256%. Finally, when TimeStitch intelligently leverages periodic dynamical decoupling within its scheduling framework, a mean 64% improvement is observed over the baseline, relatively outperforming stand-alone dynamical decoupling by 19%, with a maximum of 287%.
- 21 October 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 4 (1) , 1-27
Open AccessTimeStitch: Exploiting Slack to Mitigate Decoherence in Quantum Circuits
Quantum systems have the potential to demonstrate significant computational advantage, but current quantum devices suffer from the rapid accumulation of error that prevents the storage of quantum information over extended periods. The unintentional coupling of qubits to their environment and each other adds significant noise to computation, and improved methods to combat decoherence are required to boost the performance of quantum algorithms on real machines. While many existing techniques for mitigating error rely on adding extra gates to the circuit [ 13 , 20 , 56 ], calibrating new gates [ 50 ], or extending a circuit’s runtime [ 32 ], this article’s primary contribution leverages the gates already present in a quantum program without extending circuit duration. We exploit circuit slack for single-qubit gates that occur in idle windows, scheduling the gates such that their timing can counteract some errors. Spin-echo corrections that mitigate decoherence on idling qubits act as inspiration for this work. Theoretical models, however, fail to capture all sources of noise in Noisy Intermediate Scale Quantum devices, making practical solutions necessary that better minimize the impact of unpredictable errors in quantum machines. This article presents TimeStitch: a novel framework that pinpoints the optimum execution schedules for single-qubit gates within quantum circuits. TimeStitch, implemented as a compilation pass, leverages the reversible nature of quantum computation to boost the success of circuits on real quantum machines. Unlike past approaches that apply reversibility properties to improve quantum circuit execution [ 35 ], TimeStitch amplifies fidelity without violating critical path frontiers in either the slack tuning procedures or the final rescheduled circuit. On average, compared to a state-of-the-art baseline, a practically constrained TimeStitch achieves a mean 38% relative improvement in success rates, with a maximum of 106%, while observing bounds on circuit depth. When unconstrained by depth criteria, TimeStitch produces a mean relative fidelity increase of 50% with a maximum of 256%. Finally, when TimeStitch intelligently leverages periodic dynamical decoupling within its scheduling framework, a mean 64% improvement is observed over the baseline, relatively outperforming stand-alone dynamical decoupling by 19%, with a maximum of 287%.
- Open Access
Deterministic Bidirectional Communication and Remote Entanglement Generation Between Superconducting Quantum Processors
We propose and experimentally demonstrate a simple and efficient scheme for photonic communication between two remote superconducting modules. Each module consists of a random access quantum information processor with eight-qubit multimode memory and a single flux tunable transmon. The two processor chips are connected through a one-meter long coaxial cable that is coupled to a dedicated "communication" resonator on each chip. The two communication resonators hybridize with a mode of the cable to form a dark "communication mode" that is highly immune to decay in the coaxial cable. We modulate the transmon frequency via a parametric drive to generate sideband interactions between the transmon and the communication mode. We demonstrate bidirectional single-photon transfer with a success probability exceeding 60 %, and generate an entangled Bell pair with a fidelity of 79.3 $\pm$ 0.3 %.Open AccessDeterministic Bidirectional Communication and Remote Entanglement Generation Between Superconducting Quantum Processors
We propose and experimentally demonstrate a simple and efficient scheme for photonic communication between two remote superconducting modules. Each module consists of a random access quantum information processor with eight-qubit multimode memory and a single flux tunable transmon. The two processor chips are connected through a one-meter long coaxial cable that is coupled to a dedicated "communication" resonator on each chip. The two communication resonators hybridize with a mode of the cable to form a dark "communication mode" that is highly immune to decay in the coaxial cable. We modulate the transmon frequency via a parametric drive to generate sideband interactions between the transmon and the communication mode. We demonstrate bidirectional single-photon transfer with a success probability exceeding 60 %, and generate an entangled Bell pair with a fidelity of 79.3 $\pm$ 0.3 %.