Access the full text.
Sign up today, get DeepDyve free for 14 days.
Brett Giles, P. Selinger (2012)
Exact synthesis of multi-qubit Clifford+T circuitsArXiv, abs/1212.0506
Mehdi Saeedi, Mona Arabzadeh, M. Zamani, M. Sedighi (2010)
Block-based quantum-logic synthesisArXiv, abs/1011.2159
V. Shende, S. Bullock, I. Markov (2004)
Minimal universal two-qubit controlled-NOT-based circuits (8 pages)Physical Review A, 69
Edinburgh Research Explorer Generalized Flow and Determinism in Measurement-based Quantum Computation
S. Bullock, I. Markov (2004)
Asymptotically optimal circuits for arbitrary n-qubit diagonal comutationsQuantum Inf. Comput., 4
R. Silva, E. Pius, E. Kashefi (2013)
Global Quantum Circuit OptimizationarXiv: Quantum Physics
V. Shende, I. Markov, S. Bullock (2004)
Smaller two-qubit circuits for quantum communication and computationProceedings Design, Automation and Test in Europe Conference and Exhibition, 2
A. Konak, D. Coit, Alice Smith (2006)
Multi-objective optimization using genetic algorithms: A tutorialReliab. Eng. Syst. Saf., 91
Maryam Eslamy, M. Houshmand, M. Zamani, M. Sedighi (2016)
Geometry-based signal shifting of one-way quantum computation measurement patterns2016 24th Iranian Conference on Electrical Engineering (ICEE)
A. Fowler (2004)
Constructing arbitrary Steane code single logical qubit fault-tolerant gatesQuantum Inf. Comput., 11
P. Walther, K. Resch, T. Rudolph, E. Schenck, E. Schenck, H. Weinfurter, V. Vedral, V. Vedral, V. Vedral, M. Aspelmeyer, A. Zeilinger (2005)
Experimental one-way quantum computingNature, 434
S. Bullock, I. Markov (2002)
Arbitrary two-qubit computation in 23 elementary gates
(2011)
Surface code quantum computing with error rates over 1
Charles Bennett, D. DiVincenzo, J. Smolin, W. Wootters (1996)
Mixed-state entanglement and quantum error correction.Physical review. A, Atomic, molecular, and optical physics, 54 5
V. Shende, S. Bullock, I. Markov (2005)
Synthesis of quantum logic circuitsProceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005., 1
Vadym Kliuchnikov, D. Maslov, M. Mosca (2012)
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gatesQuantum Inf. Comput., 13
N. Beaudrap, V. Danos, E. Kashefi (2006)
Phase map decompositions for unitariesarXiv: Quantum Physics
Jisho Miyazaki, Michal Hajduvsek, M. Murao (2013)
An analysis of the trade-off between spatial and temporal resources for measurement-based quantum computationPhysical Review A, 91
A. Broadbent, E. Kashefi (2007)
Parallelizing quantum circuitsTheor. Comput. Sci., 410
A. Steane (1996)
Error Correcting Codes in Quantum Theory.Physical review letters, 77 5
Ross Duncan, S. Perdrix (2010)
Rewriting Measurement-Based Quantum Computations with Generalised Flow
H. Briegel, H. Briegel, D. Browne, W. Dür, W. Dür, R. Raussendorf, M. Nest, M. Nest (2009)
Measurement-based quantum computationNature Physics, 5
A. Broadbent, J. Fitzsimons, E. Kashefi (2008)
Universal Blind Quantum Computation2009 50th Annual IEEE Symposium on Foundations of Computer Science
G. Cybenko (2001)
Reducing quantum computations to elementary unitary operationsComput. Sci. Eng., 3
T. Hogg, C. Mochon, W. Polak, E. Rieffel (1998)
TOOLS FOR QUANTUM ALGORITHMSInternational Journal of Modern Physics C, 10
A. Barenco, C. Bennett, R. Cleve, D. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, H. Weinfurter (1995)
Elementary gates for quantum computation.Physical review. A, Atomic, molecular, and optical physics, 52 5
M. Möttönen, J. Vartiainen, V. Bergholm, M. Salomaa (2004)
Quantum circuits for general multiqubit gates.Physical review letters, 93 13
J. Vartiainen, M. Möttönen, M. Salomaa (2003)
Efficient decomposition of quantum gates.Physical review letters, 92 17
D. Browne, H. Briegel (2006)
One-way Quantum Computation - a tutorial introductionarXiv: Quantum Physics
V. Shende, I. Markov, S. Bullock (2003)
Minimal Universal Two-qubit Quantum Circuits
(2010)
Quantum Computation and Quantum Information (10th anniversary ed.)
D. Deutsch (1989)
Quantum computational networksProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 425
Mona Arabzadeh, M. Houshmand, M. Sedighi, M. Zamani (2015)
Quantum-Logic Synthesis of Hermitian GatesACM Journal on Emerging Technologies in Computing Systems (JETC), 12
M. Houshmand, M. Zamani, M. Sedighi, Mona Arabzadeh (2014)
Decomposition of Diagonal Hermitian Quantum Gates Using Multiple-Controlled Pauli Z GatesACM Journal on Emerging Technologies in Computing Systems (JETC), 11
Stefanie Barz, J. Fitzsimons, E. Kashefi, P. Walther (2013)
Experimental verification of quantum computationNature Physics, 9
V. Shende, I. Markov (2008)
On the CNOT-cost of TOFFOLI gatesQuantum Inf. Comput., 9
M. Houshmand, M. Zamani, M. Sedighi, Mohammad Samavatian (2014)
Automatic translation of quantum circuits to optimized one-way quantum computation patternsQuantum Information Processing, 13
V. Danos, E. Kashefi, P. Panangaden (2004)
The measurement calculusJ. ACM, 54
E. Nikahd, M. Houshmand, M. Zamani, M. Sedighi (2016)
GOWQS: Graph-based one-way quantum computation simulator2016 24th Iranian Conference on Electrical Engineering (ICEE)
Mehdi Saeedi, I. Markov (2011)
Synthesis and optimization of reversible circuits—a surveyACM Comput. Surv., 45
R. Raussendorf, Jim Harrington, Kovid Goyal (2005)
A fault-tolerant one-way quantum computerAnnals of Physics, 321
R. Jozsa (2005)
An introduction to measurement based quantum computationarXiv: Quantum Physics
V. Danos, E. Kashefi, P. Panangaden (2005)
Parsimonious and robust realizations of unitary maps in the one-way modelPhysical Review A, 72
G. Vidal, C. Dawson (2003)
Universal quantum circuit for two-qubit transformations with three controlled-NOT gatesPhysical Review A, 69
E. Pius (2010)
Automatic Parallelisation of Quantum Circuits Using the Measurement Based Quantum Computing Model
E. Nikahd, M. Houshmand, M. Zamani, M. Sedighi (2012)
OWQS: One-Way Quantum Computation Simulator2012 15th Euromicro Conference on Digital System Design
R. Silva, E. Galvão (2012)
Compact quantum circuits from one-way quantum computationPhysical Review A, 88
F. Vatan, Colin Williams (2003)
Optimal Quantum Circuits for General Two-Qubit GatesPhysical Review A, 69
E. Nikahd, M. Houshmand, M. Zamani, M. Sedighi (2015)
One-way quantum computer simulationMicroprocess. Microsystems, 39
Chia-Chun Lin, A. Chakrabarti, N. Jha (2014)
FTQLS: Fault-Tolerant Quantum Logic SynthesisIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 22
V. Danos, E. Kashefi, P. Panangaden, S. Perdrix (2009)
Extended Measurement Calculus
Guang Song, A. Klappenecker (2002)
Optimal realizations of controlled unitary gatesQuantum Inf. Comput., 3
R. Raussendorf (2009)
MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATESInternational Journal of Quantum Information, 07
M. Mhalla, S. Perdrix (2007)
Finding Optimal Flows Efficiently
R. Raussendorf, D. Browne, H. Briegel (2003)
Measurement-based quantum computation on cluster statesPhysical Review A, 68
V. Bergholm, J. Vartiainen, M. Mottonen, M. Salomaa (2004)
Quantum circuits with uniformly controlled one-qubit gates (7 pages)Physical Review A, 71
A. Fowler, A. Stephens, Peter Groszkowski (2008)
High-threshold universal quantum computation on the surface codePhysical Review A, 80
D. Bacon (2005)
Operator quantum error-correcting subsystems for self-correcting quantum memoriesPhysical Review A, 73
Quantum Circuit Synthesis Targeting to Improve One-Way Quantum Computation Pattern Cost Metrics MAHBOOBEH HOUSHMAND, MEHDI SEDIGHI, MORTEZA SAHEB ZAMANI, and KOUROSH MARJOEI, Amirkabir University of Technology One-way quantum computation (1WQC) is a model of universal quantum computations in which a specific highly entangled state called a cluster state allows for quantum computation by single-qubit measurements. The needed computations in this model are organized as measurement patterns. The traditional approach to obtain a measurement pattern is by translating a quantum circuit that solely consists of CZ and J() gates into the corresponding measurement patterns and then performing some optimizations by using techniques proposed for the 1WQC model. However, in these cases, the input of the problem is a quantum circuit, not an arbitrary unitary matrix. Therefore, in this article, we focus on the first phase--that is, decomposing a unitary matrix into CZ and J() gates. Two well-known quantum circuit synthesis methods, namely cosine-sine decomposition and quantum Shannon decomposition are considered and then adapted for a library of gates containing CZ and J(), equipped with optimizations. By exploring the solution space of the combinations of these two methods in a bottom-up approach of dynamic programming, a multiobjective quantum circuit synthesis
ACM Journal on Emerging Technologies in Computing Systems (JETC) – Association for Computing Machinery
Published: May 21, 2017
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.