Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,099 records · Page 61

Modified Closures in Monte Carlo Algorithms for Diffusive Binary Stochastic Media Transport Problems

In a stochastic medium, the material properties at a given spatial location are known only statistically. The most common approach to solving particle transport problems involving binary stochastic media (BSM) is to use the atomic mix approximation in which the transport problem is solved using homogenized (volume-averaged) material properties. A common deterministic model developed for solving BSM particle transport problems is the Levermore-Pomraning (LP) model. Zimmerman and Adams proposed a Monte Carlo algorithm (Algorithm A) that solves the LP equations and another Monte Carlo algorithm (Algorithm B) that locally preserves the sampled material realization; we refer to these Monte Carlo algorithms as the LP and LPLRP (LP local realization preserving) algorithms, respectively. One-dimensional (1D) planar geometry benchmark studies have shown that the LPLRP algorithm is often significantly more accurate than the LP algorithm for problems with an incident angular flux as well as for problems with an interior source. The LPLRP algorithm implementation in these benchmark comparisons made explicit use of the one-dimensional nature of the problem. The LP model is derived by assuming an 'upwind' closure in the coupling term relating the two materials in a binary stochastic medium. Su and Pomraning developed a modified form of this closure by considering the small correlation length limit and requiring the modified closure to produce the correct exponential decay for a source-free half-line albedo problem in rod geometry. They concluded that the modified closure is generally not inferior to the LP closure and in some cases is significantly better. Brantley investigated the use of the Su-Pomraning (SP) closure in the Monte Carlo LP algorithm (LP-SP) for the suite of benchmark problems and concluded that 1) the LP-SP algorithm was somewhat more accurate overall than the LP algorithm and somewhat less accurate overall than the LPLRP algorithm for an incident angular flux benchmark suite, and 2) the LP-SP algorithm was generally the least accurate of the algorithms for an interior source benchmark suite. Larsen et al. performed an asymptotic analysis of the transport equation in 1D planar geometry for the situation in which the physical system is 1) a random binary stochastic medium with material macroscopic total cross sections and mean slab width values of O(1) or smaller and 2) optically thick with weak absorption and sources at each spatial point and therefore globally diffusive. The asymptotic analysis demonstrates that, under these assumptions, the transport equation limits to the conventional diffusion equation with atomically-mixed (volume-averaged) material properties. Larsen et al. also demonstrate that, under these same assumptions, the LP equations asymptotically limit to an atomically-mixed diffusion equation with a diffusion coefficient that is too large, leading to an unphysical flattening of the ensemble-averaged scalar flux distribution. Vasques and Yadav recently performed an asymptotic analysis of an adjusted Levermore-Pomraning closure in which the Markovian transition functions are rescaled such that the equations asymptotically limit to the correct atomically-mixed diffusion equation; we refer to this model as LP-VY. In this paper, we demonstrate that the adjusted LP closure proposed by Vasques and Yadav is a special case of the SP closure obtained by assuming that the absorption cross sections in the two materials are equal. We further demonstrate that the Su-Pomraning closure has the correct asymptotic limit for the diffusive physical system and is therefore an appropriate closure for these problems. We also describe how to incorporate these various closures into the Monte Carlo LP and LPLRP particle transport algorithms, and we present numerical results comparing the accuracy of the Monte Carlo LP, LP-VY, LP-SP, LPLRP, and LPLRP-SP algorithms for the set of diffusive benchmark problems. We demonstrated that the SP closure has the correct asymptotic limit for the diffusive physical system under investigation in this paper and that the VY closure is a special case of the SP closure obtained by assuming equal absorption in the two materials. Both of these closures are readily implemented in the Monte Carlo LP and LPLRP algorithms for particle transport in BSM. Through numerical comparisons to a diffusive benchmark suite, we confirmed that 1) the LP and LPLRP algorithms do not limit to the appropriate diffusion solution and 2) the LP-VY, LP-SP, and LPLRP-SP algorithms limit to the appropriate diffusion solution and are of comparable accuracy. The LPLRP algorithm has been shown to be generally more accurate than the LP algorithm for non-diffusive problems. However, the numerical results in this paper indicate that the LPLRP algorithm does not limit to the correct diffusion equation for the asymptotic limit under consideration. The work in this paper demonstrates that the SP algorithm does limit to the correct diffusion equation for the asymptotic limit considered. Future work will investigate the possibility of whether the LPLRP-SP algorithm is accurate for both diffusive and non-diffusive problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optimizing Approximate Weighted Matching on Nvidia Kepler K40

