Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Giulia Meuli"'
Publikováno v:
npj Quantum Information, Vol 8, Iss 1, Pp 1-11 (2022)
Abstract Quantum compilation is the task of translating a high-level description of a quantum algorithm into a sequence of low-level quantum operations. We propose and motivate the use of Xor-And-Inverter Graphs (XAG) to specify Boolean functions for
Externí odkaz:
https://doaj.org/article/fe0da2f810a346719af6844f4aef85d3
Autor:
Eric Mlinar, Stephen Whiteley, Anton Belov, Song Chen, Luca Amaru, Tong Liu, Yalan Zhang, Taufik Arifin, Min Pan, Troy Barbee, Rajinder Singh, Amir Ajami, Danny Rawlings, Giulia Meuli, Rajesh Kumar, Arturo Salz, Scott Chase, Jamil Kawa
Publikováno v:
IEEE Transactions on Applied Superconductivity. 33:1-7
Autor:
Giulia Meuli, Vinicius Possani, Rajinder Singh, Siang-Yun Lee, Alessandro Tempia Calvino, Dewmini Sudara Marakkalage, Patrick Vuillod, Luca Amaru, Scott Chase, Jamil Kawa, Giovanni De Micheli
Publikováno v:
2022 Design, Automation & Test in Europe Conference & Exhibition (DATE).
Adiabatic superconducting devices are promising candidates to develop high-speed/low-power electronics. Advances in physical technology must be matched with a systematic development of comprehensive design and simulation tools to bring superconductin
Publikováno v:
QPL
We present a completely automatic synthesis framework for oracle functions, a central part in many quantum algorithms. The proposed framework for resource-constrained oracle synthesis (ROS) is a LUT-based hierarchical method in which every step is sp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d404994b2b0d3293a41f97949304bed
http://arxiv.org/abs/2005.00211
http://arxiv.org/abs/2005.00211
Approximation errors must be taken into account when compiling quantum programs into a low-level gate set. We present a methodology that tracks such errors automatically and then optimizes accuracy parameters to guarantee a specified overall accuracy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac783dc855f0a14758d32c3fdcb4f65a
Publikováno v:
Reversible Computation ISBN: 9783030214999
RC
RC
Exclusive-or sum-of-products (ESOP) expressions are used as intermediate representations in quantum circuit synthesis flows, and their complexity impacts the number of gates of the resulting circuits. Many state-of-the-art techniques focus on minimiz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c35cd2d425ef05937893a301235c8f8d
https://doi.org/10.1007/978-3-030-21500-2_12
https://doi.org/10.1007/978-3-030-21500-2_12
Publikováno v:
ICCAD
We present a constructive method to create quantum circuits that implement oracles $|x\rangle|y\rangle|0\rangle^k \mapsto |x\rangle|y \oplus f(x)\rangle|0\rangle^k$ for $n$-variable Boolean functions $f$ with low $T$-count. In our method $f$ is given
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ca2880f1fe614e2b9ede2eb015c7ac9
Publikováno v:
2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)
Currently, there is a large research interest and a significant economical effort to build the first practical quantum computer. Such quantum computers promise to exceed the capabilities of conventional computers in fields such as computational chemi
Autor:
Fereshte Mozafari, Mathias Soeken, Giulia Meuli, Heinz Riener, Bruno Schmitt, Giovanni De Micheli
Publikováno v:
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences. 378:20190161
Quantum compilation is the task of translating a quantum algorithm implemented in a high-level quantum programming language into a technology-dependent instructions flow for a physical quantum computer. To tackle the large gap between the quantum pro
Publikováno v:
DATE
We propose a flow for automated quantum compila- tion. Our flow takes a Boolean function implemented in Python as input and translates it into a format appropriate for reversible logic synthesis. We focus on two quantum compilation tasks: uniform sta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::897a047dab47937a4faa77bc50d5bfef
https://infoscience.epfl.ch/record/283284
https://infoscience.epfl.ch/record/283284