A domain decomposition framework for fluid-structure interaction problems

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (30)

Page 2 sur 2

ROS : Resource Constrained Oracle Synthesis for Quantum Computers

Giovanni De Micheli, Mathias Soeken, Giulia Meuli

We present a complete automatic synthesis framework for oracle functions—a central part in many quantum algorithms. The proposed framework for resource-constrained oracle synthesis (ROS) is an LUT-based hierarchical method where every step is specifically ...

2019

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

Alix Sébastien Thibaut Jeannerot, Nicolas Macris, Marc-André Dupertuis, Clément Christian Javerzac, Chun Lam Chan

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

Unique decomposition of homogeneous languages and application to isothetic regions

Nicolas René Jean Ninin

A language is said to be homogeneous when all its words have the same length. Homogeneous languages thus form a monoid under concatenation. It becomes freely commutative under the simultaneous actions of every permutation group G(n) on the collection of ho ...

2019

Programming Quantum Computers Using Design Automation

Mathias Soeken

Recent developments in quantum hardware indicate that systems featuring more than 50 physical qubits are within reach. At this scale, classical simulation will no longer be feasible and there is a possibility that such quantum devices may outperform even c ...

IEEE2018

Towards a scalable quantum computer

Edoardo Charbon

A quantum machine may solve some complex problems that are intractable for even the most powerful classical computers. By exploiting quantum superposition and entanglement phenomena, quantum algorithms can achieve from polynomial to exponential speed up wh ...

2018

Short Stickelberger Class Relations and Application to Ideal-SVP

Benjamin Pierre Charles Wesolowski

The worst-case hardness of finding short vectors in ideals of cyclotomic number fields (Ideal-SVP) is a central matter in lattice based cryptography. Assuming the worst-case hardness of Ideal-SVP allows to prove the Ring-LWE and Ring-SIS assumptions, and t ...

Springer International Publishing Ag2017

15.5 Cryo-CMOS circuits and systems for scalable quantum computing

Edoardo Charbon

Quantum computing holds the promise to achieve unprecedented computation power and to solve problems today intractable. State-of-the-art quantum processors consist of arrays of quantum bits (qubits) operating at a very low base temperature, typically a few ...

2017

Hierarchical Reversible Logic Synthesis Using LUTs

Giovanni De Micheli, Mathias Soeken

Today's rapid advances in the physical implementation of quantum computers demand for scalable synthesis methods in order to map practical logic designs to quantum architectures. We present a synthesis algorithm for quantum computing based on k-LUT network ...

IEEE2017

FaCSI: A block parallel preconditioner for fluid-structure interaction in hemodynamics

Alfio Quarteroni, Simone Deparis, Davide Forti, Gwenol Grandperrin

Modeling Fluid-Structure Interaction (FSI) in the vascular system is mandatory to reliably compute mechanical indicators in vessels undergoing large deformations. In order to cope with the computational complexity of the coupled 3D FSI problem after discre ...

Academic Press Inc Elsevier Science2016

Reduced basis method and domain decomposition for elliptic problems in networks and complex parametrized geometries

Alfio Quarteroni, Gianluigi Rozza, Laura Iapichino

The aim of this work is to solve parametrized partial differential equations in computational domains represented by networks of repetitive geometries by combining reduced basis and domain decomposition techniques. The main idea behind this approach is to ...

Elsevier2016