Matching is a fundamental graph problem with numerous applications in science and engineering. While algorithms for computing optimal matchings are difficult to parallelize, approximation algorithms on the other hand generally compute high quality solutions and are amenable to parallelization. In this paper, we present efficient implementations of the current best algorithm for half-approximate weighted matching, the Suitor algorithm, on Nvidia Kepler K-40 platform. We develop four variants of the algorithm that exploit hardware features to address key challenges for a GPU implementation. We also experiment with different combinations of work assigned to a warp. Using an exhaustive set of $269$ inputs, we demonstrate that the new implementation outperforms the previous best GPU algorithm by $10$ to $100\times$ for over $100$ instances, and from $100$ to $1000\times$ for $15$ instances. We also demonstrate up to $20\times$ speedup relative to $2$ threads, and up to $5\times$ relative to $16$ threads on Intel Xeon platform with $16$ cores for the same algorithm. The new algorithms and implementations provided in this paper will have a direct impact on several applications that repeatedly use matching as a key compute kernel. Further, algorithm designs and insights provided in this paper will benefit other researchers implementing graph algorithms on modern GPU architectures.

GPU↗

Extracting Topological Orders of Generalized Pauli Stabilizer Codes in Two Dimensions

In this paper, we introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems, focusing on the analysis of anyon excitations and string operators. The algorithm applies to Z d qudits, including instances where d is a nonprime number. This capability allows the identification of topological orders that differ from the Z d toric codes. It extends our understanding beyond the established theorem that Pauli stabilizer codes for Z p qudits (with p being a prime) are equivalent to finite copies of Z p toric codes and trivial stabilizers. The algorithm is designed to determine all anyons and their string operators, enabling the computation of their fusion rules, topological spins, and braiding statistics. The method converts the identification of topological orders into computational tasks, including Gaussian elimination, the Hermite normal form, and the Smith normal form of truncated Laurent polynomials. Furthermore, the algorithm provides a systematic approach for studying quantum error-correcting codes. We apply it to various codes, such as self-dual CSS quantum codes modified from the two-dimensional honeycomb color code and non-CSS quantum codes that contain the double semion topological order or the six-semion topological order. Published by the American Physical Society 2024

Physics↗

Dynamic Stochastic Superresolution of sparsely observed turbulent systems

Real-time capture of the relevant features of the unresolved turbulent dynamics of complex natural systems from sparse noisy observations and imperfect models is a notoriously difficult problem. The resulting lack of observational resolution and statistical accuracy in estimating the important turbulent processes, which intermittently send significant energy to the large-scale fluctuations, hinders efficient parameterization and real-time prediction using discretized PDE models. This issue is particularly subtle and important when dealing with turbulent geophysical systems with an vast range of interacting spatio-temporal scales and rough energy spectra near the mesh scale of numerical models. Here, we introduce and study a suite of general Dynamic Stochastic Superresolution (DSS) algorithms and show that, by appropriately filtering sparse regular observations with the help of cheap stochastic exactly solvable models, one can derive stochastically ‘superresolved’ velocity fields and gain insight into the important characteristics of the unresolved dynamics, including the detection of the so-called black swans. The DSS algorithms operate in Fourier domain and exploit the fact that the coarse observation network aliases high-wavenumber information into the resolved waveband. It is shown that these cheap algorithms are robust and have significant skill on a test bed of turbulent solutions from realistic nonlinear turbulent spatially extended systems in the presence of a significant model error. In particular, the DSS algorithms are capable of successfully capturing time-localized extreme events in the unresolved modes, and they provide good and robust skill for recovery of the unresolved processes in terms of pattern correlation. Moreover, we show that DSS improves the skill for recovering the primary modes associated with the sparse observation mesh which is equally important in applications. The skill of the various DSS algorithms depends on the energy spectrum of the turbulent signal and the observation time relative to the decorrelation time of the turbulence at a given spatial scale in a fashion elucidated here. The DSS technique exploiting a simple Gaussian closure of the nonlinear stochastic forecast model emerges as the most suitable trade-off between the superresolution skill and computational complexity associated with estimating the cross-correlations between the aliasing modes of the sparsely observed turbulent signal. Such techniques offer a promising and efficient approach to constraining unresolved turbulent fluxes through stochastic superparameterization and a subsequent improvement in coarse-grained filtering and prediction of the next generation atmosphere–ocean system (AOS) models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High-Order Curvilinear Finite Element Methods for Lagrangian Hydrodynamics [High Order Curvilinear Finite Elements for Lagrangian Hydrodynamics]

