Results 51 to 60 of about 19,430 (158)

Clifford quantum computer and the Mathieu groups

open access: yes, 2009
One learned from Gottesman-Knill theorem that the Clifford model of quantum computing \cite{Clark07} may be generated from a few quantum gates, the Hadamard, Phase and Controlled-Z gates, and efficiently simulated on a classical computer.
Planat, Michel
core   +1 more source

On the order three Brauer classes for cubic surfaces

open access: yes, 2011
We describe a method to compute the Brauer-Manin obstruction for smooth cubic surfaces over $\bbQ$ such that $\Br(S)/\Br(\bbQ)$ is a 3-group. Our approach is to associate a Brauer class with every ordered triplet of Galois invariant pairs of Steiner ...
Elsenhans, Andreas-Stephan   +1 more
core   +1 more source

Statistical topological data analysis using persistence landscapes [PDF]

open access: yes, 2015
We define a new topological summary for data that we call the persistence landscape. Since this summary lies in a vector space, it is easy to combine with tools from statistics and machine learning, in contrast to the standard topological summaries ...
Bubenik, Peter
core  

Unitary reflection groups for quantum fault tolerance

open access: yes, 2009
This paper explores the representation of quantum computing in terms of unitary reflections (unitary transformations that leave invariant a hyperplane of a vector space).
Kibler, Maurice R., Planat, Michel
core   +2 more sources

Aspects of Unstructured Grids and Finite-Volume Solvers for the Euler and Navier-Stokes Equations [PDF]

open access: yes, 1992
One of the major achievements in engineering science has been the development of computer algorithms for solving nonlinear differential equations such as the Navier-Stokes equations.
Barth, Timothy J.
core   +1 more source

On group theory for quantum gates and quantum coherence

open access: yes, 2008
Finite group extensions offer a natural language to quantum computing. In a nutshell, one roughly describes the action of a quantum computer as consisting of two finite groups of gates: error gates from the general Pauli group P and stabilizing gates ...
Jorrand, Philippe, Planat, Michel
core   +1 more source

Geometric Reasoning with polymake

open access: yes, 2005
The mathematical software system polymake provides a wide range of functions for convex polytopes, simplicial complexes, and other objects. A large part of this paper is dedicated to a tutorial which exemplifies the usage. Later sections include a survey
Gawrilow, Ewgenij, Joswig, Michael
core   +1 more source

Highly Efficient Passive Thermal Micro-Actuator

open access: yesJournal of microelectromechanical systems, 2015
H. Steiner   +4 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy