Machine de Turing alternante

Efficient Quantum Algorithms for GHZ and W States, and Implementation on the IBM Quantum Computer

Nicolas Macris, Clément Christian Javerzac-Galy, Marc-André Dupertuis, Kenichi Komagata, Chun Lam Chan, Fabien Gremion, Jarla Thiesbrummel, Romain Fournier

Efficient deterministic algorithms are proposed with logarithmic step complexities for the generation of entangled GHZ(N) and W-N states useful for quantum networks, and an implementation on the IBM quantum computer up to N = 16 is demonstrated. Improved q ...

WILEY2019

Solving quantified linear arithmetic by counterexample-guided instantiation

Viktor Kuncak, Andrew Joseph Reynolds

This paper presents a framework to derive instantiation-based decision procedures for satisfiability of quantified formulas in first-order theories, including its correctness, implementation, and evaluation. Using this framework we derive decision procedur ...

2017

Tight Bounds for Asynchronous Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual ...

Association for Computing Machinery2014

A Novel Method for the Optimal Parameter Selection of Discrete-Time Switch Model

Mario Paolone, Farhad Rachidi-Haeri, Reza Razzaghi, Chrysanthi Foti

The paper proposes a novel method for the optimal parameter selection of the discrete-time switch model used in circuit solvers that adopt the Fixed Admittance Matrix Nodal Method (FAMNM) approach. As known, FAMNM-based circuit solvers allow to reach effic ...

The University of British Columbia2013

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

We give two new randomized algorithms for tight renaming, both of which work against an adaptive adversary. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of

n

processes with step complexity $ ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

n

processes with step complexity $ ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Machine de Turing alternante

Graph Chatbot

Efficient Quantum Algorithms for GHZ and W States, and Implementation on the IBM Quantum Computer

Solving quantified linear arithmetic by counterexample-guided instantiation

Tight Bounds for Asynchronous Renaming

A Novel Method for the Optimal Parameter Selection of Discrete-Time Switch Model

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Computing with Reads and Writes in the Absence of Step Contention

Efficient Quantum Algorithms for GHZ and W States, and Implementation on the IBM Quantum Computer

Solving quantified linear arithmetic by counterexample-guided instantiation

Tight Bounds for Asynchronous Renaming

A Novel Method for the Optimal Parameter Selection of Discrete-Time Switch Model

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Computing with Reads and Writes in the Absence of Step Contention