English
Related papers

Related papers: Linear decomposition of approximate multi-controll…

200 papers

Compilation and optimization of quantum circuits are critical components in the execution of algorithms on quantum computers. These components must successfully balance two competing priorities: minimizing the number of expensive resources,…

As the effort to scale up existing quantum hardware proceeds, it becomes necessary to schedule quantum gates in a way that minimizes the number of operations. There are three constraints that have to be satisfied: the order or dependency of…

Quantum Physics · Physics 2018-08-28 Gian Giacomo Guerreschi , Jongsoo Park

We propose a new way of implementing several elementary quantum gates for qubits in the coherent state basis. The operations are probabilistic and employ single photon subtractions as the driving force. Our schemes for single-qubit phase…

Quantum Physics · Physics 2015-05-19 Petr Marek , Jaromir Fiurasek

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…

Feasibility study is done for the possibility of universal set of quantum gate implementation based on phononic state via 4th order Duffing nonlinearity in an optomechanical system. The optomechanical system consists of N doubly clamped…

Quantum Physics · Physics 2024-11-12 R. Alinaghipour , H. Mohammadi

Cat qubits have emerged as a promising candidate for quantum computation due to their higher error-correction thresholds and low resource overheads. In existing literature, the detuning of the two-photon drive is assumed to be zero for…

Quantum Physics · Physics 2024-07-31 A. Schlabes , R. Bhowmick , M. H. Ansari

While mapping a quantum circuit to the physical layer one has to consider the numerous constraints imposed by the underlying hardware architecture. Connectivity of the physical qubits is one such constraint that restricts two-qubit…

Quantum Physics · Physics 2022-11-14 Vlad Gheorghiu , Jiaxin Huang , Sarah Meng Li , Michele Mosca , Priyanka Mukhopadhyay

The field of linear optical quantum computation (LOQC) will soon need a repertoire of experimental milestones. We make progress in this direction by describing several experiments based on Grover's algorithm. These experiments range from a…

Quantum Physics · Physics 2009-11-10 Jennifer L. Dodd , Timothy C. Ralph , G. J. Milburn

Quantum circuit optimization is a central task in Quantum Computing, as current Noisy Intermediate Scale Quantum devices suffer from error propagation that often scales with the number of operations. Among quantum operations, the CNOT gate…

Artificial Intelligence · Computer Science 2026-04-16 Jacopo Cossio , Daniele Lizzio Bosco , Riccardo Romanello , Giuseppe Serra , Carla Piazza

Current noisy intermediate-scale quantum (NISQ) devices can only execute small circuits with shallow depth, as they are still constrained by the presence of noise: quantum gates have error rates and quantum states are fragile due to…

Quantum Physics · Physics 2024-06-11 Shihao Zhang , Kai Huang , Lvzhou Li

While all quantum algorithms can be expressed in terms of single-qubit and two-qubit gates, more expressive gate sets can help reduce the algorithmic depth. This is important in the presence of gate errors, especially those due to…

We propose an effective realization of a complete set of elementary quantum gates in the solid-state quantum computer based on the multi-atomic coherent (MAC-) ensembles in the QED cavity. Here, we use the two-ensemble qubit encoding and…

Quantum Physics · Physics 2011-11-15 Farid Ablayev , Sergey N. Andrianov , Alexander Vasiliev , Sergey A. Moiseev

The three-spin-$1/2$ decoherence-free subsystem defines a logical qubit protected from collective noise and supports exchange-only universal gates. Such logical qubits are well-suited for implementation with electrically-defined quantum…

Quantum Physics · Physics 2019-04-26 James. R. van Meter , Emanuel Knill

We present quantum networks for a n-qubit controlled gate C^{n-1}(U) which use a higher dimensional (qudit) ancilla as a catalyser. In its simplest form the network has only n two-particle gates (qubit-qudit) -- this is the minimum number…

Quantum Physics · Physics 2009-07-15 Radu Ionicioiu , Timothy P. Spiller , William J. Munro

Clifford circuit optimization is an important step in the quantum compilation pipeline. Major compilers employ heuristic approaches. While they are fast, their results are often suboptimal. Minimization of noisy gates, like 2-qubit CNOT…

Quantum Physics · Physics 2025-04-02 Irfansha Shaik , Jaco van de Pol

We present a set of efficiently implementable logical multi-qubit gates in concatenated quantum error correction codes using parity qubits. In particular, we show how fault-tolerant high-weight rotation gates of arbitrary angle can be…

Quantum Physics · Physics 2025-12-16 Anette Messinger , Christophe Goeller , Wolfgang Lechner

We investigate the topological quantum compilation of two-qubit operations within a system of Fibonacci anyons. Our primary goal is to generate gates that are approximately leakage-free and equivalent to the controlled-NOT (CNOT) gate up to…

Quantum Physics · Physics 2024-11-26 Phillip C. Burke , Christos Aravanis , Johannes Aspman , Jakub Mareček , Jiří Vala

In this paper, with the weak cross-Kerr nonlinearity, we first present a special experimental scheme called C-path gate with which the realization of all possible bipartite POVMs of two-photon polarization states can be simpler and nearly…

Quantum Physics · Physics 2009-02-26 Qing Lin , Jian Li

Topological error-correcting codes, such as surface codes and color codes, are promising because quantum operations are realized by two-dimensionally (2D) arrayed quantum bits (qubits). However, physical wiring of electrodes to qubits is…

Quantum Physics · Physics 2017-09-06 Tetsufumi Tanamoto , Hayato Goto

Recently it has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of $T$ gates of about $1/3$ of what is required by optimal, deterministic, ancilla-free decompositions…

Quantum Physics · Physics 2015-06-11 Alex Bocharov , Martin Roetteler , Krysta M. Svore
‹ Prev 1 8 9 10 Next ›