Filters








317 Hits in 7.6 sec

Minimizing the latency of quantum circuits during mapping to the ion-trap circuit fabric

M. J. Dousti, M. Pedram
2012 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE)  
One way to decrease the effect of noise (and hence, reduce the overhead of building fault tolerant quantum circuits) is to reduce the latency of the quantum circuit that runs on a quantum circuit.  ...  This algorithm, and the accompanying software tool, advances state-of-the-art in quantum CAD methodologies and methods while considering key characteristics and constraints of the ion-trap quantum circuit  ...  ACKNOWLEDGMENT The authors would like to thank Todd Brun for his valuable comments on the ion-trap fabric and recent advances in the quantum computing technologies.  ... 
doi:10.1109/date.2012.6176612 dblp:conf/date/DoustiP12 fatcat:7rql3qqe3zf2rggubimmzoua5i

Design of a universal logic block for fault-tolerant realization of any logic operation in trapped-ion quantum circuits

H. Goudarzi, M. J. Dousti, A. Shafaei, M. Pedram
2014 Quantum Information Processing  
In addition to the quantum physical mapper, an approach is presented to determine the single best ULB size for a target quantum circuit by examining the latency of different FT quantum operations mapped  ...  the no-cloning theorem of the quantum computing and then performs instruction scheduling based on a modified force-directed scheduling approach to minimize the resource contention and quantum circuit  ...  The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of IARPA  ... 
doi:10.1007/s11128-013-0725-3 fatcat:aq7sqkry7va3pc4gm47fvcbuxq

Automated Generation of Layout and Control for Quantum Circuits [article]

Mark Whitney, Nemanja Isailovic, Yatish Patel, John Kubiatowicz
2007 arXiv   pre-print
To motivate automated layout for quantum circuits, we investigate grid-based layouts and show a performance variance of four times as we vary grid structure and initial qubit placement.  ...  Finally, we show that our dataflow-based heuristic generates better layouts than the state-of-the-art automated grid-based layout and scheduling mechanism in terms of latency and potential pipelinability  ...  This enables the reuse gate locations within a quantum circuit. • Scalable ion trap systems will almost certainly be two-dimensional due to the difficulty of fabricating and controlling ion traps in a  ... 
arXiv:0704.0268v1 fatcat:wcckvinrz5hsvcdntwpotn7zky

Auxiliary qubit selection: a physical synthesis technique for quantum circuits

Naser Mohammadzadeh, Morteza Saheb Zamani, Mehdi Sedighi
2010 Quantum Information Processing  
Following that concept, in this paper we propose a new technique for physical synthesis using auxiliary qubit selection to improve the latency of quantum circuits.  ...  Our experimental results show that the proposed technique decreases the average latency objective of quantum circuits by about 11% for the attempted benchmarks.  ...  Acknowledgements We would like to thank Prof. D. Wineland and Prof. J. Kubiatowicz for their invaluable deliberations. Latency (µs)  ... 
doi:10.1007/s11128-010-0183-0 fatcat:szaoqvxaj5bzfbpu24etmjjike

Squash 2: A Hierarchical Scalable Quantum Mapper Considering Ancilla Sharing [article]

Mohammad Javad Dousti, Alireza Shafaei, Massoud Pedram
2015 arXiv   pre-print
We present a multi-core reconfigurable quantum processor architecture, called Requp, which supports a hierarchical approach to mapping a quantum algorithm while sharing physical and logical ancilla qubits  ...  Moreover, we introduce a scalable quantum mapper, called Squash 2, which divides a given quantum circuit into a number of quantum modules---each module is divided into k parts such that each part will  ...  Acknowledgements The authors would like to thank Professor Todd A. Brun for his valuable comments about the calculation of ancilla requirements for various QEC codes and operations.  ... 
arXiv:1512.07402v1 fatcat:jjowg6fturcs7g4v2cqgz5sjve

Automated generation of layout and control for quantum circuits

