English
Related papers

Related papers: Space-Efficient Bimachine Construction Based on th…

200 papers

Bistable autonomous systems can be found inmany areas of science. When the intrinsic noise intensity is large, these systems exhibits stochastic transitions from onemetastable steady state to another. In electronic bistable memories, these…

Statistical Mechanics · Physics 2024-05-14 Léopold Van Brandt , Jean-Charles Delvenne

The encoder-decoder based neural machine translation usually generates a target sequence token by token from left to right. Due to error propagation, the tokens in the right side of the generated sequence are usually of poorer quality than…

Computation and Language · Computer Science 2019-08-27 Xu Tan , Yingce Xia , Lijun Wu , Tao Qin

Presented here is an algorithm for a type-II quantum computer which simulates the Ising model in one and two dimensions. It is equivalent to the Metropolis Monte-Carlo method and takes advantage of quantum superposition for random number…

Quantum Physics · Physics 2007-05-23 J. H. Cole , L. C. L. Hollenberg , S. Prawer

Self-assembly of complex and functional materials remains a grand challenge in soft material science. Efficient assembly depends on a delicate balance between thermodynamic and kinetic effects, requiring fine-tuning affinities and…

Soft Condensed Matter · Physics 2024-11-14 Wei-Shao Wei , Anthony Trubiano , Christian Sigl , Stefan Paquay , Hendrik Dietz , Michael F. Hagan , Seth Fraden

We present a hybrid scheme for quantum computation that combines the modular structure of elementary building blocks used in the circuit model with the advantages of a measurement-based approach to quantum computation. We show how to…

Quantum Physics · Physics 2014-06-24 M. Zwerger , H. J. Briegel , W. Dür

Analog circuit design can be considered as an optimization problem with the targeted circuit specifications as constraints. When stringent circuit specifications are considered, it is desired to have an optimization methodology that adapts…

Neural and Evolutionary Computing · Computer Science 2024-12-24 Ria Rashid , Abhishek Gupta

We provide polynomial-time approximately optimal Bayesian mechanisms for makespan minimization on unrelated machines as well as for max-min fair allocations of indivisible goods, with approximation factors of $2$ and $\min\{m-k+1,…

Computer Science and Game Theory · Computer Science 2014-05-26 Constantinos Daskalakis , S. Matthew Weinberg

Numerical approximation of quantum states via convex combinations of states with positive partial transposes (bi-PPT state) in multipartite systems constitutes a fundamental challenge in quantum information science. We reformulate this…

Mathematical Physics · Physics 2025-09-24 Jingwen Fan , Deren Han , Lin Chen

Ad hoc electrical networks are formed by connecting power sources and loads without planning the interconnection structure (topology) in advance. They are designed to be installed and operated by individual communities---without central…

Systems and Control · Computer Science 2017-10-24 Kathleen Cavanagh , Julia A. Belk , Konstantin Turitsyn

We consider a production line consisting of several machines in series separated by intermediate finite-capacity buffers. The line operates under an "echelon buffer" (EB) policy according to which each machine can store the parts that it…

Systems and Control · Computer Science 2019-03-12 George Liberopoulos

We propose a phase transition on the feasibility of efficient parallel assembly. By introducing the parallel efficiency that measures how efficiently the parallel assembly works, the parallelizable phase is defined by its positive value.…

Statistical Mechanics · Physics 2023-06-01 Ikumi Kobayashi , Shin-ichi Sasa

Two different algorithms are presented for generating a quantum circuit realization of a matrix representing a permutation on $2^n$ letters. All circuits involve $n$ qubits and only use multi--controlled Toffoli gates. The first algorithm…

Quantum Physics · Physics 2025-12-16 Jason Hanson

We consider a tandem queue with coupled processors, which is subject to global breakdowns. When the network is in the operating mode and both queues are non empty, the total service capacity is shared among the stations according to fixed…

Probability · Mathematics 2019-03-08 Ioannis Dimitriou

Quantum data loading plays a central role in quantum algorithms and quantum information processing. Many quantum algorithms hinge on the ability to prepare arbitrary superposition states as a subroutine, with claims of exponential speedups…

Quantum Physics · Physics 2025-09-25 Chun-Tse Li , Hao-Chung Cheng

A semiclassical formalism is used to investigate the transistor-like behavior of ultracold atoms in a triple-well potential. Atom current flows from the source well, held at fixed chemical potential and temperature, into an empty drain…

Atomic Physics · Physics 2016-02-17 Seth C. Caliga , Cameron J. E. Straatsma , Alex A. Zozulya , Dana Z. Anderson

Standard Transformers excel at semantic modeling but struggle with rigid sequential logic and state tracking. Theoretical work establishes that self-attention is limited to $\AC^0$ (under hard attention) or $\TC^0$ (under soft attention),…

Machine Learning · Computer Science 2026-02-10 Mehryar Mohri

We propose quantum engines powered entirely by the quantum measurement process. Our theoretical construction of the engine requires no work from the system Hamiltonian, and takes energy only from the process of observation to move a…

Quantum Physics · Physics 2018-07-18 Cyril Elouard , Andrew N. Jordan

Quantum theory is based on a mathematical structure totally different from conventional arithmetic. Due to the symmetric nature of bosonic particles, annihilation or creation of single particles translates a quantum state depending on how…

Quantum Physics · Physics 2016-05-05 Mark Um , Junhua Zhang , Dingshun Lv , Yao Lu , Shuoming An , Jing-Ning Zhang , Hyunchul Nha , M. S. Kim , Kihwan Kim

In this paper, we propose novel methods for constructing uninorms using two comparable closure operators or, alternatively, two comparable interior operators on bounded lattices. These methods are developed under the necessary and…

Functional Analysis · Mathematics 2025-05-08 Zhenyu Xiu , Xu Zheng

The precise complexity of complementing B\"uchi automata is an intriguing and long standing problem. While optimal complementation techniques for finite automata are simple - it suffices to determinize them using a simple subset…

Formal Languages and Automata Theory · Computer Science 2009-03-02 Sven Schewe
‹ Prev 1 4 5 6 7 8 10 Next ›