Related papers: Distributed Quantum Computation Based-on Small Qua…
We introduce an inductive $n$-qubit pure-state estimation method. This is based on projective measurements on states of $2n+1$ separable bases or $2$ entangled bases plus the computational basis. Thus, the total number of measurement bases…
Current technological advancements of quantum computers highlight the need for application-driven, practical and well-defined methods of benchmarking their performance. As the existing NISQ device's quality of two-qubit gate errors rate is…
We present a distributed implementation of Shor's quantum factoring algorithm on a distributed quantum network model. This model provides a means for small capacity quantum computers to work together in such a way as to simulate a large…
Entangled photons are widely used in quantum technologies. Many photonic experiments generate them with probabilistic photon-pair sources that can be modeled as squeeze operators. In practice, these sources are usually treated in the…
We propose a quantum dot architecture for enabling universal quantum information processing. Quantum registers, consisting of arrays of vertically stacked self-assembled semiconductor quantum dots, are connected by chains of in-plane…
Cluster states are a useful resource in quantum computation, and can be generated by applying entangling gates between next-neighbor qubits. Heralded entangling gates offer the advantage of high post-selected fidelity, and can be used to…
The ability to perform entangling quantum operations with low error rates in a scalable fashion is a central element of useful quantum information processing. Neutral atom arrays have recently emerged as a promising quantum computing…
The efficient preparation of input distributions is an important problem in obtaining quantum advantage in a wide range of domains. We propose a novel quantum algorithm for the efficient preparation of arbitrary normal distributions in…
Entangled coherent states are useful for various applications in quantum information processing but they are are sensitive to loss. We propose a scheme to generate distributed entangled coherent states over a lossy environment in such a way…
In this work we introduce an open source suite of quantum application-oriented performance benchmarks that is designed to measure the effectiveness of quantum computing hardware at executing quantum applications. These benchmarks probe a…
Randomized algorithms are crucial subroutines in quantum computing, but the requirement to execute many types of circuits on a real quantum device has been challenging to their extensive implementation. In this study, we propose an…
The conventional method for generating entangled states in qubit systems relies on applying precise two-qubit entangling gates alongside single-qubit rotations. However, achieving high-fidelity entanglement demands high accuracy in…
We propose a heralded high-probability scheme to generate remote entanglement between moderate-cooperativity spin-cavity registers with high fidelity. In conventional single-shot interfaces, limited cooperativity restricts the…
In this paper, we examine various software and hardware strategies for implementing high-fidelity controlled-Z gate in the large-scale quantum system by solving the system's Hamiltonian with the Lindblad master equation. First, we show that…
With improved gate calibrations reducing unitary errors, we achieve a benchmarked single-qubit gate fidelity of 99.95% with superconducting qubits in a circuit quantum electrodynamics system. We present a method for distinguishing between…
We formulate the problem of finding the optimal entanglement swapping scheme in a quantum repeater chain as a Markov decision process and present its solution for different repeater's sizes. Based on this, we are able to demonstrate that…
This work introduces a compact framework for analyzing asynchronous entanglement distribution protocols under realistic error models. We focus on two contemporary protocols: sequential, where entanglement is established one node at a time,…
Quantum computers can solve specific complex tasks for which no reasonable-time classical algorithm is known. Quantum computers do however also offer inherent security of data, as measurements destroy quantum states. Using shared entangled…
Quantum computation and quantum communication are expected to provide users with capabilities inaccessible by classical physics. However, scalability to larger systems with many qubits is challenging. One solution is to develop a quantum…
We present a scheme to generate two-dimensional cluster state efficiently. The number of the basic gate-entangler-for the operation is in the order of the entanglement bonds of a cluster state, and could be reduced greatly if one uses them…