Related papers: Reforming Quantum Microgrid Formation
Sustainable advancement is being made to improve the efficiency of the generation, transmission, and distribution of renewable energy resources, as well as managing them to ensure the reliable operation of the smart grid. Supervisory…
Quantum circuit simulation is important in the evolution of quantum software and hardware. Novel algorithms can be developed and evaluated by performing quantum circuit simulations on classical computers before physical quantum computers…
In this project summary paper, we summarize the key results and use-cases explored in the German Federal Ministry of Education and Research (BMBF) funded project "Q-GRID" which aims to assess potential quantum utility optimization…
Immense interest in quantum computing has prompted development of electronic structure methods that are suitable for quantum hardware. However, the slow pace at which quantum hardware progresses, forces researchers to implement their ideas…
The concept of quantum representation of finite groups (QRFG) has been a fundamental aspect of quantum computing for quite some time, playing a role in every corner, from elementary quantum logic gates to the famous Shor's and Grover's…
Quantum computing offers significant potential for solving NP-hard combinatorial (optimization) problems that are beyond the reach of classical computers. One way to tap into this potential is by reformulating combinatorial problems as a…
Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve on a classical computer. Current generation noisy…
Quadratic Unconstrained Binary Optimization (QUBO) is a standard NP-hard optimization problem. Recently, it has gained renewed interest through quantum computing, as QUBOs directly reduce to the Ising model, on which quantum annealing…
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations,…
One of the main goals in quantum circuit optimisation is to reduce the number of ancillary qubits and the depth of computation, to obtain robust computation. However, most of known techniques, based on local rewriting rules, for…
In this paper, an algorithm for Quantum Inverse Fast Fourier Transform (QIFFT) is developed to work for quantum data. Analogous to a classical discrete signal, a quantum signal can be represented in Dirac notation, application of QIFFT is a…
There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivity, and coherence times, a quantum circuit optimization is essential to make the best use of near-term quantum devices. We…
A number of elegant approaches have been developed for the identification of quantum circuits which can be efficiently simulated on a classical computer. Recently, these methods have been employed to demonstrate the classical simulability…
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…
We propose a method for implementation of an universal set of one- and two-quantum-bit gates for quantum computation in the system of two coupled electrons with constant non-diagonal exchange interaction. Suppression of the exchange…
We introduce Quantum Functional Information (QFI), a new metric to quantify the rarity and utility of quantum states and circuits. Unlike standard measures such as fidelity or entropy, QFI captures the balance between functionality and…
A fundamental challenge in photonics-based deterministic quantum information processing is to realize key transformations on time scales shorter than those of detrimental decoherence and loss mechanisms. This challenge has been addressed…
A range of quantum algorithms, especially those leveraging variational parameterization and circuit-based optimization, are being studied as alternatives for solving classically intractable combinatorial optimization problems (COPs).…
Due to the rapid development of quantum computing, the compact representation of quantum operations based on decision diagrams has been received more and more attraction. Since variable orders have a significant impact on the size of the…
Compilation and optimization of quantum circuits are critical components in the execution of algorithms on quantum computers. These components must successfully balance two competing priorities: minimizing the number of expensive resources,…