Related papers: Hamiltonian quantum computing with superconducting…
Quantum computing using two-dimensional NMR has recently been described using scalar coupling evolution technique [J. Chem. Phys.,109,10603 (1998)]. In the present paper, we describe two-dimensional NMR quantum computing with the help of…
Many promising quantum applications depend on the efficient quantum simulation of an exponentially large sparse Hamiltonian, a task known as sparse Hamiltonian simulation, which is fundamentally important in quantum computation. Although…
We present a general technique to implement products of many qubit operators communicating via a joint harmonic oscillator degree of freedom in a quantum computer. By conditional displacements and rotations we can implement Hamiltonians…
Quantum computation based on nonadiabatic geometric phases has attracted a broad range of interests, due to its fast manipulation and inherent noise resistance. However, it is limited to some special evolution paths, and the gate-times are…
Many promising ideas for quantum computing demand the experimental ability to directly switch 'on' and 'off' a physical coupling between the component qubits. This is typically the key difficulty in implementation, and precludes quantum…
Exploring low-cost applications is paramount to creating value in early fault-tolerant quantum computers. Here we optimize both gate and qubit counts of recent algorithms for simulating the Fermi-Hubbard model. We further devise and compile…
The prospect of large-scale quantum computation with an integrated chip of spin qubits is imminent as technology improves. This invites us to think beyond the traditional 2-qubit-gate framework and consider a naturally supported…
We describe an alternative approach to quantum computation that is ideally suited for today's sub-threshold-fidelity qubits, and which can be applied to a family of hardware models that includes superconducting qubits with tunable coupling.…
Inter-qubit coupling and qubit connectivity in a processor are crucial for achieving high fidelity multi-qubit gates and efficient implementation of quantum algorithms. Typical superconducting processors employ relatively weak transverse…
Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…
We propose and analyze an approach to realize quantum computation and simulation using fermionic particles under quantum gas microscopes. Our work is inspired by a recent experimental demonstration of large-scale quantum registers, where…
Quantum dot-based spin qubit realization is one of the most promising quantum computing systems owing to its integrability with classical computation hardware and its versatility in realizing qubits and quantum gates. In this work, we…
Semiconductor quantum dots offer a promising platform for controlling spin qubits and realizing quantum logic gates, essential for scalable quantum computing. In this work, we utilize a variational quantum compiling algorithm to design…
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…
The hybrid approach to quantum computation simultaneously utilizes both discrete and continuous variables which offers the advantage of higher density encoding and processing powers for the same physical resources. Trapped ions, with…
Transversality is a simple and effective method for implementing quantum computation fault-tolerantly. However, no quantum error-correcting code (QECC) can transversally implement a quantum universal gate set (Eastin and Knill, Phys. Rev.…
High-fidelity two-qubit gates are essential for scalable quantum computing. We present a scheme based on superconducting transmon qubits and a control pulse delivery protocol that enables arbitrary controlled-phase gates modulated solely by…
Digital-analog quantum computing with two-level systems is a computational paradigm that combines an analog Hamiltonian with single-qubit gates to achieve universality. We extend this framework to $d$-level systems by conjugating an analog…
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…
Quantum arithmetic computation requires a substantial number of scratch qubits to stay reversible. These operations necessitate qubit and gate resources equivalent to those needed for the larger of the input or output registers due to state…