Scalable algorithm simplification using quantum AND logic

Chu, Ji; He, Xiaoyu; Zhou, Yuxuan; Yuan, Jiahao; Zhang, Libo; Guo, Qian‐Hui; Hai, Yong-Ju; Han, Zhikun; Hu, Chang-Kang; Huang, W.; Jia, Hao; Jiao, Dawei; Liu, Yang; Ni, Zhongchu; Pan, X.; Qiu, Jiawei; Wei, Weiwei; Yang, Zusheng; Zhang, Jiajian; Zhida, Zhang,; Zou, Wanjing; Chen, Yuanzhen; Deng, Xiaowei; Deng, Xiu-Hao; Hu, Ling; Li, Jian; Tan, Dalong; Xu, Yuan; Yan, Tongxing; Sun, Xiaoming; Yan, Fei; Yu, Dapeng

doi:10.1038/s41567-022-01813-7

Cited by 31 publications

(8 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Meanwhile, early implementations of three-qubit gates [66][67][68] were generally slower and more prone to leakage and decoherence compared to the iToffoli gate employed here due to populating higher levels outside the qubit computational space. However, more recent implementations of three-qubit gates [40][41][42][43][44] have begun to address these challenges yielding fidelities approaching those of two-qubit gates. Further, they have been carried out on quantum devices with tens of qubits, suggesting their utility for larger-scale quantum devices.…”

Section: Discussionmentioning

confidence: 99%

“…This scheme constructs the electron-added and electron-removed states simultaneously by exploiting the probabilistic nature of the linear combination of unitaries (LCU) algorithm 39 . Recently developed high-fidelity multipartite gates [40][41][42][43][44] which would facilitate the execution of these algorithms have been reported. Implementation of frequency-domain response property calculations on quantum hardware with such gates would allow for a demonstration of their effectiveness on a representative problem of scientific relevance within the constraints of qubit number and circuit depth.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Quantum computation of frequency-domain molecular response properties using a three-qubit iToffoli gate

Sun,

Marinelli,

Koh

et al. 2024

npj Quantum Inf

View full text Add to dashboard Cite

The quantum computation of molecular response properties on near-term quantum hardware is a topic of substantial interest. Computing these properties directly in the frequency domain is desirable, but the circuits require large depth if the typical hardware gate set consisting of single- and two-qubit gates is used. While high-fidelity multipartite gates have been reported recently, their integration into quantum simulation and the demonstration of improved accuracy of the observable properties remains to be shown. Here, we report the application of a high-fidelity multipartite gate, the iToffoli gate, to the computation of frequency-domain response properties of diatomic molecules. The iToffoli gate enables a ~50% reduction in circuit depth and ~40% reduction in circuit execution time compared to the traditional gate set. We show that the molecular properties obtained with the iToffoli gate exhibit comparable or better agreement with theory than those obtained with the native CZ gates. Our work is among the first demonstrations of the practical usage of a native multi-qubit gate in quantum simulation, with diverse potential applications to near-term quantum computation.

show abstract

Section: Discussionmentioning

confidence: 99%

mentioning

confidence: 99%

Quantum computation of frequency-domain molecular response properties using a three-qubit iToffoli gate

Sun,

Marinelli,

Koh

et al. 2024

npj Quantum Inf

View full text Add to dashboard Cite

show abstract

“…At present, quantum computing has entered the era of noisy medium-scale quantum (NISQ) systems, where there are inherent limitations on size, depth, and the number of qubits of quantum circuits that can be supported by physical experimental hardware, so the degree of optimization of quantum circuits directly affects the scope of application of quantum computers [1]. Designing quantum circuits as small as possible, as shallow as possible, and using as few qubits as possible for various computational problems is one of the most important research directions in the field of quantum computing [2][3][4][5][6][7][8][9].…”

Section: Introductionmentioning

confidence: 99%

Optimal Synthesis of Multi-Controlled Qudit Gates

Zi¹,

Li²,

Sun³

2023

Preprint

View full text Add to dashboard Cite

We propose a linear-size synthesis of the multicontrolled Toffoli gate on qudits with at most one borrowed ancilla. This one ancilla can even be saved when the qudit dimension is odd. Our synthesis leads to improvements in various quantum algorithms implemented on qudits. In particular, we obtain (i) a linear-size and one-clean-ancilla synthesis of multi-controlled qudit gates; (ii) an optimal-size and one-clean-ancilla synthesis of unitaries on qudits; (iii) a near-optimal-size and ancilla-free/oneborrowed-ancilla implementation of classical reversible functions as qudit gates.

show abstract

“…The multi-bit controlled-Z gate in Grover algorithm appears multiple times in iterations [5], and its equivalent multi-bit controlled Toffoli gate is also a key component of many algorithms such as error correction [6][7][8], quantum simulation [9], and machine learning [10]. In addition, the multi-bit control NOT gates need two-bit gates that are at least square with the number of bits, while the optimization method based on QuAND gates requires only a linear number [11]. The quantum version of AND logic implements a resource efficient construction that reduces compilation overhead.…”

Section: Introductionmentioning

confidence: 99%

Design Method of Meta Operators Based on Equivalence Class Distribution

Shu,

Fei,

et al. 2023

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

Currently, there are many physical systems for quantum computing and to adapt to the physical characteristics of different systems, engineers have designed different basic gate groups for gate circuit calculation models. The quantum algorithm realizes the evolution of the quantum state by applying unitary operators to the quantum states, and the results are obtained by measuring the outputs. These operators will be done in the corresponding physical system by compiling and decomposing into hardware supported basic gates. Universal fundamental gates can construct all quantum algorithms, but their computational efficiency is limited. Drawing on the idea of meta operators in classical machine learning, by constructing a deep learning framework for deep learning models, the common computational logic of operators in different deep learning frameworks is abstracted as ‘meta operators’ [1, 2]. This article aims to study and propose the common computational logic of quantum computing with geometric equivalence class distribution methods, using the volume size of the equivalence class space as a performance indicator for meta operators and identifying the optimal meta operators to optimize the depth of the circuits in the experiments. Which proves the effectiveness of the design method proposed and provides solutions for quantum circuit optimization and dedicated gate design.

show abstract

Scalable algorithm simplification using quantum AND logic

Cited by 31 publications

References 44 publications

Quantum computation of frequency-domain molecular response properties using a three-qubit iToffoli gate

Quantum computation of frequency-domain molecular response properties using a three-qubit iToffoli gate

Optimal Synthesis of Multi-Controlled Qudit Gates

Design Method of Meta Operators Based on Equivalence Class Distribution

Contact Info

Product

Resources

About