Mark Whitney, Nemanja Isailovic, Yatish Patel, John Kubiatowicz
2007 Proceedings of the 4th international conference on Computing frontiers - CF '07  
To motivate automated layout for quantum circuits, we investigate grid-based layouts and show a performance variance of four times as we vary grid structure and initial qubit placement.  ...  , but at the cost of some area.  ...  This enables the reuse gate locations within a quantum circuit. • Scalable ion trap systems will almost certainly be twodimensional due to the difficulty of fabricating and controlling ion traps in a third  ... 
doi:10.1145/1242531.1242546 dblp:conf/cf/WhitneyIPK07 fatcat:oppckzsnczgj5nvqloqedmxbxi

Squash

Mohammad Javad Dousti, Alireza Shafaei, Massoud Pedram
2014 Proceedings of the 24th edition of the great lakes symposium on VLSI - GLSVLSI '14  
Sharing the ancilla qubits among quantum operations (even though this sharing can increase the overall circuit latency) is important in order to curb the resource demand of the quantum algorithm.  ...  Moreover, quantum computation requires some type of quantum error correction coding to combat decoherence, which in turn results in a large number of ancilla qubits in the circuit.  ...  The authors would like to thank Professor Todd Brun for his valuable comments about the calculation of ancilla requirements for various QEC codes and operations.  ... 
doi:10.1145/2591513.2591523 dblp:conf/glvlsi/DoustiSP14 fatcat:7oicroa6ajgobm6iyn2tc4fu4q

LEQA

Mohammad Javad Dousti, Massoud Pedram
2013 Proceedings of the 50th Annual Design Automation Conference on - DAC '13  
This paper presents LEQA, a fast latency estimation tool for evaluating the performance of a quantum algorithm mapped to a quantum fabric.  ...  circuit fabric.  ...  Instead of mapping a quantum circuit directly to the quantum fabric, quantum circuit is mapped to this tiled architecture (see below).  ... 
doi:10.1145/2463209.2488786 dblp:conf/dac/DoustiP13 fatcat:vjhgmeep2vaw5mzrnayhc4pndi

Designing a Million-Qubit Quantum Computer Using a Resource Performance Simulator

Muhammad Ahsan, Rodney Van Meter, Jungsang Kim
2015 ACM Journal on Emerging Technologies in Computing Systems  
We show that a trapped-ion quantum computer designed with twice as many qubits and one-tenth of the baseline infidelity of the communication channel can factor a 2,048-bit integer in less than five months  ...  the breakdown of these metrics to highlight the performance bottlenecks and visualizing resource utilization to evaluate the adequacy of the chosen design.  ...  Unfortunately, the sizable trap chip envisioned in these studies is difficult to fabricate due to limitations of fabrication technology [Guise et al. 2014 ].  ... 
doi:10.1145/2830570 fatcat:6modrcdw2rdglcw6hp4zcwdyuu

Layout Optimization for Quantum Circuits with Linear Nearest Neighbor Architectures

Massoud Pedram, Alireza Shafaei
2016 IEEE Circuits and Systems Magazine  
More precisely, it addresses the problem of minimizing the number of required qubit reorderings (achieved by inserting explicit SWAP gates) when mapping a quantum circuit into a linear nearest neighbor  ...  Finally, a bubble sort algorithm is repeatedly employed to minimize the number of qubit reorderings that are required This paper is concerned with the physical design of quantum logic circuits.  ...  Acknowledgment It is our honor to dedicate this paper to the memory of Professor Ernest Kuh.  ... 
doi:10.1109/mcas.2016.2549950 fatcat:cijqe2jzzfacdelqmkdo6arulu

Quantum Computing: An Overview Across the System Stack [article]

Salonik Resch, Ulya R. Karpuzcu
2019 arXiv   pre-print
Much effort is being applied at all levels of the system stack, from the creation of quantum algorithms to the development of hardware devices.  ...  Quantum computers, if fully realized, promise to be a revolutionary technology. As a result, quantum computing has become one of the hottest areas of research in the last few years.  ...  Superconducting circuits cannot be moved, however ions in ion traps can be transported through a vacuum, and photons never stop moving.  ... 
arXiv:1905.07240v3 fatcat:ro3kgt6nfvd6fppdo4moisxwfm

