Related papers: Effective non-local parity-dependent couplings in …
Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number…
In an attempt to better leverage superconducting quantum computers, scaling efforts have become the central concern. These efforts have been further exacerbated by the increased complexity of these circuits. The added complexity can…
Developing Hamiltonian models for quantum processors with many qubits on the same chip is crucial for advancing quantum computing technologies. Stray couplings between qubits lead to errors in gate operations. This study underscores the…
Efficient simulation of many-body quantum systems is central to advances in physics, chemistry, and quantum computing, with a key question being whether the simulation cost scales polynomially with the system size. In this work, we analyze…
We propose a practical, scalable, and efficient scheme for quantum computation using spatially separated matter qubits and single photon interference effects. The qubit systems can be NV-centers in diamond, Pauli-blockade quantum dots with…
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…
Quantum networks are considered as a promising future platform for quantum information exchange and quantum applications, which have capabilities far beyond the traditional communication networks. Remote quantum entanglement is an essential…
We propose a selective dynamical decoupling scheme on a chain of permanently coupled qubits with XX type interactions, which is capable of dynamically suppressing any coupling in the chain by applying sequences of local pulses to the…
In digital quantum simulation of fermionic models with qubits, non-local maps for encoding are often encountered. Such maps require linear or logarithmic overhead in circuit depth which could render the simulation useless, for a given…
Trapped-ion quantum computers have demonstrated high-performance gate operations in registers of about ten qubits. However, scaling up and parallelizing quantum computations with long one-dimensional (1D) ion strings is an outstanding…
A quantum computing system is typically represented by a set of non-interacting (local) two-state systems - qubits. Many physical systems can naturally have more accessible states, both local and non-local. We show that the resulting…
Quantum algorithms require accurate representations of electronic states on a quantum device, yet the approximation of electronic wave functions for strongly correlated systems remains a profound theoretical challenge, with existing methods…
We present two protocols for implementing deterministic non-local multi-qubit quantum gates on qubits coupled to a common cavity mode. The protocols rely only on a classical drive of the cavity modes, while no external drive of the qubits…
Long-range and multi-body interactions are crucial for quantum simulation and quantum computation. Yet, their practical realization using elementary pairwise interactions remains an outstanding challenge. We propose an experimental scheme…
It has been shown that, for even $n$, evolving $n$ qubits according to a Hamiltonian that is the sum of pairwise interactions between the particles, can be used to exactly implement an $(n+1)$-qubit fanout gate using a particular…
Much recent work on distributed quantum computing have focused on the use of entangled pairs and distributed two qubit gates. But there has also been work on efficient schemes for achieving multipartite entanglement between nodes in a…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
Parallel operations in conventional computing have proven to be an essential tool for efficient and practical computation, and the story is not different for quantum computing. Indeed, there exists a large body of works that study…
Scaling the number of entangled nodes in a quantum network is a challenge with significant implications for quantum computing, clock synchronisation, secure communications, and quantum sensing. In a quantum network, photons interact with…
Simulating large-scale coupled-oscillator systems presents substantial computational challenges for classical algorithms, particularly when pursuing first-principles analyses in the thermodynamic limit. Motivated by the quantum algorithm…