Related papers: Entangling Power in the Deterministic Quantum Comp…
This paper presents a quantum algorithm for efficiently decoding hypervectors, a crucial process in extracting atomic elements from hypervectors - an essential task in Hyperdimensional Computing (HDC) models for interpretable learning and…
We show that thresholds for fault-tolerant quantum computation are solely determined by the quality of single-system operations if one allows for d-dimensional systems with $8 \leq d \leq 32$. Each system serves to store one logical qubit…
Quantum computing has been a fascinating research field in quantum physics. Recent progresses motivate us to study in depth the universal quantum computing models (UQCM), which lie at the foundation of quantum computing and have tight…
We prove that one-way quantum computations have the same computational power as quantum circuits with unbounded fan-out. It demonstrates that the one-way model is not only one of the most promising models of physical realisation, but also a…
Measurement-based quantum computation (MQC) is a paradigm for studying quantum computation using many-body entanglement and single-qubit measurements. While MQC has inspired wide-ranging discoveries throughout quantum information, our…
In recent years, interest in quantum computing has increased due to technological advances in quantum hardware and algorithms. Despite the promises of quantum advantage, the applicability of quantum devices has been limited to few qubits on…
Entanglement swapping, the process to entangle two particles without coupling them in any way, is one of the most striking manifestations of the quantum-mechanical nonlocal characteristic. Besides fundamental interest, this process has…
It is generally believed that entanglement is essential for quantum computing. We present here a few simple examples in which quantum computing without entanglement is better than anything classically achievable, in terms of the reliability…
Quantum entanglement is a key resource for quantum computation and quantum communication \cite{Nielsen2010}. Scaling to large quantum communication or computation networks further requires the deterministic generation of multi-qubit…
Quantum entanglement plays an irreplaceable role in various remote quantum information processing tasks. Here we present protocols for generating deterministic and heralded $N$-qubit entangled states across multiple network nodes. By…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
The Measurement Based Quantum Computation (MBQC) model achieves universal quantum computation by employing projective single qubit measurements with classical feedforward on a highly entangled multipartite cluster state. Rapid advances in…
A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g.…
Quantum computing exploits quantum phenomena such as superposition and entanglement to realize a form of parallelism that is not available to traditional computing. It offers the potential of significant computational speed-ups in quantum…
In this paper I argue that entanglement is a necessary component for any explanation of quantum speedup and I address some purported counter-examples that some claim show that the contrary is true. In particular, I address Biham et al.'s…
We present two algorithms, one quantum and one classical, for estimating partition functions of quantum spin Hamiltonians. The former is a DQC1 (Deterministic quantum computation with one clean qubit) algorithm, and the first such for…
The mathematical structure of quantum entanglement is studied and classified from the point of view of quantum compound states. We show that t he classical-quantum correspondences such as encodings can be treated as dia gonal (d-)…
We introduce with geometric means a density matrix decomposition of a multipartite quantum system of a finite dimension into two density matrices: a separable one, also known as the best separable approximation, and an essentially entangled…
The possibility to save and process information in fundamentally indistinguishable states is the quantum mechanical resource that is not encountered in classical computing. I demonstrate that, if energy constraints are imposed, this…
Quantum computing (QC) is a new computational paradigm whose foundations relate to quantum physics. Notable progress has been made, driving the birth of a series of quantum-based algorithms that take advantage of quantum computational…