Quantum circuit design search

George A. Kevrekidis

Matt Lourens, Ilya Sinayskiy, Daniel K. Park +2 more

Abstract Quantum circuit algorithms often require architectural design choices analogous to those made in constructing neural and tensor networks. These tend to be hierarchical, modular and exhibit repeating patterns. Neural Architecture Search (NAS) attempts to automate neural network design through learning network architecture and achieves state-of-the-art performance. We propose a framework for representing quantum circuit architectures using techniques from NAS, which enables search space design and architecture search. We use this framework to justify the importance of circuit architecture in quantum machine learning by generating a family of Quantum Convolutional Neural Networks (QCNNs) and evaluating them on a music genre classification dataset, GTZAN. Furthermore, we employ a genetic algorithm to perform Quantum Phase Recognition (QPR) as an example of architecture search with our representation. Finally, we implement the framework as an open-source Python package to enable dynamic circuit creation and facilitate circuit search space design for NAS.

Yi-Lin Ju, I-Ming Tsai, Sy‐Yen Kuo

In this paper, we show how quantum Boolean circuits can be used to implement the oracle and the inversion-about-average function in Grover's search algorithm. Before illustrating how this can be done, we present the circuit design principle using the satisfiability (SAT) problem as an example. Then, based on this principle, we show the quantum circuits for two different kinds of applications. The first one is searching a phone book. Although this is a typical example of Grover's algorithm, we show that it is impractical as a real-world application. As the second application, we give the quantum circuits for a more practical application-breaking a symmetric cryptosystem. Although these two applications have quite different types of search criteria, they are both one-way functions and the proposed circuits can actually be generalized to any such problems. In this perspective, we conclude this paper by proposing a template of quantum circuits that is capable of searching the solution of a certain class of one-way functions.

Fatma Hamzaoui, Roselyne Chotin-Avot, Mohsen Machhout +2 more

P. Saravanan, J. Jenitha, S. R. Aasish +1 more

Quantum computers will have a significant impact on the security aspects of many conventional cryptographic algorithms as the quantum circuit implementation of the cryptographic algorithms can be attacked with the help of Grover’s key search algorithm. This work proposes quantum circuit design of RECTANGLE lightweight cipher for 80-bit and 128-bit key variants. All the individual modules of the cipher are designed with minimal quantum resources and finally they are integrated together to build the complete quantum circuit. The quantum circuit synthesis is performed with Toffoli family of quantum gates. The proposed design outperforms the existing design by achieving low-latency. The quantum resources are also estimated to mount the quantum attack by using Grover’s key search algorithm.

Masahiro Fujita, Yusuke Kimura