Generalized Boolean Functions and Quantum Circuits on IBM-Q

被引：0

作者：

Gangopadhyay, Sugata ^{[1
]}

Poonia, Vishvendra Singh ^{[2
]}

Aggarwal, Daattavya ^{[3
]}

Parekh, Rhea ^{[3
]}

机构：

[1] Indian Inst Technol Roorkee, Dept Comp Sci & Engn, Roorkee, Uttar Pradesh, India

[2] Indian Inst Technol Roorkee, Dept Elect & Commun Engn, Roorkee, Uttar Pradesh, India

[3] Indian Inst Technol Roorkee, Dept Phys, Roorkee, Uttar Pradesh, India

来源：

2019 10TH INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND NETWORKING TECHNOLOGIES (ICCCNT) | 2019年

关键词：

Generalized boolean functions; quantum gates; quantum circuits; quantum computation;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We explicitly derive a connection between quantum circuits utilising IBM's quantum gate set and multivariate quadratic polynomials over integers modulo 8. We demonstrate that the action of a quantum circuit over input qubits can be written as generalized Walsh-Hadamard transform. Here, we derive the polynomials corresponding to implementations of the Swap gate and Toffoli gate using IBM-Q gate set.

引用

页数：6

共 50 条

[31] On the q-bentness of Boolean functions
Chen, Zhixiong
Gu, Ting
Klapper, Andrew
DESIGNS CODES AND CRYPTOGRAPHY, 2019, 87 (01) : 163 - 171
[32] Computing Boolean functions by polynomials and threshold circuits
Krause, M
Pudlák, P
COMPUTATIONAL COMPLEXITY, 1998, 7 (04) : 346 - 370
[33] On the Complexity and Depth of Embedded in Boolean Cube Circuits That Implement Boolean Functions
S. A. Lozhkin
E. L. Dovgalyuk
O. A. Sadovnikov
Moscow University Computational Mathematics and Cybernetics, 2018, 42 (3) : 138 - 144
[34] Polynomial threshold functions and Boolean threshold circuits
Hansen, Kristoffer Arnsfelt
Podolskii, Vladimir V.
INFORMATION AND COMPUTATION, 2015, 240 : 56 - 73
[35] Minimal Contact Circuits for a Sequence of Boolean Functions
N. P. Red’kin
Mathematical Notes, 2021, 110 : 156 - 158
[36] Minimal Contact Circuits for a Sequence of Boolean Functions
Red'kin, N. P.
MATHEMATICAL NOTES, 2021, 110 (1-2) : 156 - 158
[37] Mapping Quantum Circuits in IBM Q Devices Using Progressive Qubit Assignment for Global Ordering
Chhangte, Lalengmawia
Chakrabarty, Alok
NEW GENERATION COMPUTING, 2022, 40 (01) : 311 - 338
[38] Mapping Quantum Circuits in IBM Q Devices Using Progressive Qubit Assignment for Global Ordering
Lalengmawia Chhangte
Alok Chakrabarty
New Generation Computing, 2022, 40 : 311 - 338
[39] Using IBM-Q to study and visualize the ground state properties of the Su-Schrieffer-Heeger model
Samaroo, Aditya
McGuigan, Michael
2018 NEW YORK SCIENTIFIC DATA SUMMIT (NYSDS), 2018,
[40] Quantum Boolean circuits are 1-testable
Chou, Yao-Hsin
Tsai, I-Ming
Kuo, Sy-Yen
IEEE TRANSACTIONS ON NANOTECHNOLOGY, 2008, 7 (04) : 484 - 492

← 1 2 3 4 5 →