Results 11 to 20 of about 74,156 (167)
The topology of classical networks is determined by physical links between nodes, and after a network request the links are used to establish the desired connections. Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests, which can substitute links and allow one to fulfill multiple network requests
Jorge Miguel-Ramiro +2 more
openaire +3 more sources
Accepted to NeurIPS ...
Zhongxiang Dai +5 more
openaire +3 more sources
Quantum Bilinear Optimization [PDF]
v3: published ...
Mario Berta +2 more
openaire +4 more sources
Quantum Optimal Transport with Quantum Channels [PDF]
We propose a new generalization to quantum states of the Wasserstein distance, which is a fundamental distance between probability distributions given by the minimization of a transport cost. Our proposal is the first where the transport plans between quantum states are in natural correspondence with quantum channels, such that the transport can be ...
De Palma, G, Trevisan, D
openaire +7 more sources
Quantum Genetic Optimization [PDF]
The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness functions, is , where is the size of the population. The quantum genetic optimization algorithm (QGOA) exploits the power of quantum computation in order to speed up genetic procedures.
Andrea Malossini +2 more
openaire +2 more sources
A verified optimizer for Quantum circuits [PDF]
We present VOQC, the first fully verified optimizer for quantum circuits, written using the Coq proof assistant. Quantum circuits are expressed as programs in a simple, low-level language called SQIR, a simple quantum intermediate representation, which is deeply embedded in Coq.
Kesha Hietala +4 more
openaire +2 more sources
ON OPTIMAL QUANTUM CODES [PDF]
We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary prime power. It is shown that codes with parameters 〚n, n - 2d + 2, d〛q exist for all 3≤n≤q and 1≤d≤n/2+1.
Grassl, M., Beth, T., Rötteler, M.
openaire +2 more sources
We present a quantum algorithm for combinatorial optimization using the cost structure of the search states. Its behavior is illustrated for overconstrained satisfiability and asymmetric traveling salesman problems. Simulations with randomly generated problem instances show each step of the algorithm shifts amplitude preferentially towards lower cost ...
Tad Hogg, Dmitriy Portnov
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sam Cole +3 more
openaire +2 more sources
Quantum Optimization and Quantum Learning: A Survey [PDF]
Quantum mechanism, which has received widespread attention, is in continuous evolution rapidly. The powerful computing power and high parallel ability of quantum mechanism equip the quantum field with broad application scenarios and brand-new vitality. Inspired by nature, intelligent algorithm has always been one of the research hotspots.
Yangyang Li 0001 +4 more
openaire +2 more sources

