Yipeng Huang
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
Yipeng Huang has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Eddy Z. Zhang
Rutgers University, New Brunswick, New Jersey, USA
2 shared publications - Jiakang Li
Rutgers University, New Brunswick, New Jersey, USA
2 shared publications - Zirui Li
Rutgers University, New Brunswick, New Jersey, China
2 shared publications Adam Waksman
The D. E. Shaw Group, New York
1 shared publication- Alex Miralles-Cordal
Department of Computer Science, Rutgers University, New Brunswick, NJ, USA
1 shared publication - Andréa Cynthia Santos
LITIS, ISEL, Le Havre Normandie University
1 shared publication
Latest Publications
- Open Access
- 10 April 2027
- Published by Association for Computing Machinery (ACM)
- p. 1-19
Accordion: An End-to-end Approach for Fermionic Simulation in Quantum Devices
- 10 April 2027
- Published by Association for Computing Machinery (ACM)
- p. 1-19
Open AccessAccordion: An End-to-end Approach for Fermionic Simulation in Quantum Devices
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1583-1597
Genesis: A Compiler for Hamiltonian Simulation on Hybrid CV-DV Quantum Computers
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1583-1597
Open AccessGenesis: A Compiler for Hamiltonian Simulation on Hybrid CV-DV Quantum Computers
- Open Access
- 1 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 459-475
Qubit Movement-Optimized Program Generation on Zoned Neutral Atom Processors
A zoned neutral atom architecture achieves exceptional fidelity by segregating the execution spaces of 1- and 2-qubit gates, being a promising candidate for high-accuracy quantum systems. Unfortunately, na'ively applying programs designed for static qubit topologies to zoned architectures may result in most execution time being consumed by intra-zone travels of atoms. To address this, we introduce Mantra (Minimizing trAp movemeNts for aTom aRray Architectures), which rewrites quantum programs to reduce the interleaving of single- and two-qubit gates. Mantra incorporates three strategies: (i) a fountain-shaped controlled-Z (CZ) chain, (ii) ZZ-interaction protocol without a 1-qubit gate, and (iii) preemptive gate scheduling. Mantra reduces inter-zone movements by 68%, physical gate counts by 35%, and improves circuit fidelities by 17% compared to the standard executions.
- 1 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 459-475
Open AccessQubit Movement-Optimized Program Generation on Zoned Neutral Atom Processors
A zoned neutral atom architecture achieves exceptional fidelity by segregating the execution spaces of 1- and 2-qubit gates, being a promising candidate for high-accuracy quantum systems. Unfortunately, na'ively applying programs designed for static qubit topologies to zoned architectures may result in most execution time being consumed by intra-zone travels of atoms. To address this, we introduce Mantra (Minimizing trAp movemeNts for aTom aRray Architectures), which rewrites quantum programs to reduce the interleaving of single- and two-qubit gates. Mantra incorporates three strategies: (i) a fountain-shaped controlled-Z (CZ) chain, (ii) ZZ-interaction protocol without a 1-qubit gate, and (iii) preemptive gate scheduling. Mantra reduces inter-zone movements by 68%, physical gate counts by 35%, and improves circuit fidelities by 17% compared to the standard executions.
- 13 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 22 (2) , 185-188
Towards an Accelerator for Differential and Algebraic Equations Useful to Scientists
We discuss our preliminary results in building a configurable accelerator for differential equation time stepping and iterative methods for algebraic equations. Relative to prior efforts in building hardware accelerators for numerical methods, our focus is on the following: 1) Demonstrating a higher order of numerical convergence that is needed to actually support existing numerical algorithms. 2) Providing the capacity for wide vectors of variables by keeping the hardware design components as simple as possible. 3) Demonstrating configurable hardware support for a variety of numerical algorithms that form the core of scientific computation libraries. These efforts are toward the goal of making the accelerator democratically accessible by computational scientists
- 13 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 22 (2) , 185-188
Towards an Accelerator for Differential and Algebraic Equations Useful to Scientists
We discuss our preliminary results in building a configurable accelerator for differential equation time stepping and iterative methods for algebraic equations. Relative to prior efforts in building hardware accelerators for numerical methods, our focus is on the following: 1) Demonstrating a higher order of numerical convergence that is needed to actually support existing numerical algorithms. 2) Providing the capacity for wide vectors of variables by keeping the hardware design components as simple as possible. 3) Demonstrating configurable hardware support for a variety of numerical algorithms that form the core of scientific computation libraries. These efforts are toward the goal of making the accelerator democratically accessible by computational scientists
- Open Access
- 17 April 2021
- Published by Association for Computing Machinery (ACM)
- p. 456-472
Logical abstractions for noisy variational Quantum algorithm simulation | Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems
Due to the unreliability and limited capacity of existing quantum computer prototypes, quantum circuit simulation continues to be a vital tool for validating next generation quantum computers and for studying variational quantum algorithms, which are among the leading candidates for useful quantum computation. Existing quantum circuit simulators do not address the common traits of variational algorithms, namely: 1) their ability to work with noisy qubits and operations, 2) their repeated execution of the same circuits but with different parameters, and 3) the fact that they sample from circuit final wavefunctions to drive a classical optimization routine. We present a quantum circuit simulation toolchain based on logical abstractions targeted for simulating variational algorithms. Our proposed toolchain encodes quantum amplitudes and noise probabilities in a probabilistic graphical model, and it compiles the circuits to logical formulas that support efficient repeated simulation of and sampling from quantum circuits for different parameters. Compared to state-of-the-art state vector and density matrix quantum circuit simulators, our simulation approach offers greater performance when sampling from noisy circuits with at least eight to 20 qubits and with around 12 operations on each qubit, making the approach ideal for simulating near-term variational quantum algorithms. And for simulating noise-free shallow quantum circuits with 32 qubits, our simulation approach offers a 66× reduction in sampling cost versus quantum circuit simulation techniques based on tensor network contraction.
- 17 April 2021
- Published by Association for Computing Machinery (ACM)
- p. 456-472
Open AccessLogical abstractions for noisy variational Quantum algorithm simulation | Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems
Due to the unreliability and limited capacity of existing quantum computer prototypes, quantum circuit simulation continues to be a vital tool for validating next generation quantum computers and for studying variational quantum algorithms, which are among the leading candidates for useful quantum computation. Existing quantum circuit simulators do not address the common traits of variational algorithms, namely: 1) their ability to work with noisy qubits and operations, 2) their repeated execution of the same circuits but with different parameters, and 3) the fact that they sample from circuit final wavefunctions to drive a classical optimization routine. We present a quantum circuit simulation toolchain based on logical abstractions targeted for simulating variational algorithms. Our proposed toolchain encodes quantum amplitudes and noise probabilities in a probabilistic graphical model, and it compiles the circuits to logical formulas that support efficient repeated simulation of and sampling from quantum circuits for different parameters. Compared to state-of-the-art state vector and density matrix quantum circuit simulators, our simulation approach offers greater performance when sampling from noisy circuits with at least eight to 20 qubits and with around 12 operations on each qubit, making the approach ideal for simulating near-term variational quantum algorithms. And for simulating noise-free shallow quantum circuits with 32 qubits, our simulation approach offers a 66× reduction in sampling cost versus quantum circuit simulation techniques based on tensor network contraction.
- 11 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Solid-State Circuits
- Vol. 53 (6) , 1870
Corrections to “Energy-Efficient Hybrid Analog/Digital Approximate Computation in Continuous Time” [Jul 16 1514-1524]
Following publication of the above paper [1] , the authors have learned that the concept of the function generator mentioned in it was described earlier in [2] . The authors would like to thank Prof. Murphy for bringing this reference to their attention.
- 11 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Solid-State Circuits
- Vol. 53 (6) , 1870
Corrections to “Energy-Efficient Hybrid Analog/Digital Approximate Computation in Continuous Time” [Jul 16 1514-1524]
Following publication of the above paper [1] , the authors have learned that the concept of the function generator mentioned in it was described earlier in [2] . The authors would like to thank Prof. Murphy for bringing this reference to their attention.
- 1 February 2018
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 64, 175-184
Methods for solving road network problems with disruptions
- 1 February 2018
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 64, 175-184
Methods for solving road network problems with disruptions
- Open Access
- 24 August 2015
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 58 (9) , 60-71
Trustworthy hardware from untrusted components
This defense-in-depth approach uses static analysis and runtime mechanisms to detect and silence hardware backdoors.
- 24 August 2015
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 58 (9) , 60-71
Open AccessTrustworthy hardware from untrusted components
This defense-in-depth approach uses static analysis and runtime mechanisms to detect and silence hardware backdoors.
- 1 January 1991
- Published by Elsevier
- p. 433
CATARACTOGENESIS FOLLOWING LOW DOSES OF HIGH LET RADIATION