Eddy Z. Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Eddy Z. Zhang has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Fei Hua
Rutgers Unversity, United States of America and Pacific Northwest National Laboratory (PNNL), United States of America
2 shared publications - Jiakang Li
Rutgers University, New Brunswick, New Jersey, USA
2 shared publications - Xiangyu Gao
University of Washington, Seattle, USA
2 shared publications - Yipeng Huang
Rutgers University, New Brunswick, New Jersey, USA
2 shared publications - Zirui Li
Rutgers University, New Brunswick, New Jersey, China
2 shared publications - Ang Li
Pacific Northwest National Laboratory
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
- 12 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 1468-1477
QASMTrans: A QASM Quantum Transpiler Framework for NISQ Devices
The success of a quantum algorithm hinges on the ability to orchestrate a successful application induction. Detrimental overheads in mapping general quantum circuits to physically implementable routines can be the deciding factor between a successful and erroneous circuit induction. In QASMTrans, we focus on the problem of rapid circuit transpilation. Transpilation plays a crucial role in converting high-level, machine-agnostic circuits into machine-specific circuits constrained by physical topology and supported gate sets. The efficiency of transpilation continues to be a substantial bottleneck, especially when dealing with larger circuits requiring high degrees of inter-qubit interaction. QASMTrans is a high-performance C++ quantum transpiler framework that demonstrates 3-1111 × speedups compared to the commonly used Qiskit transpiler. We observe speedups on large dense circuits such as ‘uccsd_n24’ which require gates. QASMTrans successfully transpiles the aforementioned circuits in 7.9s, whilst Qiskit needs 502 seconds with optimization 1 and exceeds an hour of transpilation time with optimization 3. With QASMTrans providing transpiled circuits in a fraction of the time of prior transpilers, potential design space exploration, and heuristic-based transpiler design becomes substantially more tractable. QASMTrans is released at http://github.com/pnnl/qasmtrans.
- 12 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 1468-1477
Open AccessQASMTrans: A QASM Quantum Transpiler Framework for NISQ Devices
The success of a quantum algorithm hinges on the ability to orchestrate a successful application induction. Detrimental overheads in mapping general quantum circuits to physically implementable routines can be the deciding factor between a successful and erroneous circuit induction. In QASMTrans, we focus on the problem of rapid circuit transpilation. Transpilation plays a crucial role in converting high-level, machine-agnostic circuits into machine-specific circuits constrained by physical topology and supported gate sets. The efficiency of transpilation continues to be a substantial bottleneck, especially when dealing with larger circuits requiring high degrees of inter-qubit interaction. QASMTrans is a high-performance C++ quantum transpiler framework that demonstrates 3-1111 × speedups compared to the commonly used Qiskit transpiler. We observe speedups on large dense circuits such as ‘uccsd_n24’ which require gates. QASMTrans successfully transpiles the aforementioned circuits in 7.9s, whilst Qiskit needs 502 seconds with optimization 1 and exceeds an hour of transpilation time with optimization 3. With QASMTrans providing transpiled circuits in a fraction of the time of prior transpilers, potential design space exploration, and heuristic-based transpiler design becomes substantially more tractable. QASMTrans is released at http://github.com/pnnl/qasmtrans.
- Open Access
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 62-66
Key Generation and Identity Verification using Quantum Teleportation
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 62-66
Open AccessKey Generation and Identity Verification using Quantum Teleportation
- Open Access
- 25 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 108-124
Exploiting the Regular Structure of Modern Quantum Architectures for Compiling and Optimizing Programs with Permutable Operators
A critical feature in today's quantum circuit is that they have permutable two-qubit operators. The flexibility in ordering the permutable two-qubit gates leads to more compiler optimization opportunities. However, it also imposes significant challenges due to the additional degree of freedom. Our Contributions are two-fold. We first propose a general methodology that can find structured solutions for scalable quantum hardware. It breaks down the complex compilation problem into two sub-problems that can be solved at small scale. Second, we show how such a structured method can be adapted to practical cases that handle sparsity of the input problem graphs and the noise variability in real hardware. Our evaluation evaluates our method on IBM and Google architecture coupling graphs for up to 1,024 qubits and demonstrate better result in both depth and gate count - by up to 72% reduction in depth, and 66% reduction in gate count. Our real experiments on IBM Mumbai show that we can find better expected minimal energy than the state-of-the-art baseline.
- 25 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 108-124
Open AccessExploiting the Regular Structure of Modern Quantum Architectures for Compiling and Optimizing Programs with Permutable Operators
A critical feature in today's quantum circuit is that they have permutable two-qubit operators. The flexibility in ordering the permutable two-qubit gates leads to more compiler optimization opportunities. However, it also imposes significant challenges due to the additional degree of freedom. Our Contributions are two-fold. We first propose a general methodology that can find structured solutions for scalable quantum hardware. It breaks down the complex compilation problem into two sub-problems that can be solved at small scale. Second, we show how such a structured method can be adapted to practical cases that handle sparsity of the input problem graphs and the noise variability in real hardware. Our evaluation evaluates our method on IBM and Google architecture coupling graphs for up to 1,024 qubits and demonstrate better result in both depth and gate count - by up to 72% reduction in depth, and 66% reduction in gate count. Our real experiments on IBM Mumbai show that we can find better expected minimal energy than the state-of-the-art baseline.