Search Results - Theory of computation, Models of computation

Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory by Carette, Titouan, de Visme, Marc, Perdrix, Simon

“…) quantum computations acting on a finite number of qubits. Meanwhile, delayed traces have been used as a graphical way to represent finite-memory computations on streams, in a classical setting…”
Get full text

In search of lost time: Axiomatising parallel composition in process algebras by Aceto, Luca, Anastasiadi, Elli, Castiglioni, Valentina, Ingolfsdottir, Anna, Luttik, Bas

“…This survey reviews some of the most recent achievements in the saga of the axiomatisation of parallel composition, along with some classic results. We focus…”
Get full text

Comonadic semantics for guarded fragments by Abramsky, Samson, Marsden, Dan

“…In previous work ([1], [2], [3]), it has been shown how a range of model comparison games which play a central role in finite model theory, including Ehrenfeucht-Fraïssé…”
Get full text

A distributed operational view of Reversible Prime Event Structures by Melgratti, Hernan, Mezzina, Claudio Antares, Michele Pinna, G.

“…Reversible prime event structures extend the well-known model of prime event structures to represent reversible computational processes…”
Get full text

Skywalker: Efficient Alias-Method-Based Graph Sampling and Random Walk on GPUs by Wang, Pengyu, Li, Chao, Wang, Jing, Wang, Taolei, Zhang, Lu, Leng, Jingwen, Chen, Quan, Guo, Minyi

“…Graph sampling and random walk operations, capturing the structural properties of graphs, are playing an important role today as we cannot directly adopt…”
Get full text

Some constructive variants of S4 with the finite model property by Balbiani, Philippe, Dieguez, Martin, Fernandez-Duque, David

“…The logics CS4 and IS4 are intuitionistic variants of the modal logic S4. Whether the finite model property holds for each of these logics has been a long-standing open problem…”
Get full text

Asynchronous Template Games and the Gray Tensor Product of 2-Categories by Mellies, Paul-Andre

“…In his recent and exploratory work on template games and linear logic, Melliès defines sequential and concurrent games as categories with positions as objects…”
Get full text

EnQode: Fast Amplitude Embedding for Quantum Machine Learning Using Classical Data by Han, Jason, DiBrita, Nicholas S., Cho, Younghyun, Luo, Hengrui, Patel, Tirthak

“…-driven inconsistencies that degrade model accuracy. We introduce EnQode, a fast AE technique based on symbolic representation that addresses these limitations…”
Get full text

Towards Training Robustness Against Dynamic Errors in Quantum Machine Learning by Duan, Shijin, Liu, Gaowen, Fleming, Charles, Kompella, Ramana, Xu, Xiaolin, Ren, Shaolei

“…Quantum machine learning, crucial in the noisy intermediate-scale quantum (NISQ) era, confronts challenges in error mitigation. Current noise-aware training…”
Get full text

CUDA Quantum: The Platform for Integrated Quantum-Classical Computing by Kim, Jin-Sung, McCaskey, Alex, Heim, Bettina, Modani, Manish, Stanwyck, Sam, Costa, Timothy

“… be important for many of the functions required to realize useful quantum computing. A key tool for enabling research and application development is a programming model…”
Get full text

SAPO: Improving the Scalability and Accuracy of Quantum Linear Solver for Portfolio Optimization by Zhu, Tianze, Lu, Liqiang, Chen, Jiajun, Chen, Yuhang, Chen, Hengrui, Xi, Meng, Zhang, Jinshan, Sun, Xiaoming, Yin, Jianwei

“… In this paper, we propose SAPO, which formally articulates the quantum circuit that seamlessly integrates financial theory and historical data characteristics with quantum algebra…”
Get full text

Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all frames by Verbrugge, Rineke

“…: As the number of elements of finite models increases, every formula holds either in almost all or in almost no models of that size…”
Get full text

On Logics and Homomorphism Closure by Bodirsky, Manuel, Feller, Thomas, Knauer, Simon, Rudolph, Sebastian

“…) of the class of all (finite or arbitrary) models of logical sentences: membership of structures in a sentence's homclosure…”
Get full text

Compositional Semantics for Probabilistic Programs with Exact Conditioning by Stein, Dario, Staton, Sam

“…We define a probabilistic programming language for Gaussian random variables with a first-class exact conditioning construct. We give operational, denotational…”
Get full text

Lightning Talk: Scaling Up Quantum Compilation - Challenges and Opportunities by Cong, Jason

“…] . Recently, neutral atoms trapped in arrays of optical tweezers emerged as a very promising experimental platform with hundreds of qubits at room temperature for programmable quantum simulations and quantum computation [6] , [7…”
Get full text

Gluon-Async: A Bulk-Asynchronous System for Distributed and Heterogeneous Graph Analytics by Dathathri, Roshan, Gill, Gurbinder, Hoang, Loc, Jatala, Vishwesh, Pingali, Keshav, Nandivada, V. Krishna, Dang, Hoang-Vu, Snir, Marc

“…) programming and execution model. BSP permits bulk-communication and uses large messages which are supported efficiently by current message transport layers, but bulk-synchronization can exacerbate the performance impact of load…”
Get full text

Finite Model Theory of the Triguarded Fragment and Related Logics by Kieronski, Emanuel, Rudolph, Sebastian

“… We show that the TGF has the finite model property (providing a tight doubly exponential bound on the model size…”
Get full text

Normalization for Cubical Type Theory by Sterling, Jonathan, Angiuli, Carlo

“…We prove normalization for (univalent, Cartesian) cubical type theory, closing the last major open problem in the syntactic metatheory of cubical type theory…”
Get full text

ACGraph: Accelerating Streaming Graph Processing via Dependence Hierarchy by Jiang, Zihan, Mao, Fubing, Guo, Yapu, Liu, Xu, Liu, Haikun, Liao, Xiaofei, Jin, Hai, Zhang, Wei

“…Streaming graph processing needs to timely evaluate continuous queries. Prior systems suffer from massive redundant computations due to the irregular order of processing vertices influenced by updates…”
Get full text

Commutative Monads for Probabilistic Programming Languages by Jia, Xiaodong, Lindenhovius, Bert, Mislove, Michael, Zamdzhiev, Vladimir

“…A long-standing open problem in the semantics of programming languages supporting probabilistic choice is to find a commutative monad for probability on the…”
Get full text