相关论文: Implementing the fanout gate by a Hamiltonian

We derive an encoded universality representation for a generalized anisotropic exchange Hamiltonian that contains cross-product terms in addition to the usual two-particle exchange terms. The recently developed algebraic approach is used to…

A clever choice and design of gate sets can reduce the depth of a quantum circuit, and can improve the quality of the solution one obtains from a quantum algorithm. This is especially important for near-term quantum computers that suffer…

In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence…

We present a formalism based on tracking the flow of parity quantum information to implement algorithms on devices with limited connectivity without qubit overhead, SWAP operations or shuttling. Instead, we leverage the fact that entangling…

We analyze the accuracy of quantum phase gates acting on "0-$\pi$ qubits" in superconducting circuits, where the gates are protected against thermal and Hamiltonian noise by continuous-variable quantum error-correcting codes. The gates are…

The Fermi-Hubbard model, a fundamental framework for studying strongly correlated phenomena could significantly benefit from quantum simulations when exploring non-trivial settings. However, simulating this problem requires twice as many…

Quantum computer versus quantum algorithm processor in CMOS are compared to find (in parallel) all Hamiltonian cycles in a graph with m edges and n vertices, each represented by k bits. A quantum computer uses quantum states analogous to…

We report the characterization of a universal set of logic gates for one-way quantum computing using a four-photon `star' cluster state generated by fusing photons from two independent photonic crystal fibre sources. We obtain a fidelity…

Gate-teleportation circuits are arguably among the most basic examples of computations believed to provide a quantum computational advantage: In seminal work [Quantum Inf. Comput., 4(2):134--145], Terhal and DiVincenzo have shown that these…

We derive and investigate a general non-Markovian equation for the time-dependence of a Hamiltonian that maximizes the fidelity of a desired quantum gate on any finite-dimensional quantum system in the presence of arbitrary bath and noise…

We propose a way to realize a multiqubit tunable phase gate of one qubit simultaneously controlling n target qubits with atoms in cavity QED. In this proposal, classical pulses interact with atoms outside a cavity only, thus the…

We propose a method for implementation of an universal set of one- and two-quantum-bit gates for quantum computation in the system of two coupled electrons with constant non-diagonal exchange interaction. Suppression of the exchange…

A large-scalable quantum computer model, whose qubits are represented by the subspace subtended by the ground state and the single exciton state on semiconductor quantum dots, is proposed. A universal set of quantum gates in this system may…

We introduce the paradigm of replacement-type quantum gates. This type of gate introduces input qubits, candidate qubits, and output qubits. The candidate qubits are prepared such, that a displacement conditional on the input qubit results…

We propose a new implementation of a universal set of one- and two-qubit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier…

Geometric gates that use the global property of the geometric phase is believed to be a powerful tool to realize fault-tolerant quantum computation. However, for singlet-triplet qubits in semiconductor quantum dot, the low Rabi frequency of…

Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…

We introduce a shortcut to the adiabatic gate teleportation model of quantum computation. More specifically, we determine fast local counterdiabatic Hamiltonians able to implement teleportation as a universal computational primitive. In…

Josephson junctions have been shown to be a promising solid-state system for implementation of quantum computation. The significant two-qubit gates are generally realized by the capacitive coupling between the nearest neighbour qubits. We…

We improve on the results of [A. Jackson et al. Proc. Natl. Acad. Sci. U.S.A 121 (6). 2024] on the verification of analogue quantum simulators by eliminating the use of universal Hamiltonians, removing the need for two-qubit gates, and no…