Stephan Wong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Stephan Wong has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Folkert de Ronde
Quantum & Computer Engineering Delft University of Technology Delft The Netherlands
2 shared publications - Said Hamdioui
Delft University of Technology
2 shared publications - Sebastian Feld
Delft University of Technology
2 shared publications - Taha Shahroodi
ETH Zurich
2 shared publications - Alexander Knapen
University of Michigan Ann Arbor
1 shared publication - Anderson Luiz Sartor
Universidade Federal do Rio Grande do Sul (UFRGS)
1 shared publication
Latest Publications
- Open Access
Parallelizing Program Execution on Distributed Quantum Systems via Compiler/Hardware Co-Design
As quantum computers continue to improve and support larger, more complex computations, smart control hardware and compilers are needed to efficiently leverage the capabilities of these systems. This paper introduces a novel approach to enhance the execution of quantum algorithms on distributed quantum systems. The proposed method involves the development of a hardware design that supports parallel instruction execution and a compiler that modifies the order of instructions to increase parallelism opportunities. The hardware design can be flexibly configured to facilitate parallel execution of instructions that have identical parameters. Furthermore, the compiler uses the underlying hardware constraints to intelligently reorder and decompose instructions to avoid dependencies. The compiler, hardware, and their combination are evaluated using a runtime calculator and a benchmark quantum algorithm set. The results demonstrate a significant speedup, achieving a maximum average speedup of 16.5x and a maximum single-benchmark speedup of 56.2x relative to a baseline, serial execution model. Furthermore, we show a speedup can be obtained across all benchmarks using any of the proposed hardware schemes, although the degree of speedup is largely dependent on the type of quantum algorithm. Taken together, the results of this paper represent a significant step towards realizing high-performance quantum computing systems.
Open AccessParallelizing Program Execution on Distributed Quantum Systems via Compiler/Hardware Co-Design
As quantum computers continue to improve and support larger, more complex computations, smart control hardware and compilers are needed to efficiently leverage the capabilities of these systems. This paper introduces a novel approach to enhance the execution of quantum algorithms on distributed quantum systems. The proposed method involves the development of a hardware design that supports parallel instruction execution and a compiler that modifies the order of instructions to increase parallelism opportunities. The hardware design can be flexibly configured to facilitate parallel execution of instructions that have identical parameters. Furthermore, the compiler uses the underlying hardware constraints to intelligently reorder and decompose instructions to avoid dependencies. The compiler, hardware, and their combination are evaluated using a runtime calculator and a benchmark quantum algorithm set. The results demonstrate a significant speedup, achieving a maximum average speedup of 16.5x and a maximum single-benchmark speedup of 56.2x relative to a baseline, serial execution model. Furthermore, we show a speedup can be obtained across all benchmarks using any of the proposed hardware schemes, although the degree of speedup is largely dependent on the type of quantum algorithm. Taken together, the results of this paper represent a significant step towards realizing high-performance quantum computing systems.
- Open Access
Compiler design for hardware specific decomposition optimizations, tailored to diamond NV centers
Advances in quantum algorithms as well as in control hardware designs are continuously being made. These quantum algorithms, expressed as quantum circuits, need to be translated to a set of instructions from a defined quantum instruction-set architecture (ISA), which are executed by the control hardware. These translations can be done by a compiler, targeting different qubit technologies. Specifically for diamond NV centers, no compiler exists to perform this translation. Therefore, in this paper we present a compiler designed for quantum computers utilizing diamond NV center specific instructions, such as direct carbon control and partial swaps, to reduce execution times and gate count. Additionally, our compiler adds on top of general compilers by allowing classical instructions to perform state tomography and measurement-based operations. The output of the compiler is tested in a diamond NV center specific simulator. Comparing a general compiler output with the diamond NV center specific output of our compiler while applying decoherence and depolarization noise showed reduced noise effects due to diamond specific decomposition. The compiler was also tested to perform state tomography and measurement-based operations, which showed to be functional. Our results show that we have successfully created a compiler with integrated classical and quantum instructions support, which can improve circuit execution fidelity by utilizing diamond specific optimizations.
Open AccessCompiler design for hardware specific decomposition optimizations, tailored to diamond NV centers
Advances in quantum algorithms as well as in control hardware designs are continuously being made. These quantum algorithms, expressed as quantum circuits, need to be translated to a set of instructions from a defined quantum instruction-set architecture (ISA), which are executed by the control hardware. These translations can be done by a compiler, targeting different qubit technologies. Specifically for diamond NV centers, no compiler exists to perform this translation. Therefore, in this paper we present a compiler designed for quantum computers utilizing diamond NV center specific instructions, such as direct carbon control and partial swaps, to reduce execution times and gate count. Additionally, our compiler adds on top of general compilers by allowing classical instructions to perform state tomography and measurement-based operations. The output of the compiler is tested in a diamond NV center specific simulator. Comparing a general compiler output with the diamond NV center specific output of our compiler while applying decoherence and depolarization noise showed reduced noise effects due to diamond specific decomposition. The compiler was also tested to perform state tomography and measurement-based operations, which showed to be functional. Our results show that we have successfully created a compiler with integrated classical and quantum instructions support, which can improve circuit execution fidelity by utilizing diamond specific optimizations.
- 7 November 2023
- Published by Springer Nature
- p. 453-458
A Case for Genome Analysis Where Genomes Reside
- 7 November 2023
- Published by Springer Nature
- p. 453-458
A Case for Genome Analysis Where Genomes Reside
- 7 November 2023
- Published by Springer Nature
- p. 209-221
RattlesnakeJake: A Fast and Accurate Pre-alignment Filter Suitable for Computation-in-Memory
- 7 November 2023
- Published by Springer Nature
- p. 209-221
RattlesnakeJake: A Fast and Accurate Pre-alignment Filter Suitable for Computation-in-Memory
- 6 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multi-Scale Computing Systems
- Vol. 4 (3) , 327-339
Dynamic Trade-off among Fault Tolerance, Energy Consumption, and Performance on a Multiple-Issue VLIW Processor
In the design of modern-day processors, energy consumption and fault tolerance have gained significant importance next to performance. This is caused by battery constraints, thermal design limits, and higher susceptibility to errors as transistor feature sizes are decreasing. However, achieving the ideal balance among them is challenging due to their conflicting nature (e.g., fault-tolerance techniques usually influence execution time or increase energy consumption), and that is why current processor designs target at most two of these axes. Based on that, we propose a new VLIW-based processor design capable of adapting the execution of the application at run-time in a totally transparent fashion, considering performance, fault tolerance, and energy consumption altogether, in which the weight (priority) of each one can be defined a priori. This is achieved by a novel decision module that dynamically controls the application's ILP to increase the possibility of replicating instructions or applying power gating. For an energy-oriented configuration, it is possible, on average, to reduce energy consumption by 37.2% with an overhead of only 8.2% in performance, while maintaining low levels of failure rate, when compared to a fault-tolerant design.
- 6 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multi-Scale Computing Systems
- Vol. 4 (3) , 327-339
Dynamic Trade-off among Fault Tolerance, Energy Consumption, and Performance on a Multiple-Issue VLIW Processor
In the design of modern-day processors, energy consumption and fault tolerance have gained significant importance next to performance. This is caused by battery constraints, thermal design limits, and higher susceptibility to errors as transistor feature sizes are decreasing. However, achieving the ideal balance among them is challenging due to their conflicting nature (e.g., fault-tolerance techniques usually influence execution time or increase energy consumption), and that is why current processor designs target at most two of these axes. Based on that, we propose a new VLIW-based processor design capable of adapting the execution of the application at run-time in a totally transparent fashion, considering performance, fault tolerance, and energy consumption altogether, in which the weight (priority) of each one can be defined a priori. This is achieved by a novel decision module that dynamically controls the application's ILP to increase the possibility of replicating instructions or applying power gating. For an energy-oriented configuration, it is possible, on average, to reduce energy consumption by 37.2% with an overhead of only 8.2% in performance, while maintaining low levels of failure rate, when compared to a fault-tolerant design.
- Open Access
- 14 June 2012
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 69 (3) , 843-858
Multiple description coding for SNR scalable video transmission over unreliable networks
- 14 June 2012
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 69 (3) , 843-858
Open AccessMultiple description coding for SNR scalable video transmission over unreliable networks
- 10 November 2010
- Published by Elsevier in Future Generation Computer Systems
- Vol. 27 (6) , 850-859
Collaboration of reconfigurable processors in grid computing: Theory and application
- 10 November 2010
- Published by Elsevier in Future Generation Computer Systems
- Vol. 27 (6) , 850-859
Collaboration of reconfigurable processors in grid computing: Theory and application
- Open Access
- 16 September 2008
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 58 (1) , 69-85
Design Trade-offs in Customized On-chip Crossbar Schedulers
- 16 September 2008
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 58 (1) , 69-85
Open AccessDesign Trade-offs in Customized On-chip Crossbar Schedulers