Compiler Management of Communication and Parallelism for Quantum Computation

Jeff Heckey, Shruti Patil, Ali JavadiAbhari, Adam Holmes, Daniel Kudrow, Kenneth R. Brown, Diana Franklin, Frederic T. Chong, Margaret Martonosi
2015 SIGPLAN notices  
Quantum computing is limited, however, by the challenges of decoherence: i.e., a quantum state can only be maintained for short windows of time before it decoheres.  ...  This paper proposes the Multi-SIMD QC architecture and then proposes and evaluates effective schedulers to map benchmark descriptions onto Multi-SIMD architectures.  ...  Many researchers have contributed to our benchmarks, including John Black, Lukas Svec, Aram Harrow, Amlan Chakrabarti, Chen-Fu Chiang, Oana Catu and Mohammad Javad Dousti.  ... 
doi:10.1145/2775054.2694357 fatcat:sb66vo3gf5gcfdcrlbwc6ult5a

Compiler Management of Communication and Parallelism for Quantum Computation

Jeff Heckey, Shruti Patil, Ali JavadiAbhari, Adam Holmes, Daniel Kudrow, Kenneth R. Brown, Diana Franklin, Frederic T. Chong, Margaret Martonosi
2015 Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS '15  
Quantum computing is limited, however, by the challenges of decoherence: i.e., a quantum state can only be maintained for short windows of time before it decoheres.  ...  This paper proposes the Multi-SIMD QC architecture and then proposes and evaluates effective schedulers to map benchmark descriptions onto Multi-SIMD architectures.  ...  Many researchers have contributed to our benchmarks, including John Black, Lukas Svec, Aram Harrow, Amlan Chakrabarti, Chen-Fu Chiang, Oana Catu and Mohammad Javad Dousti.  ... 
doi:10.1145/2694344.2694357 dblp:conf/asplos/HeckeyPJHKBFCM15 fatcat:h5w7skxobrgfvkatjafy7abfdq

Compiler Management of Communication and Parallelism for Quantum Computation

Jeff Heckey, Shruti Patil, Ali JavadiAbhari, Adam Holmes, Daniel Kudrow, Kenneth R. Brown, Diana Franklin, Frederic T. Chong, Margaret Martonosi
2015 SIGARCH Computer Architecture News  
Quantum computing is limited, however, by the challenges of decoherence: i.e., a quantum state can only be maintained for short windows of time before it decoheres.  ...  This paper proposes the Multi-SIMD QC architecture and then proposes and evaluates effective schedulers to map benchmark descriptions onto Multi-SIMD architectures.  ...  Many researchers have contributed to our benchmarks, including John Black, Lukas Svec, Aram Harrow, Amlan Chakrabarti, Chen-Fu Chiang, Oana Catu and Mohammad Javad Dousti.  ... 
doi:10.1145/2786763.2694357 fatcat:k2ggawoqzfh3derltem67omu34

Assessing the Progress of Trapped-Ion Processors Towards Fault-Tolerant Quantum Computation

A. Bermudez, X. Xu, R. Nigmatullin, J. O'Gorman, V. Negnevitsky, P. Schindler, T. Monz, U. G. Poschinger, C. Hempel, J. Home, F. Schmidt-Kaler, M. Biercuk (+3 others)
2017 Physical Review X  
We apply this criterion to benchmark the ongoing effort in implementing QEC with topological color codes using trapped-ion quantum processors and, more importantly, to guide the future hardware developments  ...  A quantitative assessment of the progress of small prototype quantum processors towards fault-tolerant quantum computation is a problem of current interest in experimental and theoretical quantum information  ...  Additionally, idle ions also dephase during the time lapse of the stabilizer mapping.  ... 
doi:10.1103/physrevx.7.041061 fatcat:5sxxh7ynqbfllknu2fwkbz7zl4
« Previous Showing results 1 — 15 out of 317 results