The numerical approximation of the Euler equations of gas dynamics in a movingLagrangian frame is at the heart of many multiphysics simulation algorithms. Here, we present a general framework for high-order Lagrangian discretization of these compressible shock hydrodynamics equations using curvilinear finite elements. This method is an extension of the approach outlined in [Dobrev et al., Internat. J. Numer. Methods Fluids, 65 (2010), pp. 1295--1310] and can be formulated for any finite dimensional approximation of the kinematic and thermodynamic fields, including generic finite elements on two- and three-dimensional meshes with triangular, quadrilateral, tetrahedral, or hexahedral zones. We discretize the kinematic variables of position and velocity using a continuous high-order basis function expansion of arbitrary polynomial degree which is obtained via a corresponding high-order parametric mapping from a standard reference element. This enables the use of curvilinear zone geometry, higher-order approximations for fields within a zone, and a pointwise definition of mass conservation which we refer to as strong mass conservation. Moreover, we discretize the internal energy using a piecewise discontinuous high-order basis function expansion which is also of arbitrary polynomial degree. This facilitates multimaterial hydrodynamics by treating material properties, such as equations of state and constitutive models, as piecewise discontinuous functions which vary within a zone. To satisfy the Rankine--Hugoniot jump conditions at a shock boundary and generate the appropriate entropy, we introduce a general tensor artificial viscosity which takes advantage of the high-order kinematic and thermodynamic information available in each zone. Finally, we apply a generic high-order time discretization process to the semidiscrete equations to develop the fully discrete numerical algorithm. Our method can be viewed as the high-order generalization of the so-called staggered-grid hydrodynamics (SGH) approach and we show that under specific low-order assumptions, we exactly recover the classical SGH method. We also present numerical results from an extensive series of verification tests that demonstrate several important practical advantages of using high-order finite elements in this context.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Highly stable evolution of Earth's future orbit despite chaotic behavior of the solar system

Due to the chaotic nature of the solar system, the question of its dynamic long-term stability can only be answered in a statistical sense, for instance, based on numerical ensemble integrations of nearby orbits. Destabilization of the inner planets, including catastrophic encounters and/or collisions involving the Earth, has been suggested to be initiated through a large increase in Mercury’s eccentricity (e{sub M}), with an estimated probability of ∼1%. However, it has recently been shown that the statistics of numerical solar system integrations are sensitive to the accuracy and type of numerical algorithm. Here, I report results from computationally demanding ensemble integrations (N = 1600 with slightly different initial conditions) at unprecedented accuracy based on the full equations of motion of the eight planets and Pluto over 5 Gyr, including contributions from general relativity. The standard symplectic algorithm used for long-term integrations produced spurious results for highly eccentric orbits and during close encounters, which were hence integrated with a suitable Bulirsch–Stoer algorithm, specifically designed for these situations. The present study yields odds for a large increase in Mercury’s eccentricity that are less than previous estimates. Strikingly, in two solutions, Mercury continued on highly eccentric orbits (after reaching e{sub M} values >0.93) for 80–100 Myr before colliding with Venus or the Sun. Most importantly, none of the 1600 solutions led to a close encounter involving the Earth or a destabilization of Earth’s orbit in the future. I conclude that Earth’s orbit will be dynamically highly stable for billions of years in the future, despite the chaotic behavior of the solar system.

