[HTML][HTML] Distributed quantum computing: a survey

M Caleffi, M Amoretti, D Ferrari, J Illiano, A Manzalini… - Computer Networks, 2024 - Elsevier
Nowadays, quantum computing has reached the engineering phase, with fully-functional
quantum processors integrating hundreds of noisy qubits. Yet–to fully unveil the potential of …

Amazon employees resources access data extraction via clonal selection algorithm and logic mining approach

NE Zamri, MA Mansor, MS Mohd Kasihmuddin… - Entropy, 2020 - mdpi.com
Amazon. com Inc. seeks alternative ways to improve manual transactions system of granting
employees resources access in the field of data science. The work constructs a modified …

Architecture-aware synthesis of phase polynomials for NISQ devices

AM de Griend, R Duncan - arXiv preprint arXiv:2004.06052, 2020 - arxiv.org
We propose a new algorithm to synthesise quantum circuits for phase polynomials, which
takes into account the qubit connectivity of the quantum computer. We focus on the …

Efficient boolean methods for preparing uniform quantum states

F Mozafari, H Riener, M Soeken… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
As each quantum algorithm requires a specific initial quantum state, quantum state
preparation is an important task in quantum computing. The preparation of quantum states is …

Noise-adaptive quantum compilation strategies evaluated with application-motivated benchmarks

D Ferrari, M Amoretti - Proceedings of the 19th ACM International …, 2022 - dl.acm.org
Quantum compilation is the problem of translating an input quantum circuit into the most
efficient equivalent of itself, taking into account the characteristics of the device that will …

SAT‐based and CP‐based declarative approaches for Top‐Rank‐K closed frequent itemset mining

S Abed, AA Abdelaal, MH Al‐Shayeji… - International Journal of …, 2021 - Wiley Online Library
Abstract Top‐Rank‐K Frequent Itemset (or Pattern) Mining (FPM) is an important data
mining task, where user decides on the number of top frequency ranks of patterns (itemsets) …

[PDF][PDF] Quantum circuit optimisation through stabiliser reduction of pauli exponentials

O Cole - Master's thesis, University of Oxford, 2022 - cs.ox.ac.uk
Quantum circuits require careful and in-depth optimisation to be run on existing quantum
computers. This project investigates the application of the Product Rotation Lemma …

Deterministic algorithms for compiling quantum circuits with recurrent patterns

D Ferrari, I Tavernelli, M Amoretti - Quantum Information Processing, 2021 - Springer
Current quantum processors are noisy and have limited coherence and imperfect gate
implementations. On such hardware, only algorithms that are shorter than the overall …

Tucker-1 boolean tensor factorization with quantum annealers

D O'Malley, HN Djidjev… - … on Rebooting Computing …, 2020 - ieeexplore.ieee.org
Quantum annealers are an emerging computational architecture that have the potential to
address some challenging computational issues that will be left unresolved as we approach …

QCEDA: Using Quantum Computers for EDA

M Jung, SO Krumke, C Schroth, E Lobe… - arXiv preprint arXiv …, 2024 - arxiv.org
The field of Electronic Design Automation (EDA) is crucial for microelectronics, but the
increasing complexity of Integrated Circuits (ICs) poses challenges for conventional EDA …