相关论文: Parallel Quantum Computing in a Single Ensemble Qu…
Quantum sorter has gained a lot of attention during the last years due to its wide application in quantum information processing and quantum technologies. A challenging task is the construction of a quantum sorter, which collect many…
One-way quantum computation, also known as Cluster State Quantum Computation, provides a robust and efficient tool to perform universal quantum computation using only single-qubit projective measurements, given a highly entangled cluster…
Through superposition, a quantum computer is capable of representing an exponentially large set of states, according to the number of qubits available. Quantum machine learning is a subfield of quantum computing that explores the potential…
Quantum computing is a disruptive paradigm widely believed to be capable of solving classically intractable problems. However, the route toward full-scale quantum computers is obstructed by immense challenges associated with the scalability…
One-way quantum computing allows any quantum algorithm to be implemented easily using just measurements. The difficult part is creating the universal resource, a cluster state, on which the measurements are made. We propose a radically new…
In this paper, we consider three types of polynomial equations in quantum computer: linear divisibility equation, which belongs to a special type of binary-quadratic Diophantine equation; quadratic congruence equation with restriction in…
For any quantum algorithm operating on pure states we prove that the presence of multi-partite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the quantum algorithm is to offer an…
When working with algorithms on quantum devices, quantum memory becomes a crucial bottleneck due to low qubit count in NISQ-era devices. In this context, the concept of `divide and compute', wherein a quantum circuit is broken into several…
Quantum neural networks hold significant promise for numerous applications, particularly as they can be executed on the current generation of quantum hardware. However, due to limited qubits or hardware noise, conducting large-scale…
Quantum computing represents a paradigm shift for computation requiring an entirely new computer architecture. However, there is much that can be learned from traditional classical computer engineering. In this paper, we describe the…
Parallel computation enables multiple processors to execute different parts of a task simultaneously, improving processing speed and efficiency. In quantum computing, parallel gate implementation involves executing gates independently in…
We present a dynamic learning paradigm for "programming" a general quantum computer. A learning algorithm is used to find the control parameters for a coupled qubit system, such that the system at an initial time evolves to a state in which…
Quantum computing is a hotspot technology for its potential to accelerate specific applications by exploiting quantum parallelism. However, current physical quantum computers are limited to a relatively small scale, simulators based on…
Quantum computing can provide speedups in solving many problems as the evolution of a quantum system is described by a unitary operator in an exponentially large Hilbert space. Such unitary operators change the phase of their eigenstates…
The Kernel Polynomial Method (KPM) is one of the fast diagonalization methods used for simulations of quantum systems in research fields of condensed matter physics and chemistry. The algorithm has a difficulty to be parallelized on a…
Quantum computers are becoming real, and they have the inherent potential to significantly impact many application domains. We sketch the basics about programming quantum computers, showing that quantum programs are typically hybrid…
Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages over classical methods. Nevertheless, modern VQAs suffer from cumbersome computational overhead,…
The circuit model of quantum computation is reformulated as a multilayer network theory [3] called a Quantum Multiverse Network (QuMvN). The QuMvN formulation allows us to interpret the quantum wave function as a combination of ergodic…
We introduce a local concept of speed-up applicable to intermediate stages of a quantum algorithm. We use it to analyse the complementary roles played by quantum parallel computation and quantum measurement in yielding the speed-up. A…
This paper addresses the challenge of scaling quantum computing by employing distributed quantum algorithms across multiple processors. We propose a novel circuit partitioning method that leverages graph partitioning to optimize both qubit…