79 ASTRONOMY AND ASTROPHYSICS↗

Exactly unitary discrete representations of the metaplectic transform for linear-time algorithms

The metaplectic transform (MT), a generalization of the Fourier transform sometimes called the linear canonical transform, is a tool used ubiquitously in modern optics, for example, when calculating the transformations of light beams in paraxial optical systems. The MT is also an essential ingredient of the geometrical-optics modeling of caustics that we recently proposed. In particular, this application relies on the near-identity MT (NIMT); however, the NIMT approximation used so far is not exactly unitary and leads to numerical instability. Here, we develop a discrete MT that is exactly unitary, and approximate it to obtain a discrete NIMT that is also unitary and can be computed in linear time. We prove that the discrete NIMT converges to the discrete MT when iterated, thereby allowing the NIMT to compute MTs that are not necessarily near-identity. Finally, we then demonstrate the new algorithms with a series of examples.

47 OTHER INSTRUMENTATION↗

Block Lanczos algorithm for lattice QCD spectroscopy and matrix elements

Recent work introduced a new framework for analyzing correlation functions with improved convergence and signal-to-noise properties, as well as rigorous quantification of excited-state effects, based on the Lanczos algorithm and spurious eigenvalue filtering with the Cullum-Willoughby test. Here, we extend this framework to the analysis of correlation-function matrices built from multiple interpolating operators in lattice quantum chromodynamics (QCD) by constructing an oblique generalization of the block Lanczos algorithm, as well as a new physically motivated reformulation of the Cullum-Willoughby test that generalizes to block Lanczos straightforwardly. The resulting block Lanczos method directly extends generalized eigenvalue problem (GEVP) methods, which can be viewed as applying a single iteration of block Lanczos. Block Lanczos provides qualitative and quantitative advantages over GEVP methods analogous to the benefits of Lanczos over the standard effective mass, including faster convergence to ground- and excited-state energies, explicitly computable two-sided error bounds, straightforward extraction of matrix elements of external currents, and asymptotically constant signal-to-noise. No fits or statistical inference are required. Proof-of-principle calculations are performed for noiseless mock-data examples as well as two-by-two proton correlation-function matrices in lattice QCD.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

ROVER

ROVER Is an application for distributed-memory volume rendering and simulated radiography focused on many-core architectures (e.g., GPU, CPU, and MIC). Volume rendering, also known as volume visualization, is a commonly used scientific visualization algorithm that enables users to visualize an entire scalar field at once by mapping scalar values to colors and transparency. Simulated radiography Is a generalization of the volume rendering algorithm from four color channels (I.e., red, green, blue, and transparency) to an arbitrary number of channels representing material opacities in discrete energy groups, measured In electron volts.

Larsen, Matthew↗

ShupeTurner cloud microphysics

This product is the ShupeTurner cloud microphysics product derived for the Multidisciplinary drifting Observatory for the Study of Arctic Climate (MOSAiC) expedition in the central Arctic. The product includes time-height derivations of the cloud type (phase type) and the condensed water content and characteristic effective particle size for liquid and ice hydrometeor populations. Additionally, it includes the vertical integral of the condensed water content for liquid and ice, i.e., the liquid water path and ice water path. These are derived using a combination of sensors, including: cloud radar, depolarization lidar, microwave radiometer, ceilometer, and radiosondes. During MOSAiC, these sensors were installed and operated onboard the Polarstern icebreaker while within the Arctic sea ice. Most data were obtained while Polarstern was moored to the MOSAiC sea ice floe, passively drifting through the Arctic. However, the data from 16 May 2020 - 17 June 2020 and 31 July 2020 - 21 August 2020 were obtained while Polarstern was underway transiting through the sea ice during relocations of the expedition. General details of the retrieval algorithm, its application, and uncertainties are provided in Shupe et al. (2015), with the cloud classification being described in more detail in Shupe (2007). General details about the MOSAiC expedition including instruments, locations, and meteorological context is provided in Shupe et al. (2022).

