Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Davidson, D. Landskov, B. Shriver, P. Mallett (1981)
Some Experiments in Local Microcode Compaction for Horizontal MachinesIEEE Transactions on Computers, C-30
D. Maslov, S. Falconer, M. Mosca (2007)
Quantum Circuit PlacementIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 27
D. Leibrandt, J. Labaziewicz, R. Clark, I. Chuang, R. Epstein, C. Ospelkaus, J. Wesenberg, J. Bollinger, D. Leibfried, D. Wineland, D. Stick, J. Sterk, C. Monroe, C. Pai, Yee Low, R. Frahm, R. Slusher (2009)
Demonstration of a scalable, multiplexed ion trap for quantum information processingQuantum Inf. Comput., 9
Tzvetan Metodi, D. Thaker, Andrew Cross, F. Chong, I. Chuang (2006)
Scheduling physical operations in a quantum information processor, 6244
G. Micheli (1994)
Synthesis and Optimization of Digital Circuits
S. Balensiefer, Lucas Kreger-Stickles, M. Oskin (2005)
An evaluation framework and instruction set architecture for ion-trap based quantum micro-architectures32nd International Symposium on Computer Architecture (ISCA'05)
L. McMurchie, C. Ebeling (1995)
PathFinder: A Negotiation-Based Performance-Driven Router for FPGAsThird International ACM Symposium on Field-Programmable Gate Arrays
E. Knill, R. Laflamme, W. Zurek (1998)
Resilient Quantum ComputationScience, 279
Daniel Cordova, Osman Guzide (1995)
Quantum computers, 270
N. Mohammadzadeh, M. Zamani, M. Sedighi (2011)
Auxiliary qubit selection: a physical synthesis technique for quantum circuitsQuantum Information Processing, 10
P. Schindler, J. Barreiro, T. Monz, V. Nebendahl, D. Nigg, M. Chwalla, M. Hennrich, R. Blatt (2011)
Experimental Repetitive Quantum Error CorrectionScience, 332
(2011)
Quantum Computation and Quantum Information: 10th Anniversary Edition, Anniversary edn
M. Whitney, Nemanja Isailovic, Yatish Patel, J. Kubiatowicz (2009)
A fault tolerant, area efficient architecture for Shor's factoring algorithm
Myung-Chul Kim, Dongjin Lee, I. Markov (2010)
SimPL: An Effective Placement AlgorithmIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 31
V. Shende, I. Markov (2008)
On the CNOT-cost of TOFFOLI gatesQuantum Inf. Comput., 9
S. Balensiefer, Lucas Kreger-Stickles, M. Oskin (2005)
QUALE: quantum architecture layout evaluator, 5815
J. Cirac, A. Ekert, C. Macchiavello (1998)
Optimal Purification of Single QubitsPhysical Review Letters, 82
J. Preskill (1997)
Reliable quantum computersProceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 454
P. Paulin, J. Knight (1989)
Force-directed scheduling for the behavioral synthesis of ASICsIEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 8
Mehdi Saeedi, I. Markov (2011)
Synthesis and optimization of reversible circuits—a surveyACM Comput. Surv., 45
MA Nielsen, IL Chuang (2011)
Quantum Computation and Quantum Information: 10th Anniversary Edition
W. Hensinger, S. Olmschenk, D. Stick, D. Hucul, M. Yeo, M. Acton, L. Deslauriers, C. Monroe, J. Rabchuk (2005)
T-junction ion trap array for two-dimensional ion shuttling, storage, and manipulationApplied Physics Letters, 88
N. Quinn, M. Breuer (1979)
A forced directed component placement procedure for printed circuit boardsIEEE Transactions on Circuits and Systems, 26
M. Whitney, Nemanja Isailovic, Yatish Patel, J. Kubiatowicz (2007)
Automated generation of layout and control for quantum circuits
M. Rowej, A. Ben-Kish, B. Demarco, D. Leibfried, V. Meyer, J. Beall, J. Britton, J. Hughes, W. Itano, B. Jelenković, C. Langer, T. Rosenband, D. Wineland (2002)
Transport of quantum states and separation of ions in a dual RF ion trapQuantum Inf. Comput., 2
W. Wootters, W. Wootters, W. Zurek (1982)
A single quantum cannot be clonedNature, 299
Tzvetan Metodi, D. Thaker, Andrew Cross (2005)
A quantum logic array microarchitecture: scalable quantum data movement and computation38th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'05)
S Balensiefer, L Kregor-Stickles, M Oskin (2005)
An evaluation framework and instruction set architecture for ion-trap based quantum micro-architecturesSIGARCH Comput. Archit. News, 33
M. Marek-Sadowska, Shen Lin (1989)
Timing driven placement1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers
(2007)
Handbook of Algorithms for VLSI Physical Automation
A. Steane (1996)
Multiple-particle interference and quantum error correctionProceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 452
M. Dousti, Massoud Pedram (2012)
Minimizing the latency of quantum circuits during mapping to the ion-trap circuit fabric2012 Design, Automation & Test in Europe Conference & Exhibition (DATE)
This paper presents a physical mapping tool for quantum circuits, which generates the optimal universal logic block (ULB) that can, on average, perform any logical fault-tolerant (FT) quantum operations with the minimum latency. The operation scheduling, placement, and qubit routing problems tackled by the quantum physical mapper are highly dependent on one another. More precisely, the scheduling solution affects the quality of the achievable placement solution due to resource pressures that may be created as a result of operation scheduling, whereas the operation placement and qubit routing solutions influence the scheduling solution due to resulting distances between predecessor and current operations, which in turn determines routing latencies. The proposed flow for the quantum physical mapper captures these dependencies by applying (1) a loose scheduling step, which transforms an initial quantum data flow graph into one that explicitly captures 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 latency, (2) a placement step, which uses timing-driven instruction placement to minimize the approximate routing latencies while making iterative calls to the aforesaid force-directed scheduler to correct scheduling levels of quantum operations as needed, and (3) a routing step that finds dynamic values of routing latencies for the qubits. 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 onto different ULB sizes and using information about the occurrence frequency of operations on critical paths of the target quantum algorithm to weigh these latencies. Experimental results show an average latency reduction of about 40 % compared to previous work.
Quantum Information Processing – Springer Journals
Published: Jan 25, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.