Related papers: Architecture and noise analysis of continuous-vari…
One-way quantum computing is experimentally appealing because it requires only local measurements on an entangled resource called a cluster state. Record-size, but non-universal, continuous-variable cluster states were recently demonstrated…
Decoherence of quantum states is a major hurdle towards scalable and reliable quantum computing. Lower decoherence (i.e., higher fidelity) can alleviate the error correction overhead and obviate the need for energy-intensive noise reduction…
Quantum optimal control theory allows to design accurate quantum gates. We employ it to design high-fidelity two-bit gates for Josephson charge qubits in the presence of both leakage and noise. Our protocol considerably increases the…
An interesting concept in quantum computation is that of global control (GC), where there is no need to manipulate qubits individually. One can implement a universal set of quantum gates on a one-dimensional array purely via signals that…
Variational quantum algorithms (VQAs) are expected to be a path to quantum advantages on noisy intermediate-scale quantum devices. However, both empirical and theoretical results exhibit that the deployed ansatz heavily affects the…
Quantum computers have the potential to efficiently simulate large-scale quantum systems for which classical approaches are bound to fail. Even though several existing quantum devices now feature total qubit numbers of more than one…
Quantum information processing faces a significant hurdle: noise. Different noise sources induce varying errors in quantum operations depending on the underlying dynamics. To gain a deeper understanding of these error mechanisms, we…
Fault-tolerant quantum computation allows quantum computations to be carried out while resisting unwanted noise. Several error-correcting codes have been developed to achieve this task, but none alone are capable of universal quantum…
Bosonic codes offer a hardware-efficient approach to encoding and protecting quantum information with a single continuous-variable bosonic system. In this paper, we introduce a new universal quantum gate set composed of only one type of…
We show how to realize a general quantum circuit involving gates between arbitrary pairs of qubits by means of geometrically local quantum operations and efficient classical computation. We prove that circuit-level local stochastic noise…
Being a very promising technology, with impressive advances in the recent years, it is still unclear how quantum computing will scale to satisfy the requirements of its most powerful applications. Although continued progress in the…
Error mitigation schemes and error-correcting codes have been the center of much effort in quantum information processing research over the last few decades. While most of the successful proposed schemes for error mitigation are…
In this work, we introduce a method to construct fault-tolerant measurement-based quantum computation (MBQC) architectures and numerically estimate their performance over various types of networks. A possible application of such a paradigm…
Exploring an efficient and scalable architecture of fault-tolerant quantum computing (FTQC) is vital for demonstrating useful quantum computing. Here, we propose and evaluate a scalable and practical architecture with a…
We develop a layered quantum computer architecture, which is a systematic framework for tackling the individual challenges of developing a quantum computer while constructing a cohesive device design. We discuss many of the prominent…
We propose a scheme for scalable and universal quantum computation using diatomic bits with conditional dipole-dipole interaction, trapped within an optical lattice. The qubit states are encoded by the scattering state and the bound…
One of the fundamental conditions for one-way quantum computation (1WQC) is the ability to make sequential measurements on isolated qubits that comprise the highly entangled resource for 1WQC, the cluster state. This has been a significant…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
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…
Large-scale quantum computation requires to be performed in the fault-tolerant manner. One crucial challenge of fault-tolerant quantum computing (FTQC) is reducing the overhead of implementing logical gates. Recently work proposed…