English
Related papers

Related papers: Universal Quantum Computing with Field-Mediated Un…

200 papers

We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact…

Quantum Physics · Physics 2007-05-23 Terry Rudolph , Lov Grover

We demonstrate that in a coupled two-qubit system any single-qubit gate can be decomposed into two conditional two-qubit gates and that any conditional two-qubit gate can be implemented by a manipulation analogous to that used for a…

Quantum Physics · Physics 2009-11-11 Zhongyuan Zhou , Shih-I Chu , Siyuan Han

We show how to perform measurement-based quantum computing on qudits (high-dimensional quantum systems) using alternative resource states beyond the cluster state. Estimating overheads for gate decomposition, we find that generalizing…

Quantum Physics · Physics 2026-02-13 Alena Romanova , Wolfgang Dür

We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $|0\rangle$ computational basis. In addition, we allow the creation of a one-qubit ancilla in a…

Quantum Physics · Physics 2020-11-07 Sergei Bravyi , Alexei Kitaev

Universal logic gates for two quantum bits (qubits) form an essential ingredient of quantum information processing. However, the photons, one of the best candidates for qubits, suffer from the lack of strong nonlinear coupling required for…

Quantum Physics · Physics 2009-11-10 Zhi Zhao , An-Ning Zhang , Yu-Ao Chen , Han Zhang , Jiangfeng Du , Tao Yang , Jian-Wei Pan

Compared with a qubit, a qudit (i.e., $d$-level or $d$-state quantum system) provides a larger Hilbert space to store and process information. On the other hand, qudit-based hybrid quantum computing usually requires performing hybrid…

Quantum Physics · Physics 2022-08-30 Qi-Ping Su , Yu Zhang , Liang Bin , Chui-Ping Yang

Blind quantum computing (BQC) is a promising application of distributed quantum systems, where a client can perform computations on a remote server without revealing any details of the applied circuit. While the most promising realizations…

Entangling gates between qubits are a crucial component for performing algorithms in quantum computers. However, any quantum algorithm must ultimately operate on error-protected logical qubits encoded in high-dimensional systems. Typically,…

We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically…

Quantum Physics · Physics 2017-09-27 Shuntaro Takeda , Akira Furusawa

We construct optimized implementations of the CNOT and other universal two-qubit gates that, unlike many of the previously proposed protocols, are carried out in a single step. The new protocols require tunable inter-qubit couplings but, in…

Quantum Physics · Physics 2013-05-29 I. A. Grigorenko , D. V. Khveshchenko

A single physical interaction might not be universal for quantum computation in general. It has been shown, however, that in some cases it can generate universal quantum computation over a subspace. For example, by encoding logical qubits…

Quantum Physics · Physics 2007-05-23 M. Hsieh , J. Kempe , S. Myrgren , K. B. Whaley

Quantum computation requires qubits that can be coupled and realized in a scalable manner, together with universal and high-fidelity one- and two-qubit logic gates \cite{DiVincenzo2000, Loss1998}. Strong effort across several fields have…

Coding theorems in quantum Shannon theory express the ultimate rates at which a sender can transmit information over a noisy quantum channel. More often than not, the known formulas expressing these transmission rates are intractable,…

Quantum Physics · Physics 2010-06-15 Kamil Bradler , Patrick Hayden , Dave Touchette , Mark M. Wilde

In this Letter, we present two analytic expressions that most generally simulate $n$-qubit controlled-$U$ gates with standard one-qubit gates and CNOT gates using exponential and polynomial complexity respectively. Explicit circuits and…

Quantum Physics · Physics 2007-08-27 Yang Liu , Gui Lu Long , Yang Sun

Quantum walks have wide applications in quantum information, such as universal quantum computation, so it is important to explore properties of quantum walks thoroughly. We propose a novel method to implement discrete-time quantum walks…

Quantum Physics · Physics 2022-06-09 Qi-Ping Su , Shi-Chao Wang , Yan Chi , Yong-Nan Sun , Li Yu , Zhe Sun , Franco Nori , Chui-Ping Yang

The study of quantum walk processes has been widely divided into two standard variants, the discrete-time quantum walk (DTQW) and the continuous-time quantum walk (CTQW). The connection between the two variants has been established by…

Quantum Physics · Physics 2008-11-08 C. M. Chandrashekar

A modern computer system, based on the von Neumann architecture, is a complicated system with several interactive modular parts. Quantum computing, as the most generic usage of quantum information, follows a hybrid architecture so far,…

Quantum Physics · Physics 2022-09-02 D. -S. Wang

Quantum networks connecting quantum processing nodes via photonic links enable distributed and modular quantum computation. In this framework, quantum gates between remote qubits can be realized using quantum teleportation protocols. The…

Low depth measurement-based quantum computation with qudits ($d$-level systems) is investigated and a precise relationship between this powerful model and qudit quantum circuits is derived in terms of computational depth and size…

Quantum Physics · Physics 2015-10-23 Timothy J. Proctor

In this work, we investigate the interaction between a uniformly accelerated single qubit and a fermionic spinor field. Here we consider both the massless and the massive fermionic spinor fields. The qubit-field interaction occurs over a…

Quantum Physics · Physics 2025-12-11 Arnab Mukherjee , Sunandan Gangopadhyay , P. H. M. Barros , H. A. S. Costa