Related papers: Simon algorithm in measurement-based quantum compu…
Individual impurity atoms in silicon can make superb individual qubits, but it remains an immense challenge to build a multi-qubit processor: There is a basic conflict between nanometre separation desired for qubit-qubit interactions, and…
Quantum computing, leveraging quantum phenomena like superposition and entanglement, is emerging as a transformative force in computing technology, promising unparalleled computational speed and efficiency crucial for engineering…
Given the effectiveness of semiconductor devices for classical computation one is naturally led to consider semiconductor systems for solid state quantum information processing. Semiconductors are particularly suitable where local control…
We propose a quantum machine learning algorithm for efficiently solving a class of problems encoded in quantum controlled unitary operations. The central physical mechanism of the protocol is the iteration of a quantum time-delayed equation…
In this paper we develop a classical algorithm of complexity $O(K \, 2^n)$ to simulate parametrized quantum circuits (PQCs) of $n$ qubits, where $K$ is the total number of one-qubit and two-qubit control gates. The algorithm is developed by…
Quantum Reservoir Computing (QRC) harnesses quantum systems to tackle intricate computational problems with exceptional efficiency and minimized energy usage. This paper presents a QRC framework that utilizes a minimalistic quantum…
We present a framework that utilizes quantum algorithms, an architecture aware quantum noise model and an ideal simulator to benchmark quantum computers. The benchmark metrics highlight the difference between the quantum computer evolution…
By using a new way to encode Boolean functions in a reversible gate, an algorithm is developed in quantum computing over Z_2, symbolized QC/2, (as opposed to QC over C) that needs only one function evaluation to solve the Grover Database…
It is believed that random quantum circuits are difficult to simulate classically. These have been used to demonstrate quantum supremacy: the execution of a computational task on a quantum computer that is infeasible for any classical…
Advancements in the implementation of quantum hardware have enabled the acquisition of data that are intractable for emulation with classical computers. The integration of classical machine learning (ML) algorithms with these data holds…
Quantum computers require error correction to achieve universal quantum computing. However, current decoding of quantum error-correcting codes relies on classical computation, which is slower than quantum operations in superconducting…
Quantum-inspired classical algorithms has received much attention due to its exponential speedup compared to existing algorithms, under certain data storage assumptions. The improvements are noticeable in fundamental linear algebra tasks.…
Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm,…
In the context of finite Abelian groups two problems are presented and solved using quantum computing techniques. The first is the well--known Hidden Subgroup Problem, originally solved by Simon in a landmark work. The second is the Fully…
Demonstrating quantum advantage has been a pressing challenge in the field. Most claimed quantum speedups rely on a subroutine in which classical information can be accessed in a coherent quantum manner, which imposes a crucial constraint…
Solving quantum molecular systems presents a significant challenge for classical computation. The advent of early fault-tolerant quantum computing (EFTQC) devices offers a promising avenue to address these challenges, leveraging advanced…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Quantum computing tries to exploit entanglement and interference to process information more efficiently than the best known classical solutions. Experiments demonstrating the feasibility of this approach have already been performed.…
Photonic quantum computing provides a promising route toward quantum computation by naturally supporting the measurement-based quantum computation (MBQC) model. In MBQC, programs are executed through measurements on a pre-generated graph…
Measurement-based quantum computation (MBQC) is a strong contender for realizing quantum computers. A critical question for MBQC is the identification of resource graph states that can enable universal quantum computation. Any such…