Your browser doesn't support javascript.
loading
Show: 20 | 50 | 100
Results 1 - 5 de 5
Filter
Add more filters










Database
Language
Publication year range
1.
PLoS One ; 6(5): e19663, 2011 May 10.
Article in English | MEDLINE | ID: mdl-21573006

ABSTRACT

Quantum phase estimation is one of the key algorithms in the field of quantum computing, but up until now, only approximate expressions have been derived for the probability of error. We revisit these derivations, and find that by ensuring symmetry in the error definitions, an exact formula can be found. This new approach may also have value in solving other related problems in quantum computing, where an expected error is calculated. Expressions for two special cases of the formula are also developed, in the limit as the number of qubits in the quantum computer approaches infinity and in the limit as the extra added qubits to improve reliability goes to infinity. It is found that this formula is useful in validating computer simulations of the phase estimation procedure and in avoiding the overestimation of the number of qubits required in order to achieve a given reliability. This formula thus brings improved precision in the design of quantum computers.


Subject(s)
Algorithms , Probability , Quantum Theory
2.
PLoS One ; 6(12): e29417, 2011.
Article in English | MEDLINE | ID: mdl-22216276

ABSTRACT

We present a scheme to use external quantum devices using the universal quantum computer previously constructed. We thereby show how the universal quantum computer can utilize networked quantum information resources to carry out local computations. Such information may come from specialized quantum devices or even from remote universal quantum computers. We show how to accomplish this by devising universal quantum computer programs that implement well known oracle based quantum algorithms, namely the Deutsch, Deutsch-Jozsa, and the Grover algorithms using external black-box quantum oracle devices. In the process, we demonstrate a method to map existing quantum algorithms onto the universal quantum computer.


Subject(s)
Computers , Quantum Theory
3.
Phys Rev E Stat Nonlin Soft Matter Phys ; 80(5 Pt 1): 051907, 2009 Nov.
Article in English | MEDLINE | ID: mdl-20365006

ABSTRACT

The amorphous aggregation of proteins is associated with many phenomena, ranging from the formation of protein wine haze to the development of cataract in the eye lens and the precipitation of recombinant proteins during their expression and purification. While much literature exists describing models for linear protein aggregation, such as amyloid fibril formation, there are few reports of models which address amorphous aggregation. Here, we propose a model to describe the amorphous aggregation of proteins which is also more widely applicable to other situations where a similar process occurs, such as in the formation of colloids and nanoclusters. As first applications of the model, we have tested it against experimental turbidimetry data of three proteins relevant to the wine industry and biochemistry, namely, thaumatin, a thaumatinlike protein, and alpha -lactalbumin. The model is very robust and describes amorphous experimental data to a high degree of accuracy. Details about the aggregation process, such as shape parameters of the aggregates and rate constants, can also be extracted.


Subject(s)
Models, Chemical , Models, Molecular , Multiprotein Complexes/chemistry , Multiprotein Complexes/ultrastructure , Proteins/chemistry , Proteins/ultrastructure , Computer Simulation , Dimerization
4.
Phys Rev Lett ; 93(15): 152002, 2004 Oct 08.
Article in English | MEDLINE | ID: mdl-15524865

ABSTRACT

We investigate the infrared behavior of gluon and ghost propagators in Landau-gauge QCD by means of an exact renormalization group equation. We explain how, in general, the infrared momentum structure of Green functions can be extracted within this approach. An optimization procedure is devised to remove residual regulator dependences. In Landau-gauge QCD this framework is used to determine the infrared leading terms of the propagators. The results support the Kugo-Ojima confinement scenario. Possible extensions are discussed.

5.
Med Phys ; 31(12): 3242-66, 2004 Dec.
Article in English | MEDLINE | ID: mdl-15651608

ABSTRACT

We present a new high-precision method for the geometric calibration in cone-beam computed tomography. It is based on a Fourier analysis of the projection-orbit data, recorded with a flat-panel area detector, of individual point-like objects. For circular scan trajectories the complete set of misalignment parameters which determine the deviation of the detector alignment from the ideal scan geometry are obtained from explicit analytic expressions. To derive these expressions we show how to disentangle the problems of calculating misalignment parameters and point coordinates. The calculation of the coordinates of the point objects inside the scanned volume, in units of the distance from the focal spot to the center of rotation, is then possible analytically likewise. We simulate point-projection data on a misaligned detector with various amounts of randomness added to mimic measurement uncertainties. This data is then employed in our calibration to validate the method by comparing the resulting misalignment parameters and point coordinates to the known true ones. We also present our implementation and results for the geometric calibration of micro-CT systems. The effectiveness of the corresponding misalignment correction in reducing image artifacts is exemplified by reconstructed micro-CT images.


Subject(s)
Algorithms , Artifacts , Imaging, Three-Dimensional/methods , Radiographic Image Enhancement/methods , Radiographic Image Interpretation, Computer-Assisted/methods , Tomography, Spiral Computed/methods , Calibration , Computer Simulation , Data Interpretation, Statistical , Information Storage and Retrieval/methods , Models, Biological , Phantoms, Imaging , Reproducibility of Results , Sensitivity and Specificity , Subtraction Technique , Tomography, Spiral Computed/instrumentation
SELECTION OF CITATIONS
SEARCH DETAIL
...