Results 91 to 100 of about 3,959 (191)
Q‐fid: Quantum Circuit Fidelity Improvement with LSTM Networks
Q‐fid is introduced, an LSTM‐based fidelity prediction system accompanied by a novel metric designed to quantify the fidelity of quantum circuits. This approach frames fidelity prediction as a Time Series Forecasting problem to analyze the tokenized circuits, capturing the causal dependence of the gate sequences and their impact on overall fidelity ...
Yikai Mao +2 more
wiley +1 more source
Generic Quantum‐Safe IIoT Forensics Framework (QS‐IIoT‐F) ABSTRACT The continuous evolution of quantum computing has shown novel and transformative possibilities and critical implications for the Industrial Internet of Things (IIoT) forensic processes.
Victor R. Kebande
wiley +1 more source
Quantum Computing: Foundations, Architecture and Applications
This paper presents a study on quantum computing's theoretical foundations and applications, illustrated by a quantum circuit diagram featuring gates and measurements that demonstrate qubit manipulation and entanglement. ABSTRACT Quantum computing exploits the principles of quantum mechanics to address computational problems that are intractable to ...
Christopher Columbus Chinnappan +4 more
wiley +1 more source
An improved QAOA algorithm based on multi-angle and RY-assisted structure
The standard quantum approximate optimization algorithm (QAOA) has a limited expressive power in shallow circuits, whereas naively increasing the number of layers leads to greater quantum circuit depth and higher noise sensitivity.
Tian-Yu Ye, Peng-Hui Ma, Zhi-Gang Gan
doaj
Universal resources for quantum approximate optimization algorithm and quantum annealing
The quantum approximate optimization algorithm (QAOA) is a variational ansatz that resembles the Trotterized dynamics of a quantum annealing (QA) protocol.
Pablo Díez-Valle +3 more
doaj +1 more source
Exploring Network-Related Optimization Problems Using Quantum Heuristics [PDF]
Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum ...
Adnane, Mustafa +6 more
core +1 more source
Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs [PDF]
Current state-of-the-art quantum optimization algorithms require representing the original problem as a binary optimization problem, which is then converted into an equivalent cost Hamiltonian suitable for the quantum device.
Bence Bakó +3 more
doaj +1 more source
Scaling whole-chip QAOA for higher-order ising spin glass models on heavy-hex graphs
We show that the quantum approximate optimization algorithm (QAOA) for higher-order, random coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes from 16 up to 127 qubits for p = 1 up to p = 5 ...
Elijah Pelofske +4 more
doaj +1 more source
The pricing of academic journals: A two-sided market perspective [PDF]
More and more academic journals adopt an open-access policy, by which articles are accessible free of charge, while publication costs are recovered through author fees. We study the consequences of this open access policy on a journal’s quality standard.
Doh-Shin Jeon, Jean-Charles Rochet
core
The Quantum Approximation Optimization Algorithm for MaxCut: A Fermionic View [PDF]
Farhi et al. recently proposed a class of quantum algorithms, the Quantum Approximate Optimization Algorithm (QAOA), for approximately solving combinatorial optimization problems. A level-p QAOA circuit consists of steps in which a classical Hamiltonian,
Hadfield, Stuart +3 more
core +1 more source

