Related papers: Automated Quantum Algorithm Design using a Domain-…
Quantum neural networks are promising for a wide range of applications in the Noisy Intermediate-Scale Quantum era. As such, there is an increasing demand for automatic quantum neural architecture search. We tackle this challenge by…
With the rapid development of quantum computing, automatic verification of quantum circuits becomes more and more important. While several decision diagrams (DDs) have been introduced in quantum circuit simulation and verification, none of…
Considering the noise level limit, one crucial aspect for quantum machine learning is to design a high-performing variational quantum circuit architecture with small number of quantum gates. As the classical neural architecture search…
We investigate the potential of bio-inspired evolutionary algorithms for designing quantum circuits with specific goals, focusing on two particular tasks. The first one is motivated by the ideas of Artificial Life that are used to reproduce…
In this work, we develop a novel mathematical framework for universal digital quantum computation using algebraic probability theory. We rigorously define quantum circuits as finite sequences of elementary quantum gates and establish their…
A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum…
We introduce a new approach for quantum linear algebra based on quantum subspace states and present three new quantum machine learning algorithms. The first is a quantum determinant sampling algorithm that samples from the distribution…
The design of efficient quantum circuits is an important issue in quantum computing. It is in general a formidable task to find a highly optimized quantum circuit for a given unitary matrix. We propose a quantum circuit design method that…
We propose a protocol to construct the 35 $f$-controlled phase gates of a three-qubit refined Deutsch-Jozsa (DJ) algorithm, by using single-qubit $\sigma_z$ gates, two-qubit controlled phase gates, and two-target-qubit controlled phase…
Physical implementation of Quantum Information Processing (QIP) by liquid-state Nuclear Magnetic Resonance (NMR), using weakly coupled spin-1/2 nuclei of a molecule, is well established. Nuclei with spin$>$1/2 oriented in liquid crystalline…
We demonstrate that large language model (LLM) agents can autonomously perform tensor network simulations of quantum many-body systems, achieving approximately 90% success rate across representative benchmark tasks. Tensor network methods…
It is not possible, using standard lattice techniques in Euclidean space, to calculate the complete fermionic spectrum of a quantum field theory. Algorithms running on quantum computers have the potential to access the theory with real-time…
In the field of quantum computing, variational quantum algorithms (VQAs) represent a pivotal category of quantum solutions across a broad spectrum of applications. These algorithms demonstrate significant potential for realising quantum…
Quantum query complexity plays an important role in studying quantum algorithms, which captures the most known quantum algorithms, such as search and period finding. A query algorithm applies $U_tO_x\cdots U_1O_xU_0$ to some input state,…
The quantum circuit synthesis problem bridges quantum algorithm design and quantum hardware implementation in the Noisy Intermediate-Scale Quantum (NISQ) era. In quantum circuit synthesis problems, diagonal unitary synthesis plays a crucial…
Quantum compiling aims to construct a quantum circuit V by quantum gates drawn from a native gate alphabet, which is functionally equivalent to the target unitary U. It is a crucial stage for the running of quantum algorithms on noisy…
We develop genetic algorithms for searching quantum circuits, in particular stabilizer quantum error correction codes. Quantum codes equivalent to notable examples such as the 5-qubit perfect code, Shor's code, and the 7-qubit color code…
Finding a maximum or minimum is a fundamental building block in many mathematical models. Compared with classical algorithms, Durr, Hoyer's quantum algorithm (DHA) achieves quadratic speed. However, its key step, the quantum exponential…
We analyze three different quantum search algorithms, the traditional Grover's algorithm, its continuous-time analogue by Hamiltonian evolution, and finally the quantum search by local adiabatic evolution. We show that they are closely…
A new approach to the implementation of a quantum computer by high-resolution nuclear magnetic resonance (NMR) is described. The key feature is that two or more line-selective radio-frequency pulses are applied simultaneously. A three-qubit…