Results 11 to 20 of about 4,649,254 (341)
Time complexity and gate complexity [PDF]
We formulate and investigate the simplest version of time-optimal quantum computation theory (t-QCT), where the computation time is defined by the physical one and the Hamiltonian contains only one- and two-qubit interactions.
D. J. Tannor +5 more
core +2 more sources
Space-Time Complexity in Hamiltonian Dynamics [PDF]
New notions of the complexity function C(epsilon;t,s) and entropy function S(epsilon;t,s) are introduced to describe systems with nonzero or zero Lyapunov exponents or systems that exhibit strong intermittent behavior with ``flights'', trappings, weak ...
Brudno A. A. +7 more
core +3 more sources
The time complexity of self-assembly. [PDF]
ABSTRACTTime efficiency of self-assembly is crucial for many biological processes. Moreover, with the advances of nanotechnology, time efficiency in artificial self-assembly becomes ever more important. While structural determinants and the final assembly yield are increasingly well understood, kinetic aspects concerning the time efficiency, however ...
Gartner FM, Graf IR, Frey E.
europepmc +5 more sources
Complex-barrier tunnelling times [PDF]
In this paper we calculate the analytic expression of the phase time for the scattering of an electron off a complex square barrier. As is well known the (negative) imaginary part of the potential takes into account, phenomenologically, the absorption. We investigate the so-called Hartman-Fletcher effect, and find that it is suppressed by the presence ...
RACITI, Fabio, SALESI G.
openaire +5 more sources
For any quantum algorithm given by a path in the space of unitary operators we define the computational complexity as the typical computational time associated with the path. This time is defined using a quantum time estimator associated with the path.
openaire +3 more sources
Complexity Leadership: On Time, On Budget [PDF]
A discursive piece aimed at practitioners in Engineering Management. On the subject of Complexity Leadership and KPIs, this short article presents three models which expand on the work of Uhl-Bien and Marion (2007) by focusing on Administrative, Enabling and Adaptive Leaderships for managing complexity.<div><br></div>
Chris Biggadike +2 more
openaire +3 more sources
Almost Optimal Searching of Maximal Subrepetitions in a Word
For some fixed δ such that ...
Roman Kolpakov
doaj +1 more source
Accurate Estimate of the Advantage of Impossible Differential Attacks
Impossible differential attacks, which are taking advantage of differentials that cannot occur, are powerful attacks for block cipher primitives. The power of such attacks is often measured in terms of the advantage — number of key-bits found during the ...
Céline Blondeau
doaj +1 more source
Detecting Deterministic Chaotic Inter-arrival Times in Material Flow Systems
Automated, modular, asynchronous and locally controlled material flow systems promise high routing flexibility in production lines because their conveying modules can be reconfigured without reprogramming PLCs.
Manns, Martin +3 more
doaj +1 more source
Towards a Unified Framework of Matrix Derivatives
The need of processing and analyzing massive statistics simultaneously requires the derivatives of matrix-to-scalar functions (scalar-valued functions of matrices) or matrix-to-matrix functions (matrixvalued functions of matrices).
Jianyu Xu +4 more
doaj +1 more source

