English
Related papers

Related papers: GULPS: Two-Qubit Gate Synthesis via Linear Program…

200 papers

We propose the generalized controlled X (GCX) gate as the two-qudit elementary gate, and based on Cartan decomposition, we also give the one-qudit elementary gates. Then we discuss the physical implementation of these elementary gates and…

Quantum Physics · Physics 2015-06-12 Yao-Min Di , Hai-Rui Wei

Quantum algorithms offer a dramatic speedup for computational problems in machine learning, material science, and chemistry. However, any near-term realizations of these algorithms will need to be heavily optimized to fit within the finite…

Exact synthesis provides unconditional optimality and canonical structure, but is often limited to small, carefully scoped regimes. We present an exact synthesis framework for two-qubit circuits over the Clifford+$T$ gate set that optimizes…

The synthesis of single-qudit unitaries has mainly been understudied, resulting in inflexible and non-optimal analytical solutions, as well as inefficient and impractical numerical solutions. To address this challenge, we introduce QSweep,…

Quantum Physics · Physics 2023-12-18 Ed Younis , Noah Goss

Generative modeling is one of the most promising applications of quantum machine learning, yet training and deploying Quantum Generative Models (QGMs) on near-term hardware remains effectively intractable due to prohibitive gradient…

Near-term quantum computing (QC) systems have limited qubit counts, high gate (instruction) error rates, and typically support a minimal instruction set having one type of two-qubit gate (2Q). To reduce program instruction counts and…

Quantum Physics · Physics 2021-06-30 Prakash Murali , Lingling Lao , Margaret Martonosi , Dan Browne

We present an algorithm for compiling arbitrary unitaries into a sequence of gates native to a quantum processor. As accurate CNOT gates are hard for the foreseeable Noisy- Intermediate-Scale Quantum devices era, our A* inspired algorithm…

Emerging Technologies · Computer Science 2019-12-09 Marc Grau Davis , Ethan Smith , Ana Tudor , Koushik Sen , Irfan Siddiqi , Costin Iancu

We present a quantum synthesis algorithm designed to produce short circuits and to scale well in practice. The main contribution is a novel representation of circuits able to encode placement and topology using generic "gates", which allows…

Quantum Physics · Physics 2021-03-15 Ed Younis , Koushik Sen , Katherine Yelick , Costin Iancu

Distributed quantum computing offers a potential solution to the complexity of superconducting chip hardware layouts and error correction algorithms. High-quality gates between distributed chips enable the simplification of existing error…

Quantum Physics · Physics 2025-11-04 Yunan Li , Xi Zhang , Weixin Zhang , Ruonan Guo , Yu Zhang , Xinsheng Tan , Yang Yu

Realizing computationally complex quantum circuits in the presence of noise and imperfections is a challenging task. While fault-tolerant quantum computing provides a route to reducing noise, it requires a large overhead for generic…

We study two-qubit circuits over the Clifford+CS gate set, which consists of the Clifford gates together with the controlled-phase gate CS=diag(1,1,1,i). The Clifford+CS gate set is universal for quantum computation and its elements can be…

Quantum Physics · Physics 2021-06-21 Andrew N. Glaudell , Neil J. Ross , Jacob M. Taylor

Qudits, generalizations of qubits to multi-level quantum systems, offer enhanced computational efficiency by encoding more information per lattice cell, avoiding costly swap operations and providing even exponential speedup in some cases.…

Quantum Physics · Physics 2025-10-09 Boxi Li , F. A. Cárdenas-López , Adrian Lupascu , Felix Motzoi

Quantum circuit synthesis is the process in which an arbitrary unitary operation is decomposed into a sequence of gates from a universal set, typically one which a quantum computer can implement both efficiently and fault-tolerantly. As…

Quantum Physics · Physics 2016-10-17 Olivia Di Matteo , Michele Mosca

Gate-based quantum computers typically encode and process information in two-dimensional units called qubits. Using $d$-dimensional qudits instead may offer intrinsic advantages, including more efficient circuit synthesis, problem-tailored…

The current phase of quantum computing is in the Noisy Intermediate-Scale Quantum (NISQ) era. On NISQ devices, two-qubit gates such as CNOTs are much noisier than single-qubit gates, so it is essential to minimize their count. Quantum…

Quantum Physics · Physics 2022-03-24 Xin-Chuan Wu , Marc Grau Davis , Frederic T. Chong , Costin Iancu

Efficiently implementing Clifford circuits is crucial for quantum error correction and quantum algorithms. Linear reversible circuits, equivalent to circuits composed of CNOT gates, have important applications in classical computing. In…

Quantum Physics · Physics 2025-03-20 Mark Webster , Stergios Koutsioumpas , Dan E Browne

Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well…

Quantum Physics · Physics 2009-11-13 Dianne P. O'Leary , Gavin K. Brennen , Stephen S. Bullock

While quantum circuits are reaching impressive widths in the hundreds of qubits, their depths have not been able to keep pace. In particular, cloud computing gates on multi-qubit, fixed-frequency superconducting chips continue to hover…

Quantum Physics · Physics 2024-09-13 Boxi Li , Tommaso Calarco , Felix Motzoi

Despite major ongoing advancements in neutral atom hardware technology, there remains limited work in systems-level software tailored to overcoming the challenges of neutral atom quantum computers. In particular, most current neutral atom…

High-fidelity circuit execution on noisy intermediate-scale quantum devices is bottlenecked by compilation pipelines that disregard complex, correlated noise. To address this, this methodology article proposes a quantum machine learning…

‹ Prev 1 2 3 10 Next ›