Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Laakkonen, Tuomas"'
Autor:
Duneau, Tiffany, Bruhn, Saskia, Matos, Gabriel, Laakkonen, Tuomas, Saiti, Katerina, Pearson, Anna, Meichanetzidis, Konstantinos, Coecke, Bob
We present the first implementation of text-level quantum natural language processing, a field where quantum computing and AI have found a fruitful intersection. We focus on the QDisCoCirc model, which is underpinned by a compositional approach to re
Externí odkaz:
http://arxiv.org/abs/2409.08777
Publikováno v:
EPTCS 406, 2024, pp. 162-196
Quantum computing and AI have found a fruitful intersection in the field of natural language processing. We focus on the recently proposed DisCoCirc framework for natural language, and propose a quantum adaptation, QDisCoCirc. This is motivated by a
Externí odkaz:
http://arxiv.org/abs/2408.06061
Autor:
Rodatz, Benjamin, Fan, Ian, Laakkonen, Tuomas, Ortega, Neil John, Hoffman, Thomas, Wang-Mascianica, Vincent
Idealised as universal approximators, learners such as neural networks can be viewed as "variable functions" that may become one of a range of concrete functions after training. In the same way that equations constrain the possible values of variable
Externí odkaz:
http://arxiv.org/abs/2407.02424
We introduce a category-theoretic diagrammatic formalism in order to systematically relate and reason about machine learning models. Our diagrams present architectures intuitively but without loss of essential detail, where natural relationships betw
Externí odkaz:
http://arxiv.org/abs/2407.02423
Autor:
Ruiz, Francisco J. R., Laakkonen, Tuomas, Bausch, Johannes, Balog, Matej, Barekatain, Mohammadamin, Heras, Francisco J. H., Novikov, Alexander, Fitzpatrick, Nathan, Romera-Paredes, Bernardino, van de Wetering, John, Fawzi, Alhussein, Meichanetzidis, Konstantinos, Kohli, Pushmeet
A key challenge in realizing fault-tolerant quantum computers is circuit optimization. Focusing on the most expensive gates in fault-tolerant quantum computation (namely, the T gates), we address the problem of T-count optimization, i.e., minimizing
Externí odkaz:
http://arxiv.org/abs/2402.14396
Parametrised quantum circuits contain phase gates whose phase is determined by a classical algorithm prior to running the circuit on a quantum device. Such circuits are used in variational algorithms like QAOA and VQE. In order for these algorithms t
Externí odkaz:
http://arxiv.org/abs/2401.12877
Publikováno v:
EPTCS 384, 2023, pp. 89-113
Counting the solutions to Boolean formulae defines the problem #SAT, which is complete for the complexity class #P. We use the ZH-calculus, a universal and complete graphical language for linear maps which naturally encodes counting problems in terms
Externí odkaz:
http://arxiv.org/abs/2304.02524
Publikováno v:
EPTCS 406, 2024, pp. 137-161
We study the counting version of the Boolean satisfiability problem #SAT using the ZH-calculus, a graphical language originally introduced to reason about quantum circuits. Using this, we generalize #SAT to a weighted variant we call #SAT+-, which is
Externí odkaz:
http://arxiv.org/abs/2212.08048