Related papers: Reforming Quantum Microgrid Formation
Classical simulations of quantum circuits are essential for verifying and benchmarking quantum algorithms, particularly for large circuits, where computational demands increase exponentially with the number of qubits. Among available…
This paper introduces an innovative quantum-inspired method for beamforming (BF) optimization in multiple-input multiple-output (MIMO) arrays. The method leverages the simulated bifurcation (SB) algorithm to address the complex…
Quantum mechanics is potentially advantageous for certain information-processing tasks, but its probabilistic nature and requirement of measurement back action often limit the precision of conventional classical information-processing…
In recent years, the quantum computing community has seen an explosion of novel methods to implement non-trivial quantum computations on near-term hardware. An important direction of research has been to decompose an arbitrary entangled…
Quantum machine learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure…
A scalable and resource-efficient quantum reinforcement learning framework is presented that eliminates the linear qubit-scaling barrier in multi-step quantum Markov decision processes (QMDPs). The proposed framework integrates a QMDP…
The flow matching has rapidly become a dominant paradigm in classical generative modeling, offering an efficient way to interpolate between two complex distributions. We extend this idea to the quantum realm and introduce the Quantum Flow…
We present a method for mitigating measurement errors on quantum computing platforms that does not form the full assignment matrix, or its inverse, and works in a subspace defined by the noisy input bit-strings. This method accommodates…
The quantum Fourier transform (QFT) plays an important role in many known quantum algorithms such as Shor's algorithm for prime factorisation. In this paper we show that the QFT algorithm can, on a restricted set of input states, be…
This paper introduces the first quantum computing framework for Stochastic Quantum Power Flow (SQPF) analysis in power systems. The proposed method leverages quantum states to encode power flow distributions, enabling the use of Quantum…
Optimally-shaped electromagnetic fields have the capacity to coherently control the dynamics of quantum systems and thus offer a promising means for controlling molecular transformations relevant to chemical, biological, and materials…
Quantum computing carries significant potential for addressing practical problems. However, currently available quantum devices suffer from noisy quantum gates, which degrade the fidelity of executed quantum circuits. Therefore, quantum…
Geometric quantum computation offers a practical strategy toward robust quantum computation due to its inherently error tolerance. However, the rigorous geometric conditions lead to complex and/or error-disturbed quantum controls,…
The quantum period-finding (QPF) algorithm can compute the period of a function exponentially faster than the best-known classical algorithm. In standard QPF, the output state has a primary contribution from $r$ high-probability bit…
The phase folding optimization is a circuit optimization used in many quantum compilers as a fast and effective way of reducing the number of high-cost gates in a quantum circuit. However, existing formulations of the optimization rely on…
Any unitary operation in quantum information processing can be implemented via a sequence of simpler steps - quantum gates. However, actual implementation of a quantum gate is always imperfect and takes a finite time. Therefore, seeking for…
A central aspect for operating future quantum computers is quantum circuit optimization, i.e., the search for efficient realizations of quantum algorithms given the device capabilities. In recent years, powerful approaches have been…
Recently it has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of $T$ gates of about $1/3$ of what is required by optimal, deterministic, ancilla-free decompositions…
Molecular spin qudits based on lanthanide complexes offer a promising platform for quantum technologies, combining chemical tunability with multi-level encoding. However, experimental demonstrations of their envisaged capabilities remain…
Implementing a quantum circuit on specific hardware with a reduced available gate set is often associated with a substantial increase in the length of the equivalent circuit. This process is also known as transpilation and due to…