54 ENVIRONMENTAL SCIENCES↗

Phase retrieval for refraction-enhanced x-ray radiography using a deep neural network

X-ray refraction-enhanced radiography (RER) or phase contrast imaging is widely used to study internal discontinuities within materials. The resulting radiograph captures both the decrease in intensity caused by material absorption along the x-ray path, as well as the phase shift, which is highly sensitive to gradients in density. A significant challenge lies in effectively analyzing the radiographs to decouple the intensity and phase information and accurately ascertain the density profile. Conventional algorithms often yield ambiguous and unrealistic results due to difficulties in including physical constraints and other relevant information. We have developed an algorithm that uses a deep neural network to address these issues and applied it to extract the detailed density profile from an experimental RER. To generalize the applicability of our algorithm, we have developed a technique that quantitatively evaluates the complexity of the phase retrieval process based on the characteristics of the sample and the configuration of the experiment. Accordingly, this evaluation aids in the selection of the neural network architecture for each specific case. Beyond RER, the model has potential applications for other diagnostics where phase retrieval analysis is required.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Automated Symbolic Upscaling: 2. Model Generation for Extended Applicability Regimes

Abstract In this second part of the two paper series, we detail an algorithmic procedure for systematically implementing the generalized closure form strategy presented in Part 1. This strategy extends the applicability of homogenized models with respect to classical homogenization theory, as demonstrated in Part 1 where upscaled models are rigorously derived in moderately reactive physical regimes. After encoding the algorithm into Symbolica, an automated upscaling framework, we upscale two reactive mass transport problems and numerically validate the resulting nonlinear homogenized models by showing the absolute error estimates predicted by homogenization theory are satisfied. In both problems, nontrivial closure forms and closure problems are automatically formulated using the encoded strategy with no human interaction, nor prior knowledge regarding the closure required for the systems. We hope these demonstrations spark further interest in automated analytical frameworks for multiscale modeling, as such capabilities are invaluable for generating rigorous multiscale models of complex phenomena in porous media.

Pietrzyk, Kyle↗

Library for Evolutionary Algorithms in Python (LEAP)

There are generally three types of scientific software users: users that solve problems using existing science software tools, researchers that explore new approaches by extending existing code, and educators that teach students scientific concepts. Python is a general-purpose programming language that is accessible to beginners, such as students, but also as a language that has a rich scientific programming ecosystem that facilitates writing research software. Additionally, as high-performance computing (HPC) resources become more readily available, software support for parallel processing becomes more relevant to scientific software.There currently are no Python-based evolutionary computation frameworks that support all three types of scientific software users. Moreover, some support synchronous concurrent fitness evaluation that do not efficiently use HPC resources. We pose here a new Python-based EC framework that uses an established generalized unified approach to EA concepts to provide an easy to use toolkit for users wishing to use an EA to solve a problem, for researchers to implement novel approaches, and for providing a low-bar to entry to EA concepts for students. Additionally, this toolkit provides a scalable asynchronous fitness evaluation implementation friendly to HPC that has been vetted on hardware ranging from laptops to the world’s fastest supercomputer, Summit.

Coletti, Mark↗

Simulating the dynamical friction force on ions due to a briefly co-propagating electron beam

We present two algorithms for accurate beam-frame simulations of the dynamical friction force on a non-relativistic ion moving for a short time in a low-density electron distribution, in the presence of arbitrary external fields. A special-purpose 4th-order predictor-corrector ('Hermite') algorithm, taken from the astrophysical dynamics community, has been generalized to work with charged particles in the presence of a constant magnetic field. An alternative algorithm uses operator splitting techniques to solve binary Coulomb collisions (BCC) in the presence of arbitrary external fields. We discuss the close mathematical relationship between the Hermite and BCC algorithms, and their order of convergence. We discuss the parallel efficiency of the BCC algorithm and use it in the parallel simulation framework VORPAL to study problems in a parameter regime relevant to the electron cooling section for the proposed luminosity upgrade of the Relativistic Heavy Ion Collider. In particular, we simulate the field-free case to show how finite time effects strongly modify the traditional Coulomb logarithm, resulting in a significant reduction of the dynamical friction force as calculated by standard theoretical formulas. We show that diffusive dynamics can be correctly simulated, but that it must be artificially suppressed in order to accurately obtain the friction force. We discuss the proposed use of a helical undulator magnet to focus the electron beam and inhibit electron-ion recombination, showing that this device reduces the friction force.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Insights into cosmological structure formation with machine learning.

