270 results on '"Chong, Frederic T."'
Search Results
2. Fundamental causal bounds of quantum random access memories
- Author
-
Wang, Yunfei, Alexeev, Yuri, Jiang, Liang, Chong, Frederic T., and Liu, Junyu
- Published
- 2024
- Full Text
- View/download PDF
3. Author Correction: Preparation of metrological states in dipolar-interacting spin systems
- Author
-
Zheng, Tian-Xing, Li, Anran, Rosen, Jude, Zhou, Sisi, Koppenhöfer, Martin, Ma, Ziqi, Chong, Frederic T., Clerk, Aashish A., Jiang, Liang, and Maurer, Peter C.
- Published
- 2024
- Full Text
- View/download PDF
4. Quantum-centric supercomputing for materials science: A perspective on challenges and future directions
- Author
-
Alexeev, Yuri, Amsler, Maximilian, Barroca, Marco Antonio, Bassini, Sanzio, Battelle, Torey, Camps, Daan, Casanova, David, Choi, Young Jay, Chong, Frederic T., Chung, Charles, Codella, Christopher, Córcoles, Antonio D., Cruise, James, Di Meglio, Alberto, Duran, Ivan, Eckl, Thomas, Economou, Sophia, Eidenbenz, Stephan, Elmegreen, Bruce, Fare, Clyde, Faro, Ismael, Fernández, Cristina Sanz, Ferreira, Rodrigo Neumann Barros, Fuji, Keisuke, Fuller, Bryce, Gagliardi, Laura, Galli, Giulia, Glick, Jennifer R., Gobbi, Isacco, Gokhale, Pranav, de la Puente Gonzalez, Salvador, Greiner, Johannes, Gropp, Bill, Grossi, Michele, Gull, Emanuel, Healy, Burns, Hermes, Matthew R., Huang, Benchen, Humble, Travis S., Ito, Nobuyasu, Izmaylov, Artur F., Javadi-Abhari, Ali, Jennewein, Douglas, Jha, Shantenu, Jiang, Liang, Jones, Barbara, de Jong, Wibe Albert, Jurcevic, Petar, Kirby, William, Kister, Stefan, Kitagawa, Masahiro, Klassen, Joel, Klymko, Katherine, Koh, Kwangwon, Kondo, Masaaki, Kürkçüog̃lu, Dog̃a Murat, Kurowski, Krzysztof, Laino, Teodoro, Landfield, Ryan, Leininger, Matt, Leyton-Ortega, Vicente, Li, Ang, Lin, Meifeng, Liu, Junyu, Lorente, Nicolas, Luckow, Andre, Martiel, Simon, Martin-Fernandez, Francisco, Martonosi, Margaret, Marvinney, Claire, Medina, Arcesio Castaneda, Merten, Dirk, Mezzacapo, Antonio, Michielsen, Kristel, Mitra, Abhishek, Mittal, Tushar, Moon, Kyungsun, Moore, Joel, Mostame, Sarah, Motta, Mario, Na, Young-Hye, Nam, Yunseong, Narang, Prineha, Ohnishi, Yu-ya, Ottaviani, Daniele, Otten, Matthew, Pakin, Scott, Pascuzzi, Vincent R., Pednault, Edwin, Piontek, Tomasz, Pitera, Jed, Rall, Patrick, Ravi, Gokul Subramanian, Robertson, Niall, Rossi, Matteo A.C., Rydlichowski, Piotr, Ryu, Hoon, Samsonidze, Georgy, Sato, Mitsuhisa, Saurabh, Nishant, Sharma, Vidushi, Sharma, Kunal, Shin, Soyoung, Slessman, George, Steiner, Mathias, Sitdikov, Iskandar, Suh, In-Saeng, Switzer, Eric D., Tang, Wei, Thompson, Joel, Todo, Synge, Tran, Minh C., Trenev, Dimitar, Trott, Christian, Tseng, Huan-Hsin, Tubman, Norm M., Tureci, Esin, Valiñas, David García, Vallecorsa, Sofia, Wever, Christopher, Wojciechowski, Konrad, Wu, Xiaodi, Yoo, Shinjae, Yoshioka, Nobuyuki, Yu, Victor Wen-zhe, Yunoki, Seiji, Zhuk, Sergiy, and Zubarev, Dmitry
- Published
- 2024
- Full Text
- View/download PDF
5. Preparation of metrological states in dipolar-interacting spin systems
- Author
-
Zheng, Tian-Xing, Li, Anran, Rosen, Jude, Zhou, Sisi, Koppenhöfer, Martin, Ma, Ziqi, Chong, Frederic T., Clerk, Aashish A., Jiang, Liang, and Maurer, Peter C.
- Published
- 2022
- Full Text
- View/download PDF
6. A Quantum Leap Is Coming: A look at several potential power systems applications of quantum computing in deploying the grid of the future
- Author
-
Zheng, Honghao, Burg, Ryan, Paaso, Aleksi, Eskandarpour, Rozhin, Khodaei, Amin, Gokhale, Pranav, and Chong, Frederic T.
- Subjects
Electric power systems ,Infrastructure (Economics) ,Machine learning ,Power lines ,Electronics and electrical industries ,University of Denver ,University of Chicago - Abstract
Deploying the more sustainable and resilient electric grid of the future requires a sophisticated usage of data. This begins with sensors and measurement infrastructure collecting a wide range of grid-relevant [...]
- Published
- 2021
7. Resource optimized quantum architectures for surface code implementations of magic-state distillation
- Author
-
Holmes, Adam, Ding, Yongshan, Javadi-Abhari, Ali, Franklin, Diana, Martonosi, Margaret, and Chong, Frederic T.
- Published
- 2019
- Full Text
- View/download PDF
8. Formal constraint-based compilation for noisy intermediate-scale quantum systems
- Author
-
Murali, Prakash, Javadi-Abhari, Ali, Chong, Frederic T., and Martonosi, Margaret
- Published
- 2019
- Full Text
- View/download PDF
9. Clifford Assisted Optimal Pass Selection for Quantum Transpilation
- Author
-
Dangwal, Siddharth, Ravi, Gokul Subramanian, Seifert, Lennart Maximilian, and Chong, Frederic T.
- Subjects
FOS: Computer and information sciences ,Quantum Physics ,Emerging Technologies (cs.ET) ,Hardware Architecture (cs.AR) ,FOS: Physical sciences ,Computer Science - Emerging Technologies ,Quantum Physics (quant-ph) ,Computer Science - Hardware Architecture - Abstract
The fidelity of quantum programs in the NISQ era is limited by high levels of device noise. To increase the fidelity of quantum programs running on NISQ devices, a variety of optimizations have been proposed. These include mapping passes, routing passes, scheduling methods and standalone optimisations which are usually incorporated into a transpiler as passes. Popular transpilers such as those proposed by Qiskit, Cirq and Cambridge Quantum Computing make use of these extensively. However, choosing the right set of transpiler passes and the right configuration for each pass is a challenging problem. Transpilers often make critical decisions using heuristics since the ideal choices are impossible to identify without knowing the target application outcome. Further, the transpiler also makes simplifying assumptions about device noise that often do not hold in the real world. As a result, we often see effects where the fidelity of a target application decreases despite using state-of-the-art optimisations. To overcome this challenge, we propose OPTRAN, a framework for Choosing an Optimal Pass Set for Quantum Transpilation. OPTRAN uses classically simulable quantum circuits composed entirely of Clifford gates, that resemble the target application, to estimate how different passes interact with each other in the context of the target application. OPTRAN then uses this information to choose the optimal combination of passes that maximizes the target application's fidelity when run on the actual device. Our experiments on IBM machines show that OPTRAN improves fidelity by 87.66% of the maximum possible limit over the baseline used by IBM Qiskit. We also propose low-cost variants of OPTRAN, called OPTRAN-E-3 and OPTRAN-E-1 that improve fidelity by 78.33% and 76.66% of the maximum permissible limit over the baseline at a 58.33% and 69.44% reduction in cost compared to OPTRAN respectively.
- Published
- 2023
10. VarSaw: Application-tailored Measurement Error Mitigation for Variational Quantum Algorithms
- Author
-
Dangwal, Siddharth, Ravi, Gokul Subramanian, Das, Poulami, Smith, Kaitlin N., Baker, Jonathan M., and Chong, Frederic T.
- Subjects
FOS: Computer and information sciences ,Quantum Physics ,Emerging Technologies (cs.ET) ,Hardware Architecture (cs.AR) ,FOS: Physical sciences ,Computer Science - Emerging Technologies ,Quantum Physics (quant-ph) ,Computer Science - Hardware Architecture - Abstract
For potential quantum advantage, Variational Quantum Algorithms (VQAs) need high accuracy beyond the capability of today's NISQ devices, and thus will benefit from error mitigation. In this work we are interested in mitigating measurement errors which occur during qubit measurements after circuit execution and tend to be the most error-prone operations, especially detrimental to VQAs. Prior work, JigSaw, has shown that measuring only small subsets of circuit qubits at a time and collecting results across all such subset circuits can reduce measurement errors. Then, running the entire (global) original circuit and extracting the qubit-qubit measurement correlations can be used in conjunction with the subsets to construct a high-fidelity output distribution of the original circuit. Unfortunately, the execution cost of JigSaw scales polynomially in the number of qubits in the circuit, and when compounded by the number of circuits and iterations in VQAs, the resulting execution cost quickly turns insurmountable. To combat this, we propose VarSaw, which improves JigSaw in an application-tailored manner, by identifying considerable redundancy in the JigSaw approach for VQAs: spatial redundancy across subsets from different VQA circuits and temporal redundancy across globals from different VQA iterations. VarSaw then eliminates these forms of redundancy by commuting the subset circuits and selectively executing the global circuits, reducing computational cost (in terms of the number of circuits executed) over naive JigSaw for VQA by 25x on average and up to 1000x, for the same VQA accuracy. Further, it can recover, on average, 45% of the infidelity from measurement errors in the noisy VQA baseline. Finally, it improves fidelity by 55%, on average, over JigSaw for a fixed computational budget. VarSaw can be accessed here: https://github.com/siddharthdangwal/VarSaw., Appears at the International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) 2024. First two authors contributed equally
- Published
- 2023
11. Empirical overhead of the adapted surface code on defective qubit arrays
- Author
-
Lin, Sophia Fuhui, Viszlai, Joshua, Smith, Kaitlin N., Ravi, Gokul Subramanian, Yuan, Charles, Chong, Frederic T., and Brown, Benjamin J.
- Subjects
Quantum Physics ,FOS: Physical sciences ,Quantum Physics (quant-ph) - Abstract
The realization of fault-tolerant quantum computers using solid-state hardware will require us to adapt our quantum error correction procedure to account for fabrication variation and defects that will invariably arise. If unaddressed, these errors inhibit us from scaling our system such that quantum information can be processed with sufficiently small failure rates. We simulate the surface code adapted to qubit arrays with arbitrarily distributed defects to find metrics that characterize how defects affect fidelity. We then determine the impact of defects on the resource overhead of realizing a fault-tolerant quantum computer, on a chiplet-based modular architecture. Our strategy for dealing with fabrication defects demonstrates an exponential suppression of logical failure where error rates of non-faulty physical qubits are $\sim 0.1\%$ in a circuit-based noise model. This is a typical regime where we imagine running the defect-free surface code. We use our numerical results to establish post-selection criteria for building a device from defective chiplets. Using our criteria, we then evaluate the resource overhead in terms of the average number of fabricated physical qubits per logical qubit. We find that an optimal choice of chiplet size, based on the defect rate and target fidelity, is essential to limiting any additional error correction overhead due to defects. When the optimal chiplet size is chosen, at a defect rate of $1\%$ the resource overhead can be reduced to below 3X and 6X respectively for the two defect models we use, for a wide range of target performance. We also determine cutoff fidelity values that help identify whether a qubit should be disabled or kept as part of the error correction code.
- Published
- 2023
12. Fault Tolerant Non-Clifford State Preparation for Arbitrary Rotations
- Author
-
Choi, Hyeongrak, Chong, Frederic T., Englund, Dirk, and Ding, Yongshan
- Subjects
Quantum Physics ,FOS: Physical sciences ,Quantum Physics (quant-ph) - Abstract
Quantum error correction is an essential component for practical quantum computing on noisy quantum hardware. However, logical operations on error-corrected qubits require a significant resource overhead, especially for high-precision and high-fidelity non-Clifford rotation gates. To address this issue, we propose a postselection-based algorithm to efficiently prepare resource states for gate teleportation. Our algorithm achieves fault tolerance, demonstrating the exponential suppression of logical errors with code distance, and it applies to any stabilizer codes. We provide analytical derivations and numerical simulations of the fidelity and success probability of the algorithm. We benchmark the method on surface code and show a factor of 100 to 10,000 reduction in space-time overhead compared to existing methods. Overall, our approach presents a promising path to reducing the resource requirement for quantum algorithms on error-corrected and noisy intermediate-scale quantum computers.
- Published
- 2023
13. Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures
- Author
-
Litteken, Andrew, Seifert, Lennart Maximilian, Chadwick, Jason D., Nottingham, Natalia, Roy, Tanay, Li, Ziqian, Schuster, David, Chong, Frederic T., and Baker, Jonathan M.
- Subjects
FOS: Computer and information sciences ,Quantum Physics ,Emerging Technologies (cs.ET) ,FOS: Physical sciences ,Computer Science - Emerging Technologies ,Quantum Physics (quant-ph) - Abstract
Superconducting quantum devices are a leading technology for quantum computation, but they suffer from several challenges. Gate errors, coherence errors and a lack of connectivity all contribute to low fidelity results. In particular, connectivity restrictions enforce a gate set that requires three-qubit gates to be decomposed into one- or two-qubit gates. This substantially increases the number of two-qubit gates that need to be executed. However, many quantum devices have access to higher energy levels. We can expand the qubit abstraction of $|0\rangle$ and $|1\rangle$ to a ququart which has access to the $|2\rangle$ and $|3\rangle$ state, but with shorter coherence times. This allows for two qubits to be encoded in one ququart, enabling increased virtual connectivity between physical units from two adjacent qubits to four fully connected qubits. This connectivity scheme allows us to more efficiently execute three-qubit gates natively between two physical devices. We present direct-to-pulse implementations of several three-qubit gates, synthesized via optimal control, for compilation of three-qubit gates onto a superconducting-based architecture with access to four-level devices with the first experimental demonstration of four-level ququart gates designed through optimal control. We demonstrate strategies that temporarily use higher level states to perform Toffoli gates and always use higher level states to improve fidelities for quantum circuits. We find that these methods improve expected fidelities with increases of 2x across circuit sizes using intermediate encoding, and increases of 3x for fully-encoded ququart compilation., 14 pages, 9 figures, to be published at ISCA 2023
- Published
- 2023
14. ScaffCC: Scalable compilation and analysis of quantum programs
- Author
-
JavadiAbhari, Ali, Patil, Shruti, Kudrow, Daniel, Heckey, Jeff, Lvov, Alexey, Chong, Frederic T., and Martonosi, Margaret
- Published
- 2015
- Full Text
- View/download PDF
15. Programming languages and compiler design for realistic quantum hardware
- Author
-
Chong, Frederic T., Franklin, Diana, and Martonosi, Margaret
- Subjects
Quantum computing -- Methods ,Compilers (Software) -- Authorship ,Programming languages -- Authorship ,Programming language ,Compiler/decompiler ,Environmental issues ,Science and technology ,Zoology and wildlife conservation - Abstract
Quantum computing sits at an important inflection point. For years, high-level algorithms for quantum computers have shown considerable promise, and recent advances in quantum device fabrication offer hope of utility. A gap still exists, however, between the hardware size and reliability requirements of quantum computing algorithms and the physical machines foreseen within the next ten years. To bridge this gap, quantum computers require appropriate software to translate and optimize applications (toolflows) and abstraction layers. Given the stringent resource constraints in quantum computing, information passed between layers of software and implementations will differ markedly from in classical computing. Quantum toolflows must expose more physical details between layers, so the challenge is to find abstractions that expose key details while hiding enough complexity., Author(s): Frederic T. Chong (corresponding author) [1]; Diana Franklin [1]; Margaret Martonosi [2] In the fifty years since Gordon Moore first predicted the exponential technology scaling now known as Moores [...]
- Published
- 2017
- Full Text
- View/download PDF
16. Benchmarking variational quantum circuits with permutation symmetry
- Author
-
Zheng, Han, Ravi, Gokul Subramanian, Wang, Hanrui, Setia, Kanav, Chong, Frederic T., and Junyu Liu
- Subjects
FOS: Computer and information sciences ,Quantum Physics ,Computer Science - Machine Learning ,Artificial Intelligence (cs.AI) ,Computer Science - Artificial Intelligence ,Hardware Architecture (cs.AR) ,FOS: Electrical engineering, electronic engineering, information engineering ,FOS: Physical sciences ,Systems and Control (eess.SY) ,Quantum Physics (quant-ph) ,Computer Science - Hardware Architecture ,Electrical Engineering and Systems Science - Systems and Control ,Machine Learning (cs.LG) - Abstract
We propose SnCQA, a set of hardware-efficient variational circuits of equivariant quantum convolutional circuits respective to permutation symmetries and spatial lattice symmetries with the number of qubits $n$. By exploiting permutation symmetries of the system, such as lattice Hamiltonians common to many quantum many-body and quantum chemistry problems, Our quantum neural networks are suitable for solving machine learning problems where permutation symmetries are present, which could lead to significant savings of computational costs. Aside from its theoretical novelty, we find our simulations perform well in practical instances of learning ground states in quantum computational chemistry, where we could achieve comparable performances to traditional methods with few tens of parameters. Compared to other traditional variational quantum circuits, such as the pure hardware-efficient ansatz (pHEA), we show that SnCQA is more scalable, accurate, and noise resilient (with $20\times$ better performance on $3 \times 4$ square lattice and $200\% - 1000\%$ resource savings in various lattice sizes and key criterions such as the number of layers, parameters, and times to converge in our cases), suggesting a potentially favorable experiment on near-time quantum devices., 10 pages, many figures
- Published
- 2022
17. QuEst: Graph Transformer for Quantum Circuit Reliability Estimation
- Author
-
Wang, Hanrui, Liu, Pengyu, Cheng, Jinglei, Liang, Zhiding, Gu, Jiaqi, Li, Zirui, Ding, Yongshan, Jiang, Weiwen, Shi, Yiyu, Qian, Xuehai, Pan, David Z., Chong, Frederic T., and Han, Song
- Subjects
FOS: Computer and information sciences ,Quantum Physics ,Computer Science - Machine Learning ,Artificial Intelligence (cs.AI) ,Emerging Technologies (cs.ET) ,Computer Science - Artificial Intelligence ,Hardware Architecture (cs.AR) ,FOS: Physical sciences ,Computer Science - Emerging Technologies ,Quantum Physics (quant-ph) ,Computer Science - Hardware Architecture ,Machine Learning (cs.LG) - Abstract
Among different quantum algorithms, PQC for QML show promises on near-term devices. To facilitate the QML and PQC research, a recent python library called TorchQuantum has been released. It can construct, simulate, and train PQC for machine learning tasks with high speed and convenient debugging supports. Besides quantum for ML, we want to raise the community's attention on the reversed direction: ML for quantum. Specifically, the TorchQuantum library also supports using data-driven ML models to solve problems in quantum system research, such as predicting the impact of quantum noise on circuit fidelity and improving the quantum circuit compilation efficiency. This paper presents a case study of the ML for quantum part. Since estimating the noise impact on circuit reliability is an essential step toward understanding and mitigating noise, we propose to leverage classical ML to predict noise impact on circuit fidelity. Inspired by the natural graph representation of quantum circuits, we propose to leverage a graph transformer model to predict the noisy circuit fidelity. We firstly collect a large dataset with a variety of quantum circuits and obtain their fidelity on noisy simulators and real machines. Then we embed each circuit into a graph with gate and noise properties as node features, and adopt a graph transformer to predict the fidelity. Evaluated on 5 thousand random and algorithm circuits, the graph transformer predictor can provide accurate fidelity estimation with RMSE error 0.04 and outperform a simple neural network-based model by 0.02 on average. It can achieve 0.99 and 0.95 R$^2$ scores for random and algorithm circuits, respectively. Compared with circuit simulators, the predictor has over 200X speedup for estimating the fidelity., ICCAD 2022; 10 pages, 10 figures; code at https://github.com/mit-han-lab/torchquantum
- Published
- 2022
18. A Hybrid Optical-Electrical Analog Deep Learning Accelerator Using Incoherent Optical Signals.
- Author
-
MINGDAI YANG, QIUWEN LOU, RAJAEI, RAMIN, JOKAR, MOHAMMAD REZA, JUNYI QIU, YUMING LIU, UDUPA, ADITI, CHONG, FREDERIC T., DALLESASSE, JOHN M., FENG, MILTON, GODDARD, LYNFORD L., HU, X. SHARON, and YANJING LI
- Abstract
Optical deep learning (DL) accelerators have attracted significant interests due to their latency and power advantages. In this article, we focus on incoherent optical designs. A significant challenge is that there is no known solution to perform single-wavelength accumulation (a key operation required for DL workloads) using incoherent optical signals efficiently. Therefore, we devise a hybrid approach, where accumulation is done in the electrical domain, and multiplication is performed in the optical domain. The key technology enabler of our design is the transistor laser, which performs electrical-to-optical and optical-to-electrical conversions efficiently. Through detailed design and evaluation of our design, along with a comprehensive benchmarking study against state-of-the-art RRAM-based designs, we derive the following key results: (1) For a four-layer multilayer perceptron network, our design achieves 115× and 17.11× improvements in latency and energy, respectively, compared to the RRAM-based design. We can take full advantage of the speed and energy benefits of the optical technology because the inference task can be entirely mapped onto our design. (2) For a complex workload (Resnet50), weight reprogramming is needed, and intermediate results need to be stored/re-fetched to/from memories. In this case, for the same area, our design still outperforms the RRAM-based design by 15.92× in inference latency, and 8.99× in energy. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
19. Giallar: Push-Button Verification for the Qiskit Quantum Compiler
- Author
-
Tao, Runzhou, Shi, Yunong, Yao, Jianan, Li, Xupeng, Javadi-Abhari, Ali, Cross, Andrew W., Chong, Frederic T., and Gu, Ronghui
- Subjects
FOS: Computer and information sciences ,Quantum Physics ,Computer Science - Programming Languages ,FOS: Physical sciences ,Quantum Physics (quant-ph) ,Programming Languages (cs.PL) - Abstract
This paper presents Giallar, a fully-automated verification toolkit for quantum compilers. Giallar requires no manual specifications, invariants, or proofs, and can automatically verify that a compiler pass preserves the semantics of quantum circuits. To deal with unbounded loops in quantum compilers, Giallar abstracts three loop templates, whose loop invariants can be automatically inferred. To efficiently check the equivalence of arbitrary input and output circuits that have complicated matrix semantics representation, Giallar introduces a symbolic representation for quantum circuits and a set of rewrite rules for showing the equivalence of symbolic quantum circuits. With Giallar, we implemented and verified 44 (out of 56) compiler passes in 13 versions of the Qiskit compiler, the open-source quantum compiler standard, during which three bugs were detected in and confirmed by Qiskit. Our evaluation shows that most of Qiskit compiler passes can be automatically verified in seconds and verification imposes only a modest overhead to compilation performance., PLDI 2022; Improves arXiv:1908.08963
- Published
- 2022
20. Summary: Chicago Quantum Exchange (CQE) Pulse-level Quantum Control Workshop
- Author
-
Smith, Kaitlin N., Ravi, Gokul Subramanian, Alexander, Thomas, Bronn, Nicholas T., Carvalho, Andre, Cervera-Lierta, Alba, Chong, Frederic T., Chow, Jerry M., Cubeddu, Michael, Hashim, Akel, Jiang, Liang, Lanes, Olivia, Otten, Matthew J., Schuster, David I., Gokhale, Pranav, Earnest, Nathan, and Galda, Alexey
- Subjects
Quantum Physics ,ComputerSystemsOrganization_MISCELLANEOUS ,FOS: Physical sciences ,TheoryofComputation_GENERAL ,Quantum Physics (quant-ph) - Abstract
Quantum information processing holds great promise for pushing beyond the current frontiers in computing. Specifically, quantum computation promises to accelerate the solving of certain problems, and there are many opportunities for innovation based on applications in chemistry, engineering, and finance. To harness the full potential of quantum computing, however, we must not only place emphasis on manufacturing better qubits, advancing our algorithms, and developing quantum software. To scale devices to the fault tolerant regime, we must refine device-level quantum control. On May 17-18, 2021, the Chicago Quantum Exchange (CQE) partnered with IBM Quantum and Super.tech to host the Pulse-level Quantum Control Workshop. At the workshop, representatives from academia, national labs, and industry addressed the importance of fine-tuning quantum processing at the physical layer. The purpose of this report is to summarize the topics of this meeting for the quantum community at large.
- Published
- 2022
21. Modeling Short-Range Microwave Networks to Scale Superconducting Quantum Computation
- Author
-
LaRacuente, Nicholas, Smith, Kaitlin N., Imany, Poolad, Silverman, Kevin L., and Chong, Frederic T.
- Subjects
FOS: Computer and information sciences ,Quantum Physics ,Computer Science - Distributed, Parallel, and Cluster Computing ,Hardware Architecture (cs.AR) ,FOS: Physical sciences ,Distributed, Parallel, and Cluster Computing (cs.DC) ,Quantum Physics (quant-ph) ,Computer Science - Hardware Architecture - Abstract
A core challenge for superconducting quantum computers is to scale up the number of qubits in each processor without increasing noise or cross-talk. Distributed quantum computing across small qubit arrays, known as chiplets, can address these challenges in a scalable manner. We propose a chiplet architecture over microwave links with potential to exceed monolithic performance on near-term hardware. Our methods of modeling and evaluating the chiplet architecture bridges the physical and network layers in these processors. We find evidence that distributing computation across chiplets may reduce the overall error rates associated with moving data across the device, despite higher error figures for transfers across links. Preliminary analyses suggest that latency is not substantially impacted, and that at least some applications and architectures may avoid bottlenecks around chiplet boundaries. In the long-term, short-range networks may underlie quantum computers just as local area networks underlie classical datacenters and supercomputers today., 23 pages, 11 figures
- Published
- 2022
22. Faster and More Reliable Quantum SWAPs via Native Gates
- Author
-
Gokhale, Pranav, Tomesh, Teague, Suchara, Martin, and Chong, Frederic T.
- Subjects
Quantum Physics ,FOS: Electrical engineering, electronic engineering, information engineering ,FOS: Physical sciences ,Systems and Control (eess.SY) ,Quantum Physics (quant-ph) ,Electrical Engineering and Systems Science - Systems and Control - Abstract
Due to the sparse connectivity of superconducting quantum computers, qubit communication via SWAP gates accounts for the vast majority of overhead in quantum programs. We introduce a method for improving the speed and reliability of SWAPs at the level of the superconducting hardware's native gateset. Our method relies on four techniques: 1) SWAP Orientation, 2) Cross-Gate Pulse Cancellation, 3) Commutation through Cross-Resonance, and 4) Cross-Resonance Polarity. Importantly, our Optimized SWAP is bootstrapped from the pre-calibrated gates, and therefore incurs zero calibration overhead. We experimentally evaluate our optimizations with Qiskit Pulse on IBM hardware. Our Optimized SWAP is 11% faster and 13% more reliable than the Standard SWAP. We also experimentally validate our optimizations on application-level benchmarks. Due to (a) the multiplicatively compounding gains from improved SWAPs and (b) the frequency of SWAPs, we observe typical improvements in success probability of 10-40%. The Optimized SWAP is available through the SuperstaQ platform.
- Published
- 2021
23. QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuits
- Author
-
Wang, Hanrui, Ding, Yongshan, Gu, Jiaqi, Li, Zirui, Lin, Yujun, Pan, David Z., Chong, Frederic T., and Han, Song
- Subjects
FOS: Computer and information sciences ,Quantum Physics ,Computer Science - Machine Learning ,Hardware Architecture (cs.AR) ,FOS: Physical sciences ,Quantum Physics (quant-ph) ,Computer Science - Hardware Architecture ,Machine Learning (cs.LG) - Abstract
Quantum noise is the key challenge in Noisy Intermediate-Scale Quantum (NISQ) computers. Previous work for mitigating noise has primarily focused on gate-level or pulse-level noise-adaptive compilation. However, limited research efforts have explored a higher level of optimization by making the quantum circuits themselves resilient to noise. We propose QuantumNAS, a comprehensive framework for noise-adaptive co-search of the variational circuit and qubit mapping. Variational quantum circuits are a promising approach for constructing QML and quantum simulation. However, finding the best variational circuit and its optimal parameters is challenging due to the large design space and parameter training cost. We propose to decouple the circuit search and parameter training by introducing a novel SuperCircuit. The SuperCircuit is constructed with multiple layers of pre-defined parameterized gates and trained by iteratively sampling and updating the parameter subsets (SubCircuits) of it. It provides an accurate estimation of SubCircuits performance trained from scratch. Then we perform an evolutionary co-search of SubCircuit and its qubit mapping. The SubCircuit performance is estimated with parameters inherited from SuperCircuit and simulated with real device noise models. Finally, we perform iterative gate pruning and finetuning to remove redundant gates. Extensively evaluated with 12 QML and VQE benchmarks on 14 quantum computers, QuantumNAS significantly outperforms baselines. For QML, QuantumNAS is the first to demonstrate over 95% 2-class, 85% 4-class, and 32% 10-class classification accuracy on real QC. It also achieves the lowest eigenvalue for VQE tasks on H2, H2O, LiH, CH4, BeH2 compared with UCCSD. We also open-source TorchQuantum (https://github.com/mit-han-lab/torchquantum) for fast training of parameterized quantum circuits to facilitate future research., Published as a conference paper in HPCA 2022. 19 pages, 22 figures. TorchQuantum Code available at https://github.com/mit-han-lab/torchquantum
- Published
- 2021
24. QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis
- Author
-
Wu, Xin-Chuan, Davis, Marc Grau, Chong, Frederic T., and Iancu, Costin
- Subjects
Computer Science::Hardware Architecture ,Quantum Physics ,Computer Science::Emerging Technologies ,Hardware_INTEGRATEDCIRCUITS ,FOS: Physical sciences ,Quantum Physics (quant-ph) ,Hardware_LOGICDESIGN - Abstract
The current phase of quantum computing is in the Noisy Intermediate-Scale Quantum (NISQ) era. On NISQ devices, two-qubit gates such as CNOTs are much noisier than single-qubit gates, so it is essential to minimize their count. Quantum circuit synthesis is a process of decomposing an arbitrary unitary into a sequence of quantum gates, and can be used as an optimization tool to produce shorter circuits to improve overall circuit fidelity. However, the time-to-solution of synthesis grows exponentially with the number of qubits. As a result, synthesis is intractable for circuits on a large qubit scale. In this paper, we propose a hierarchical, block-by-block optimization framework, QGo, for quantum circuit optimization. Our approach allows an exponential cost optimization to scale to large circuits. QGo uses a combination of partitioning and synthesis: 1) partition the circuit into a sequence of independent circuit blocks; 2) re-generate and optimize each block using quantum synthesis; and 3) re-compose the final circuit by stitching all the blocks together. We perform our analysis and show the fidelity improvements in three different regimes: small-size circuits on real devices, medium-size circuits on noise simulations, and large-size circuits on analytical models. Using a set of NISQ benchmarks, we show that QGo can reduce the number of CNOT gates by 29.9% on average and up to 50% when compared with industrial compilers such as t|ket>. When executed on the IBM Athens system, shorter depth leads to higher circuit fidelity. We also demonstrate the scalability of our QGo technique to optimize circuits of 60+ qubits. Our technique is the first demonstration of successfully employing and scaling synthesis in the compilation toolchain for large circuits. Overall, our approach is robust for direct incorporation in production compiler toolchains.
- Published
- 2020
25. Life cycle aware computing: reusing silicon technology
- Author
-
Oliver, John Y., Amirtharajah, Rajeevan, Akella, Venkatesh, Geyer, Roland, and Chong, Frederic T.
- Subjects
Computer industry ,Microcomputer industry ,Green technology -- Methods ,Computer industry -- Energy use - Published
- 2007
26. Cache coherence in intelligent memory systems
- Author
-
Keen, Diana, Oskin, Mark, Hensley, Justin, and Chong, Frederic T.
- Subjects
Semiconductor memory ,DRAM ,Memory (Computers) -- Research ,Dynamic random access memory -- Research ,Dynamic cell -- Research - Published
- 2003
27. $O(N^3)$ Measurement Cost for Variational Quantum Eigensolver on Molecular Hamiltonians
- Author
-
Gokhale, Pranav and Chong, Frederic T.
- Subjects
Quantum Physics ,FOS: Physical sciences ,Quantum Physics (quant-ph) - Abstract
Variational Quantum Eigensolver (VQE) is a promising algorithm for near-term quantum machines. It can be used to estimate the ground state energy of a molecule by performing separate measurements of $O(N^4)$ terms. Several recent papers observed that this scaling may be reducible to $O(N^3)$ by partitioning the terms into linear-sized commuting families that can be measured simultaneously. We confirm these empirical observations by studying the MIN-COMMUTING-PARTITION problem at the level of the fermionic Hamiltonian and its encoding into qubits. Moreover, we provide a fast, pre-computable procedure for creating linearly-sized commuting partitions by solving a round-robin scheduling problem via flow networks., 5 pages, 3 figures
- Published
- 2019
28. Amplitude-Aware Lossy Compression for Quantum Circuit Simulation
- Author
-
Wu, Xin-Chuan, Di, Sheng, Cappello, Franck, Finkel, Hal, Alexeev, Yuri, and Chong, Frederic T.
- Subjects
FOS: Computer and information sciences ,Quantum Physics ,Emerging Technologies (cs.ET) ,Computer Science::Emerging Technologies ,FOS: Physical sciences ,Computer Science - Emerging Technologies ,Quantum Physics (quant-ph) - Abstract
Classical simulation of quantum circuits is crucial for evaluating and validating the design of new quantum algorithms. However, the number of quantum state amplitudes increases exponentially with the number of qubits, leading to the exponential growth of the memory requirement for the simulations. In this paper, we present a new data reduction technique to reduce the memory requirement of quantum circuit simulations. We apply our amplitude-aware lossy compression technique to the quantum state amplitude vector to trade the computation time and fidelity for memory space. The experimental results show that our simulator only needs 1/16 of the original memory requirement to simulate Quantum Fourier Transform circuits with 99.95% fidelity. The reduction amount of memory requirement suggests that we could increase 4 qubits in the quantum circuit simulation comparing to the simulation without our technique. Additionally, for some specific circuits, like Grover's search, we could increase the simulation size by 18 qubits., 6pages, 6 figures. The 4th International Workshop on Data Reduction for Big Scientific Data (DRBSD-4)
- Published
- 2018
29. Ions, Atoms, and Bits: An Architectural Approach to Quantum Computing
- Author
-
Copsey, Dean, Oskin, Mark, and Chong, Frederic T.
- Published
- 2004
- Full Text
- View/download PDF
30. Emerging Technologies for Quantum Computing.
- Author
-
Baker, Jonathan M. and Chong, Frederic T.
- Subjects
- *
QUANTUM computing , *ASTRONAUTICS , *PROOF of concept , *SCALABILITY - Abstract
Despite promising proof of concept demonstrations, currently available quantum hardware suffers from fundamental scalability limitations. The field is relatively new and it is imperative to consider emerging technologies in the space and evaluate their unique tradeoff spaces to determine how to best close the gap between current devices and target applications. Here, we explore three recent developments on this front. First, we consider extensions to currently available hardware, which allow the use of higher level states, beyond the usual binary, which when used temporarily can confer circuit-level advantage. Second, we consider the use of superconducting resonant cavities to reduce hardware requirements to implement quantum error correction protocols. Finally, we consider the use of neutral atoms, which offer unique strengths and weaknesses. It is valuable to evaluate new technology early and often to determine the best path toward scalability. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
31. Virtual Logical Qubits: A Compact Architecture for Fault-Tolerant Quantum Computing.
- Author
-
Baker, Jonathan M., Duckering, Casey, Schuster, David I., and Chong, Frederic T.
- Subjects
FAULT-tolerant computing ,QUBITS ,LOGIC circuits ,SUPERCONDUCTING circuits ,QUANTUM computing - Abstract
Fault-tolerant quantum computing is required to execute many of the most promising quantum applications. In recent years, numerous error correcting codes, such as the surface code, have emerged which are well suited for current and future limited connectivity 2-D devices. We find quantum memory, particularly resonant cavities with transmon qubits arranged in a 2.5-D architecture, can efficiently implement surface codes with around 20× fewer transmons via this work. We virtualize 2-D memory addresses by storing the code in layers of qubit memories connected to each transmon. Distributing logical qubits across many memories has minimal impact on fault tolerance and results in substantially more efficient logical operations. Virtualized logical qubit (VLQ) systems can achieve fault tolerance comparable to conventional 2-D transmon-only architectures while putting within reach a proof-of-concept experimental demonstration of around ten logical qubits, requiring only 11 transmons and 9 attached cavities. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
32. Resource-Efficient Quantum Computing by Breaking Abstractions.
- Author
-
Shi, Yunong, Gokhale, Pranav, Murali, Prakash, Baker, Jonathan M., Duckering, Casey, Ding, Yongshan, Brown, Natalie C., Chamberland, Christopher, Javadi-Abhari, Ali, Cross, Andrew W., Schuster, David I., Brown, Kenneth R., Martonosi, Margaret, and Chong, Frederic T.
- Subjects
QUANTUM computing ,QUANTUM computers ,COMPUTER architecture ,LOGIC circuits ,SOFTWARE architecture ,COMPUTERS - Abstract
Building a quantum computer that surpasses the computational power of its classical counterpart is a great engineering challenge. Quantum software optimizations can provide an accelerated pathway to the first generation of quantum computing (QC) applications that might save years of engineering effort. Current quantum software stacks follow a layered approach similar to the stack of classical computers, which was designed to manage the complexity. In this review, we point out that greater efficiency of QC systems can be achieved by breaking the abstractions between these layers. We review several works along this line, including two hardware-aware compilation optimizations that break the quantum instruction set architecture (ISA) abstraction and two error-correction/information-processing schemes that break the qubit abstraction. Last, we discuss several possible future directions. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
33. An updated LLVM-based quantum research compiler with further OpenQASM support.
- Author
-
Litteken, Andrew, Fan, Yung-Ching, Singh, Devina, Martonosi, Margaret, and Chong, Frederic T
- Published
- 2020
- Full Text
- View/download PDF
34. Quantum Computer Systems: Research for Noisy Intermediate-Scale Quantum Computers.
- Author
-
Yongshan Ding and Chong, Frederic T.
- Published
- 2020
- Full Text
- View/download PDF
35. Extending the Frontier of Quantum Computers With Qutrits.
- Author
-
Gokhale, Pranav, Baker, Jonathan M., Duckering, Casey, Chong, Frederic T., Brown, Natalie C., and Brown, Kenneth R.
- Subjects
QUANTUM computers ,QUANTUM computing ,QUANTUM gates ,LOGIC circuits ,INTEGRATING circuits - Abstract
We advocate for a fundamentally different way to perform quantum computation by using three-level qutrits instead of qubits. In particular, we substantially reduce the resource requirements of quantum computations by exploiting a third state for temporary variables (ancilla) in quantum circuits. Past work with qutrits has demonstrated only constant factor improvements, owing to the log2(3) binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic runtime decomposition of the Generalized Toffoli gate using no ancilla---an exponential improvement over the best qubit-only equivalent. Our approach features a 70x improvement in total two-qudit gate count over the qubit-only decomposition. This results in improvements for important algorithms for arithmetic and QRAM. Simulation results under realistic noise models indicate over 90% mean reliability (fidelity) for our circuit, versus under 30% for the qubit-only baseline. These results suggest that qutrits offer a promising path toward extending the frontier of quantum computers. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
36. Use cases of lossy compression for floating-point data in scientific data sets.
- Author
-
Cappello, Franck, Di, Sheng, Li, Sihuan, Liang, Xin, Gok, Ali Murat, Tao, Dingwen, Yoon, Chun Hong, Wu, Xin-Chuan, Alexeev, Yuri, Chong, Frederic T, Dongarra, Jack, and Tourancheau, Bernard
- Subjects
LOSSY data compression ,DATA compression ,COMPUTER systems ,DATA warehousing ,DATA reduction ,IMAGE compression ,HIGH performance computing - Abstract
Architectural and technological trends of systems used for scientific computing call for a significant reduction of scientific data sets that are composed mainly of floating-point data. This article surveys and presents experimental results of currently identified use cases of generic lossy compression to address the different limitations of scientific computing systems. The article shows from a collection of experiments run on parallel systems of a leadership facility that lossy data compression not only can reduce the footprint of scientific data sets on storage but also can reduce I/O and checkpoint/restart times, accelerate computation, and even allow significantly larger problems to be run than without lossy compression. These results suggest that lossy compression will become an important technology in many aspects of high performance scientific computing. Because the constraints for each use case are different and often conflicting, this collection of results also indicates the need for more specialization of the compression pipelines. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
37. Gate-level information-flow tracking for secure architectures
- Author
-
Tiwari, Mohit, Li, Xun, Wassel, Hassan M.G., Mazloom, Bita, Mysore, Shashidhar, Chong, Frederic T., and Sherwood, Timothy
- Subjects
Processor architecture ,Network access ,Processor architecture -- Research ,Access control (Computers) -- Research - Published
- 2010
38. Applying Design-Space Exploration to Quantum Architectures.
- Author
-
Chong, Frederic T.
- Subjects
- *
QUANTUM computers , *COMPUTER architecture - Abstract
An article on the scaling trapped-ion quantum computer architecture is introduced.
- Published
- 2022
- Full Text
- View/download PDF
39. Thermal-aware, heterogeneous materials for improved energy and reliability in 3D PCM architectures.
- Author
-
Saadeldeen, Heba, Deng, Zhaoxia, Sherwood, Timothy, and Chong, Frederic T.
- Published
- 2017
- Full Text
- View/download PDF
40. Quick-and-Dirty: An Architecture for High-Performance Temporary Short Writes in MLC PCM.
- Author
-
Zhang, Mingzhe, Zhang, Lunkai, Jiang, Lei, Chong, Frederic T., and Liu, Zhiyong
- Subjects
DYNAMIC random access memory ,PULSE-code modulation - Abstract
MLC PCM provides high-density data storage and extended data retention; therefore it is a promising alternative for DRAM main memory. However, its low write performance is a major obstacle to commercialization. One opportunity for improving the latency of MLC PCM writes is to use fewer SET iterations in a single write. Unfortunately, this comes with a cost: the data written by these short writes have remarkably shorter retentions and thus need frequent refreshes. As a result, it is impractical to use these short-latency, short-retention writes globally. In this paper, we analyze the temporal behavior of write operations in typical applications and show that the write operations are bursty in nature, that is, during some time intervals the memory is subject to a large number of writes, while during other time intervals there hardly any memory operations take place. Based on this observation, we propose Quick-and-Dirty (QnD), a lightweight scheme to improve the performance of MLC PCM. When the write performance becomes the system bottleneck, QnD performs some write operations using the short-latency, short-retention write mode. Then, when the memory system is relatively quiet, QnD uses idle-memory intervals to refresh the data written by short-latency, short-retention writes in order to mitigate the short retention problem. Our experimental results show that QnD improves performance by 30.9 percent on geometric mean while still providing acceptable memory lifetime (7.58 years on geometric mean). We also provide sensitivity studies of the aggressiveness, memory coverage and granularity of QnD technique. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
41. Comparing the Overhead of Topological and Concatenated Quantum Error Correction
- Author
-
Suchara, Martin, Faruque, Arvin, Lai, Ching-Yi, Paz, Gerardo, Chong, Frederic T., and Kubiatowicz, John
- Subjects
Computer Science::Hardware Architecture ,Quantum Physics ,Computer Science::Emerging Technologies ,FOS: Physical sciences ,Quantum Physics (quant-ph) - Abstract
This work compares the overhead of quantum error correction with concatenated and topological quantum error-correcting codes. To perform a numerical analysis, we use the Quantum Resource Estimator Toolbox (QuRE) that we recently developed. We use QuRE to estimate the number of qubits, quantum gates, and amount of time needed to factor a 1024-bit number on several candidate quantum technologies that differ in their clock speed and reliability. We make several interesting observations. First, topological quantum error correction requires fewer resources when physical gate error rates are high, white concatenated codes have smaller overhead for physical gate error rates below approximately 10E-7. Consequently, we show that different error-correcting codes should be chosen for two of the studied physical quantum technologies - ion traps and superconducting qubits. Second, we observe that the composition of the elementary gate types occurring in a typical logical circuit, a fault-tolerant circuit protected by the surface code, and a fault-tolerant circuit protected by a concatenated code all differ. This also suggests that choosing the most appropriate error correction technique depends on the ability of the future technology to perform specific gates efficiently.
- Published
- 2013
42. Quantum Computing for Enhancing Grid Security.
- Author
-
Eskandarpour, Rozhin, Gokhale, Pranav, Khodaei, Amin, Chong, Frederic T., Passo, Aleksi, and Bahramirad, Shay
- Subjects
QUANTUM computing ,GRID computing ,ELECTRIC power distribution grids - Abstract
This paper introduces quantum computing as a necessary and viable tool in addressing the needs of a modernized power grid. The application of quantum computing in enhancing physical security of the grid – an increasingly difficult problem to solve– is investigated. A comparative study based on mathematically proven computing performance measures shows the merits of the proposed method and further unveils the potential benefits of quantum computing in improving grid performance. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
43. Herniated Hash Tables.
- Author
-
Deng, Zhaoxia, Zhang, Lunkai, Franklin, Diana, and Chong, Frederic T.
- Published
- 2015
- Full Text
- View/download PDF
44. Impact of Future Technologies on Architecture.
- Author
-
Mudge, Trevor, Chong, Frederic T., Markov, Igor L., Sendag, Resit, Yi, Joshua J., and Chiou, Derek
- Subjects
- *
COMPUTER architecture , *COMPUTER engineering , *QUANTUM computing , *TECHNOLOGICAL innovations - Published
- 2016
- Full Text
- View/download PDF
45. Characterizing the performance effect of trials and rotations in applications that use Quantum Phase Estimation.
- Author
-
Patil, Shruti, JavadiAbhari, Ali, Chiang, Chen-Fu, Heckey, Jeff, Martonosi, Margaret, and Chong, Frederic T.
- Published
- 2014
- Full Text
- View/download PDF
46. ReDHiP: Recalibrating Deep Hierarchy Prediction for Energy Efficiency.
- Author
-
Li, Xun, Franklin, Diana, Bianchini, Ricardo, and Chong, Frederic T.
- Published
- 2014
- Full Text
- View/download PDF
47. Lemonade from Lemons.
- Author
-
Deng, Zhaoxia, Feldman, Ariel, Kurtz, Stuart A., and Chong, Frederic T.
- Published
- 2017
- Full Text
- View/download PDF
48. Compiler Management of Communication and Parallelism for Quantum Computation.
- Author
-
Heckey, Jeff, Patil, Shruti, JavadiAbhari, Ali, Holmes, Adam, Kudrow, Daniel, Brown, Kenneth R., Franklin, Diana, Chong, Frederic T., and Martonosi, Margaret
- Published
- 2015
- Full Text
- View/download PDF
49. Quantum Computing for Computer Architects
- Author
-
Metodi, Tzvetan S., Chong, Frederic T., Metodi, Tzvetan S., and Chong, Frederic T.
- Subjects
- Computer architecture, Quantum computers
- Abstract
Quantum computation may seem to be a topic for science fiction, but small quantum computers have existed for several years and larger machines are on the drawing table. These efforts have been fueled by a tantalizing property: while conventional computers employ a binary representation that allows computational power to scale linearly with resources at best, quantum computations employ quantum phenomena that can interact to allow computational power that is exponential in the number of'quantum bits'in the system. Quantum devices rely on the ability to control and manipulate binary data stored in the phase information of quantum wave functions that describe the electronic states of individual atoms or the polarization states of photons. While existing quantum technologies are in their infancy, we shall see that it is not too early to consider scalability and reliability. In fact, such considerations are a critical link in the development chain of viable device technologies capable of orchestrating reliable control of tens of millions quantum bits in a large-scale system. The goal of this lecture is to provide architectural abstractions common to potential technologies and explore the systemslevel challenges in achieving scalable, fault-tolerant quantum computation. The central premise of the lecture is directed at quantum computation (QC) architectural issues. We stress the fact that the basic tenet of large-scale quantum computing is reliability through system balance: the need to protect and control the quantum information just long enough for the algorithm to complete execution. To architectQCsystems, onemust understand what it takes to design and model a balanced, fault-tolerant quantum architecture just as the concept of balance drives conventional architectural design. For example, the register file depth in classical computers is matched to the number of functional units, the memory bandwidth to the cache miss rate, or the interconnect bandwidth matched to the compute power of each element of a multiprocessor. We provide an engineering-oriented introduction to quantum computation and provide an architectural case study based upon experimental data and future projection for ion-trap technology.We apply the concept of balance to the design of a quantum computer, creating an architecture model that balances both quantum and classical resources in terms of exploitable parallelism in quantum applications. From this framework, we also discuss the many open issues remaining in designing systems to perform quantum computation.
- Published
- 2006
50. SurfNoC.
- Author
-
Wassel, Hassan M. G., Gao, Ying, Oberg, Jason K., Huffmire, Ted, Kastner, Ryan, Chong, Frederic T., and Sherwood, Timothy
- Published
- 2013
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.