English
Related papers

Related papers: Constant-Depth and Subcubic-Size Threshold Circuit…

200 papers

We study the algorithmic problem of multiplying large matrices that are rectangular. We prove that the method that has been used to construct the fastest algorithms for rectangular matrix multiplication cannot give algorithms with…

Computational Complexity · Computer Science 2025-11-10 Matthias Christandl , François Le Gall , Vladimir Lysikov , Jeroen Zuiddam

Algorithms for quantum information processing are usually decomposed into sequences of quantum gate operations, most often realized with single- and two- qubit gates[1]. While such operations constitute a universal set for quantum…

Quantum Physics · Physics 2009-11-13 T. Monz , K. Kim , W. Hänsel , M. Riebe , A. Villar , P. Schindler , M. Chwalla , M. Hennrich , R. Blatt

The threshold theorem promises a path to fault-tolerant quantum computation, provided the physical error rate is below a critical threshold. While transversal gates efficiently implement logical operations, they propagate errors and can…

Quantum Physics · Physics 2026-04-21 Yichen Xu , Yiqing Zhou , James P. Sethna , Eun-Ah Kim

Quantum computing has the potential to solve many complex algorithms in the domains of optimization, arithmetics, structural search, financial risk analysis, machine learning, image processing, and others. Quantum circuits built to…

Quantum Physics · Physics 2024-07-26 Vladimir V. Arsoski

Decoupling has become a central concept in quantum information theory with applications including proving coding theorems, randomness extraction and the study of conditions for reaching thermal equilibrium. However, our understanding of the…

Quantum Physics · Physics 2018-02-06 Winton Brown , Omar Fawzi

In recent years, a new kind of accelerated hardware has gained popularity in the Artificial Intelligence (AI) and Machine Learning (ML) communities which enables extremely high-performance tensor contractions in reduced precision for deep…

Computational Physics · Physics 2024-05-01 Adela Habib , Joshua Finkelstein , Anders M. N. Niklasson

We study the achievements of quantum circuits comprised of several one- and two-qubit gates. Quantum process matrices are determined for the basic one- and two-qubit gate operations and concatenated to yield the process matrix of the…

Quantum Physics · Physics 2014-04-11 J. Gulliksen , D. D. Bhaktavatsala Rao , K. Mølmer

Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…

Quantum computing is currently strongly limited by the impact of noise, in particular introduced by the application of two-qubit gates. For this reason, reducing the number of two-qubit gates is of paramount importance on noisy…

Decoherence -- in the current physical implementations of quantum computers -- makes depth reduction a vital task in quantum-circuit design. Moore and Nilsson (SIAM Journal of Computing, 2001) demonstrated that additional qubits -- known as…

Quantum Physics · Physics 2022-09-26 Jiaqing Jiang , Xiaoming Sun , Shang-Hua Teng , Bujiao Wu , Kewen Wu , Jialin Zhang

The ``pre-train, prompt" paradigm, designed to bridge the gap between pre-training tasks and downstream objectives, has been extended from the NLP domain to the graph domain and has achieved remarkable progress. Current mainstream graph…

Computation and Language · Computer Science 2026-01-27 Ziyu Zheng , Yaming Yang , Ziyu Guan , Wei Zhao , Xinyan Huang , Weigang Lu

We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values $(x,y)$ to $(x,x \oplus y)$) is universal in the sense that all unitary operations on arbitrarily many…

Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations,…

Quantum Physics · Physics 2024-03-14 A. M. Krol , A. Sarkar , I. Ashraf , Z. Al-Ars , K. Bertels

Matrix-vector multiplication is one of the most fundamental computing primitives. Given a matrix $A\in\mathbb{F}^{N\times N}$ and a vector $b$, it is known that in the worst case $\Theta(N^2)$ operations over $\mathbb{F}$ are needed to…

Data Structures and Algorithms · Computer Science 2017-11-21 Christopher De Sa , Albert Gu , Rohan Puttagunta , Christopher Ré , Atri Rudra

What is the power of constant-depth circuits with $MOD_m$ gates, that can count modulo $m$? Can they efficiently compute MAJORITY and other symmetric functions? When $m$ is a constant prime power, the answer is well understood: Razborov and…

Computational Complexity · Computer Science 2021-07-13 Brynmor Chapman , Ryan Williams

Spin qubits in semiconductor quantum dots are a promising platform for quantum computing, however scaling to large systems is hampered by crosstalk and charge noise. Crosstalk here refers to the unwanted off-resonant rotation of idle qubits…

Mesoscale and Nanoscale Physics · Physics 2024-05-17 David W. Kanaar , J. P. Kestner

Recently, the demand of low-power deep-learning hardware for industrial applications has been increasing. Most existing artificial intelligence (AI) chips have evolved to rely on new chip technologies rather than on radically new hardware…

Machine Learning · Computer Science 2020-02-14 Byungik Ahn

Dual-type qubits have become a promising way to suppress the crosstalk error of auxiliary operations in large-scale ion trap quantum computation. Here we demonstrate a direct entangling gate between dual-type qubits encoded in the $S_{1/2}$…

While real quantum devices have been increasingly used to conduct research focused on achieving quantum advantage or quantum utility in recent years, executing deep quantum circuits or performing quantum machine learning with large-scale…

Quantum Physics · Physics 2026-04-06 Yoshiaki Kawase

Quantum circuits are time dependent diagrams describing the process of quantum computation. Usually, a quantum algorithm must be mapped into a quantum circuit. Optimal synthesis of quantum circuits is intractable and heuristic methods must…

Quantum Physics · Physics 2008-02-27 D. Maslov , G. W. Dueck , D. M. Miller , C. Negrevergne
‹ Prev 1 4 5 6 7 8 10 Next ›