Our modern understanding of cosmological structure formation posits that small matter density fluctuations present in the early Universe, as traced by the cosmic microwave background, grow via gravitational instability to form extended haloes of dark matter. A theoretical understanding of the structure, evolution and formation of dark matter haloes is an essential step towards unravelling the intricate connection between halo and galaxy formation, needed to test our cosmological model against data from upcoming galaxy surveys. Physical understanding of the process of dark matter halo formation is made difficult by the highly non-linear nature of the haloes' evolution. I describe a new approach to gain physical insight into cosmological structure formation based on machine learning. This approach combines the ability of machine learning algorithms to learn non-linear relationships, with techniques that enable us to physically interpret the learnt mapping. I describe applicatio ns of th e method, with the aim of investigating which aspects of the early universe density field impact the later formation of dark matter haloes. First I present a case where the process of halo formation is turned into a binary classification problem; the algorithm predicts whether or not dark matter `particles' in the initial conditions of a simulation will collapse into haloes of a given mass range. Second, I present its generalization to regression, where the algorithm infers the final mass of the halo to which each particle will later belong. I show that the initial tidal shear does not play a significant role compared to the initial density field in establishing final halo masses. Finally, I demonstrate that extending the framework to deep learning algorithms such as convolutional neural networks allows us to explore connections between the early universe and late time haloes beyond those studied by existing analytic approximations of halo collapse.

79 ASTRONOMY AND ASTROPHYSICS↗

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗

Quantum abacus for counting and factorizing numbers

We generalize the binary quantum counting algorithm of Lesovik, Suslov, and Blatter [Phys. Rev. A 82, 012316 (2010)] to higher counting bases. The algorithm makes use of qubits, qutrits, and qudits to count numbers in a base-2, base-3, or base-d representation. In operating the algorithm, the number n<N=d{sup K} is read into a K-qudit register through its interaction with a stream of n particles passing in a nearby wire; this step corresponds to a quantum Fourier transformation from the Hilbert space of particles to the Hilbert space of qudit states. An inverse quantum Fourier transformation provides the number n in the base-d representation; the inverse transformation is fully quantum at the level of individual qudits, while a simpler semiclassical version can be used on the level of qudit registers. Combining registers of qubits, qutrits, and qudits, where d is a prime number, with a simpler single-shot measurement allows us to find the powers of 2, 3, and other primes d in the number n. We show that the counting task naturally leads to the shift operation and an algorithm based on the quantum Fourier transformation. We discuss possible implementations of the algorithm using quantum spin-d systems, d-well systems, and their emulation with spin-1/2 or double-well systems. We establish the analogy between our counting algorithm and the phase estimation algorithm and make use of the latter's performance analysis in stabilizing our scheme. Applications embrace a quantum metrological scheme to measure voltage (an analog to digital converter) and a simple procedure to entangle multiparticle states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Unifying parameter estimation and the Deutsch-Jozsa algorithm for continuous variables

We reveal a close relationship between quantum metrology and the Deutsch-Jozsa algorithm on continuous-variable quantum systems. We develop a general procedure, characterized by two parameters, that unifies parameter estimation and the Deutsch-Jozsa algorithm. Depending on which parameter we keep constant, the procedure implements either the parameter-estimation protocol or the Deutsch-Jozsa algorithm. The parameter-estimation part of the procedure attains the Heisenberg limit and is therefore optimal. Due to the use of approximate normalizable continuous-variable eigenstates, the Deutsch-Jozsa algorithm is probabilistic. The procedure estimates a value of an unknown parameter and solves the Deutsch-Jozsa problem without the use of any entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