Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sampling 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 649 records · Page 36

Optimal Experimental Design With Fast Neural Network Surrogate Models

Designing optimal experiments minimizes the uncertainty of results and maximizes the efficient use of resources. Herein, machine learning surrogate models and the approximate coordinate exchange (ACE) algorithm are used to determine optimum experimental designs over large or arbitrarily restrictive design spaces. Optimal experimental design is particularly salient in materials science where experiments are expensive and material properties must often be inferred indirectly. The proposed framework is demonstrated by finding optimal experiments with which the hidden constituent properties of composite materials can be most efficiently inferred from observable experimental outcomes. The optimum experimental design is given by an information-theoretic criteria, which maximizes the conditional mutual information between the hidden properties and the expected experimental outcomes. To perform tractable optimization a neural network is trained as a surrogate model to mimic a physics based simulation, which can calculate the expected experimental outcome based on a candidate experimental design and sampled constituent properties. The ACE algorithm is used to optimize over large design spaces with many tests and controlled parameters where an exhaustive search would be intractable even with the surrogate model. Using this approach, optimal experimental designs that are consistent with those produced by heuristic knowledge and established best practices are found; then optimal designs in larger design spaces where heuristic knowledge is unavailable are examined.

machine learning↗

How Sample Completeness Affects Gamma-Ray Burst Classification

Unsupervised pattern recognition algorithms support the existence of three gamma-ray burst classes; class I (long, large fluence bursts of intermediate spectral hardness), Class II (short, small fluence, hard bursts), and class III (soft bursts of intermediate durations and fluences). The algorithms surprisingly assign larger membership to class III than to either of the other two classes. A known systematic bias has been previously used to explain the existence of class III in terms of class I; this bias allows the fluences and durations of some bursts to be underestimated. We show that this bias primarily affects only the longest bursts and cannot explain the bulk of the class III properties. We resolve the question of class III existence by demonstrating how samples obtained using standard trigger mechanisms fail to preserve the duration characteristics of small peak flux bursts: (Sample incompleteness is thus primarily responsible for the existence of class III.) In order to avoid this incompleteness, we show how a new dual timescale peak flux can be defined in terms of peak flux and fluence. The dual timescale peak flux reserves the duration distribution of faint bursts and correlates either with spectral hardness (and presumably redshift) than either peak flux or fluence. The techniques presented here are generic and have applicability to the studies of other transient events. The results also indicate that pattern recognition algorithms are sensitive to sample completeness; this can influence the study of large astronomical databases such as those found in a Virtual Observatory.

Hakkila, Jon↗

The WaZP galaxy cluster sample of the dark energy survey year 1

We present a new (2+1)D galaxy cluster finder based on photometric redshifts called Wavelet Z Photometric (WaZP) applied to DES first year (Y1A1) data. The results are compared to clusters detected by the South Pole Telescope (SPT) survey and the redMaPPer cluster finder, the latter based on the same photometric data. WaZP searches for clusters in wavelet-based density maps of galaxies selected in photometric redshift space without any assumption on the cluster galaxy populations. The comparison to other cluster samples was performed with a matching algorithm based on angular proximity and redshift difference of the clusters. It led to the development of a new approach to match two optical cluster samples, following an iterative approach to minimize incorrect associations. The WaZP cluster finder applied to DES Y1A1 galaxy survey (1511.13 deg^2 up to = 23 mag) led to the detection of 60 547 galaxy clusters with redshifts 0.05 < z < 0.9 and richness N_gals ≥ 5. Considering the overlapping regions and redshift ranges between the DES Y1A1 and SPT cluster surveys, all sz based SPT clusters are recovered by the WaZP sample. The comparison between WaZP and redMaPPer cluster samples showed an excellent overall agreement for clusters with richness N_gals (λ for redMaPPer) greater than 25 (20), with 95 per cent recovery on both directions. Based on the cluster cross-match, we explore the relative fragmentation of the two cluster samples and investigate the possible signatures of unmatched clusters.

79 ASTRONOMY AND ASTROPHYSICS↗

Bayesian seismic inversion based on rock-physics prior modeling for the joint estimation of acoustic impedance, porosity and lithofacies

We propose a Bayesian approach for seismic inversion to estimate acoustic impedance, porosity and lithofacies within the reservoir conditioned to post-stack seismic and well data. The link between elastic and petrophysical properties is given by a joint prior distribution for the logarithm of impedance and porosity, based on a rock-physics model. The well conditioning is performed through a background model obtained by well log interpolation. Two different approaches are presented: in the first approach, the prior is defined by a single Gaussian distribution, whereas in the second approach it is defined by a Gaussian mixture to represent the well data multimodal distribution and link the Gaussian components to different geological lithofacies. The forward model is based on a linearized convolutional model. For the single Gaussian case, we obtain an analytical expression for the posterior distribution, resulting in a fast algorithm to compute the solution of the inverse problem, i.e. the posterior distribution of acoustic impedance and porosity as well as the facies probability given the observed data. For the Gaussian mixture prior, it is not possible to obtain the distributions analytically, hence we propose a Gibbs algorithm to perform the posterior sampling and obtain several reservoir model realizations, allowing an uncertainty analysis of the estimated properties and lithofacies. Both methodologies are applied to a real seismic dataset with three wells to obtain 3D models of acoustic impedance, porosity and lithofacies. The methodologies are validated through a blind well test and compared to a standard Bayesian inversion approach. Using the probability of the reservoir lithofacies, we also compute a 3D isosurface probability model of the main oil reservoir in the studied field.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Redshift Survey of the Nearby Galaxy Cluster Abell 2199: Comparison of the Spatial and Kinematic Distributions of Galaxies with the Intracluster Medium

We present the results from an extensive spectroscopic survey of the central region of the nearby galaxy cluster Abell 2199 (A2199) at z = 0.03. By combining 775 new redshifts from the MMT/Hectospec observations with the data in the literature, we construct a large sample of 1624 galaxies with measured redshifts at R<30{sup ′}, which results in high spectroscopic completeness at r{sub petro,0}<20.5 (77%). We use these data to study the kinematics and clustering of galaxies, focusing on the comparison with those of the intracluster medium (ICM) from Suzaku X-ray observations. We identify 406 member galaxies of A2199 at R<30{sup ′} using the caustic technique. The velocity dispersion profile of cluster members appears smoothly connected to the stellar velocity dispersion profile of the cD galaxy. The luminosity function is well fitted with a Schechter function at M{sub r}<−15. The radial velocities of cluster galaxies generally agree well with those of the ICM, but there are some regions where the velocity difference between the two is about a few hundred kilometers per second. The cluster galaxies show a hint of global rotation at R<5{sup ′} with v{sub rot}=300--600 km s{sup −1}, but the ICM in the same region does not show such rotation. We apply a friends-of-friends algorithm to the cluster galaxy sample at R<60{sup ′} and identify 32 group candidates, and examine the spatial correlation between the galaxy groups and X-ray emission. This extensive survey in the central region of A2199 provides an important basis for future studies of interplay among the galaxies, the ICM, and the dark matter in the cluster.

79 ASTRONOMY AND ASTROPHYSICS↗

SU-E-CAMPUS-T-02: Exploring Radiation Acoustics CT Dosimeter Design Aspects for Proton Therapy

Purpose: Investigate the design aspects and imaging dose capabilities of the Radiation Acoustics Computed Tomography (RA CT) dosimeter for Proton induced acoustics, with the objective to characterize a pulsed pencil proton beam. The focus includes scanner geometry, transducer array, and transducer bandwidth on image quality. Methods: The geometry of the dosimeter is a cylindrical water phantom (length 40cm, radius 15cm) with 71 ultrasound transducers placed along the length and end of the cylinder to achieve a weighted set of projections with spherical sampling. A 3D filtered backprojection algorithm was used to reconstruct the dosimetric images and compared to MC dose distribution. First, 3D Monte Carlo (MC) Dose distributions for proton beam energies (range of 12cm, 16cm, 20cm, and 27cm) were used to simulate the acoustic pressure signal within this scanner for a pulsed proton beam of 1.8x107 protons, with a pulse width of 1 microsecond and a rise time of 0.1 microseconds. Dose comparison within the Bragg peak and distal edge were compared to MC analysis, where the integrated Gaussian was used to locate the 50% dose of the distal edge. To evaluate spatial fidelity, a set of point sources within the scanner field of view (15×15×15cm3) were simulated implementing a low-pass bandwidth response function (0 to 1MHz) equivalent to a multiple frequency transducer array, and the FWHM of the point-spread-function determined. Results: From the reconstructed images, RACT and MC range values are within 0.5mm, and the average variation of the dose within the Bragg peak are within 2%. The spatial resolution tracked with transducer bandwidth and projection angle sampling, and can be kept at 1.5mm. Conclusion: This design is ready for fabrication to start acquiring measurements. The 15 cm FOV is an optimum size for imaging dosimetry. Currently, simulations comparing transducer sensitivity, bandwidth, and proton beam parameters are being evaluated to assess signal-to-noise.

07 ISOTOPE AND RADIATION SOURCES↗

The importance of shear on the collective charge transport in CDWs revealed by an XFEL source

Charge transport in materials has an impact on a wide range of devices based on semiconductor, battery, or superconductor technology. Charge transport in sliding charge density waves (CDW) differs from all others in that the atomic lattice is directly involved in the transport process. To obtain an overall picture of the structural changes associated to the collective transport, the large coherent x-ray beam generated by an x-ray free-electron laser (XFEL) source was used. The CDW phase can be retrieved over the entire sample from diffracted intensities using a genetic algorithm. For currents below threshold, increasing shear deformation is observed in the central part of the sample while longitudinal deformation appears above threshold when shear relaxes. Shear thus precedes longitudinal deformation, with relaxation of one leading to the appearance of the other. Moreover, strain accumulates on surface steps in the sliding regime, demonstrating the strong pinning character of these surface discontinuities. The sliding process of nanometric CDW involves macroscopic sample dimensions.

36 MATERIALS SCIENCE↗

Demand Capacity Balancing at Vertiports for Initial Strategic Conflict Management of Urban Air Mobility Operations

Urban Air Mobility (UAM) is a new transportation concept that enables highly automated, cooperative, passenger or cargo-carrying air transportation services in and around urban areas. To achieve the high level of operational density and complexity desired by the UAM community, an airspace system that allows UAM operators to readily access and operate safely and efficiently in the airspace is needed. This airspace system will require air traffic management designed to reduce the risk of conflicts and loss of separation between UAM flights. In general, strategic conflict management is considered as the first layer of conflict management for safe flight operations to condition the traffic to reduce the need for airborne separation provision, the second layer of conflict management. Demand Capacity Balancing (DCB) is one of the concept components to achieve strategic conflict management. DCB strategically evaluates traffic demand and resource capacities to allow UAM operators to determine when, where and how they operate, while mitigating conflicting needs for airspace and vertiport capacity. DCB can be applied whenever UAM demand exceeds the capacity in airspace or at vertiports. As the UAM ecosystem evolves with advanced technologies and matured operational procedures, more complicated conflict management will likely be needed. In the current UAM ‘Concept of Operation (ConOps) 1.0’ operational stage defined by FAA, however, it will be meaningful to explore the demand capacity balancing at vertiports only, as an initial strategic conflict management approach for UAM operations because vertiport capacity seems to be a bottleneck of UAM traffic. For this research, we developed a demand-capacity imbalance detection and resolution service for UAM. This DCB service identifies the demand from operators and compares the demand to a given capacity at the shared resources (i.e., vertiports) over the upcoming time horizon which is divided into time bins having a constant interval. When a new flight plan is submitted, the algorithm embedded in the DCB service checks the available time bins based on the desired departure time and estimated arrival time at origin and destination vertiports, respectively. If the time bins for the originally desired times are already occupied by other flights (i.e., demand is at or above capacity), the algorithm finds the next available time bins for takeoff and landing and shifts the conflicting departure time to the earliest time that satisfies the capacity constraints at both origin and destination vertiports. The details of the algorithm will be described in the final manuscript. Figure 1 shows that the proposed DCB algorithm works well for a sample traffic scenario. In this example, a total of 144 flights, split between two operators, are planned over 2 hours, traveling 10 routes between five vertiports. In the heatmaps, the horizontal axis shows 12 time bins where each bin represents a 12-minute interval, and the vertical axis shows five vertiports. The number in each cell shows the number of operations, counting both departures and arrivals, at a specific vertiport in each time bin. For the given capacity of 2 operations/vertiport/bin, Figure 1 shows that the original demand sometimes exceeds the capacity, but the modified demand is reduced to the given capacity after resolving demand-capacity imbalances. When UAM flights are operated, it is expected that many practical issues would arise in the federated system architecture with multiple operators. UAM operators may experience a time synchronization issue due to communication delay between operator and vehicle. UAM vehicles would fly at different flight speeds, depending on vehicle models. Actual departure and arrival times can have large variations, compared to the schedule. The lead time from flight plan submission to desired departure time can vary by service type (e.g., regular shuttle service vs. on-demand service). Using the proposed DCB algorithm, we also investigated how the actual flight schedule and DCB performance are affected by these uncertainties such as unsynchronized times between operators, flight speed differences, lead time differences, and departure time errors. The final manuscript will include the background of this research work, the description of the DCB algorithm and its use cases with traffic scenarios. It will also provide the analytical results about the impact of various uncertainties that can occur in actual UAM operations on the DCB at vertiports, in terms of demand distribution changes, number of simultaneous operations, and delay propagation.

Urban Air Mobility↗

Predicting Adaptively Chosen Observables in Quantum Systems

Recent advances have demonstrated that 𝒪⁡(log 𝑀) measurements suffice to predict 𝑀 properties of arbitrarily large quantum many-body systems. However, these remarkable findings assume that the properties to be predicted are chosen independently of the data. This assumption can be violated in practice, where scientists adaptively select properties after looking at previous predictions. This work investigates the adaptive setting for three classes of observables: local, Pauli, and bounded-Frobenius-norm observables. We prove that Ω⁡(√𝑀) samples of an arbitrarily large unknown quantum state are necessary to predict expectation values of 𝑀 adaptively chosen local and Pauli observables, where the system size scales exponentially and polynomially in 𝑀, respectively. We also present computationally efficient algorithms that achieve this information-theoretic lower bound. In contrast, for bounded-Frobenius-norm observables, we devise an algorithm requiring only 𝒪⁡(log 𝑀) samples, independent of system size. These results highlight the potential pitfalls of adaptivity in analyzing data from quantum experiments and provide algorithmic tools to safeguard against erroneous predictions in quantum experiments.

Machine learning↗

Autoregressive Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation

The theory of open quantum systems lays the foundation for a substantial part of modern research in quantum science and engineering. Rooted in the dimensionality of their extended Hilbert spaces, the high computational complexity of simulating open quantum systems calls for the development of strategies to approximate their dynamics. In this Letter, we present an approach for tackling open quantum system dynamics. Using an exact probabilistic formulation of quantum physics based on positive operator-valued measure, we compactly represent quantum states with autoregressive neural networks; such networks bring significant algorithmic flexibility due to efficient exact sampling and tractable density. We further introduce the concept of string states to partially restore the symmetry of the autoregressive neural network and improve the description of local correlations. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator using a forward-backward trapezoid method and find the steady state via a variational formulation. Our approach is benchmarked on prototypical one-dimensional and two-dimensional systems, finding results which closely track the exact solution and achieve higher accuracy than alternative approaches based on using Markov chain Monte Carlo method to sample restricted Boltzmann machines. Our Letter provides general methods for understanding quantum dynamics in various contexts, as well as techniques for solving high-dimensional probabilistic differential equations in classical setups.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

S-OPT: A Points Selection Algorithm for Hyper-Reduction in Reduced Order Models

While projection-based reduced order models can reduce the dimension of full order solutions, the resulting reduced models may still contain terms that scale with the full order dimension. Hyper-reduction techniques are sampling-based methods that further reduce this computational complexity by approximating such terms with a much smaller dimension. The goal of this work is to introduce the points selection algorithm developed by Shin and Xiu as a hyper-reduction method. The selection algorithm was originally proposed as a stochastic collocation method for uncertainty quantification. Since the algorithm aims at maximizing a quantity $\mathcal{S}$ that measures both the column orthogonality and the determinant, we refer to the algorithm as S-OPT. Numerical examples are provided to demonstrate the performance of S-OPT and to compare its performance with a gappy proper orthogonal decomposition (POD) algorithm. Here, we found that using the S-OPT algorithm is shown to predict the full order solutions with higher accuracy than gappy POD especially when the number of sampling points is small, although we note that S-OPT shows slow asymptotic convergence with respect to the number of samples for some applications, e.g., Lagrangian hydrodynamics.

97 MATHEMATICS AND COMPUTING↗

A high speed implementation of the random decrement algorithm

The algorithm is useful for measuring net system damping levels in stochastic processes and for the development of equivalent linearized system response models. The algorithm works by summing together all subrecords which occur after predefined threshold level is crossed. The random decrement signature is normally developed by scanning stored data and adding subrecords together. The high speed implementation of the random decrement algorithm exploits the digital character of sampled data and uses fixed record lengths of 2(n) samples to greatly speed up the process. The contributions to the random decrement signature of each data point was calculated only once and in the same sequence as the data were taken. A hardware implementation of the algorithm using random logic is diagrammed and the process is shown to be limited only by the record size and the threshold crossing frequency of the sampled data. With a hardware cycle time of 200 ns and 1024 point signature, a threshold crossing frequency of 5000 Hertz can be processed and a stably averaged signature presented in real time.

Kiraly, L. J.↗

A high-speed implementation of the random decrement algorithm

The algorithm is useful for measuring net system damping levels in stochastic processes and for the development of equivalent linearized system response models. The algorithm works by summing together all subrecords which occur after predefined threshold level is crossed. The random decrement signature is normally developed by scanning stored data and adding subrecords together. The high speed implementation of the random decrement algorithm exploits the digital character of sampled data and uses fixed record lengths of 2(n) samples to greatly speed up the process. The contributions to the random decrement signature of each data point was calculated only once and in the same sequence as the data were taken. A hardware implementation of the algorithm using random logic is diagrammed and the process is shown to be limited only by the record size and the threshold crossing frequency of the sampled data. With a hardware cycle time of 200 ns and 1024 point signature, a threshold crossing frequency of 5000 Hertz can be processed and a stably averaged signature presented in real time.

Kiraly, L. J.↗

Semiclassical Monte-Carlo approach for modelling non-adiabatic dynamics in extended molecules

Modelling of non-adiabatic dynamics in extended molecular systems and solids is a next frontier of atomistic electronic structure theory. The underlying numerical algorithms should operate only with a few quantities (that can be efficiently obtained from quantum chemistry), provide a controlled approximation (which can be systematically improved) and capture important phenomena such as branching (multiple products), detailed balance and evolution of electronic coherences. Here we propose a new algorithm based on Monte-Carlo sampling of classical trajectories, which satisfies the above requirements and provides a general framework for existing surface hopping methods for non-adiabatic dynamics simulations. In particular, our algorithm can be viewed as a post-processing technique for analysing numerical results obtained from the conventional surface hopping approaches. Presented numerical tests for several model problems demonstrate efficiency and accuracy of the new method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Laser-induced breakdown spectroscopy in industrial and security applications

Laser-induced breakdown spectroscopy (LIBS) offers rapid, localized chemical analysis of solid or liquid materials with high spatial resolution in lateral and depth profiling, without the need for sample preparation. Principal component analysis and partial least squares algorithms were applied to identify a variety of complex organic and inorganic samples. This work illustrates how LIBS analyzers can answer a multitude of real-world needs for rapid analysis, such as determination of lead in paint and children's toys, analysis of electronic and solder materials, quality control of fiberglass panels, discrimination of coffee beans from different vendors, and identification of generic versus brand-name drugs. Lateral and depth profiling was performed on children's toys and paint layers. Traditional one-element calibration or multivariate chemometric procedures were applied for elemental quantification, from single laser shot determination of metal traces at {approx}10 {mu}g/g to determination of halogens at 90 {mu}g/g using 50-shot spectral accumulation. The effectiveness of LIBS for security applications was demonstrated in the field by testing the 50-m standoff LIBS rasterizing detector.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Neutron sub-micrometre tomography from scattering data

Neutrons are valuable probes for various material samples across many areas of research. Neutron imaging typically has a spatial resolution of larger than 20 µm, whereas neutron scattering is sensitive to smaller features but does not provide a real-space image of the sample. A computed-tomography technique is demonstrated that uses neutron-scattering data to generate an image of a periodic sample with a spatial resolution of ∼300 nm. The achieved resolution is over an order of magnitude smaller than the resolution of other forms of neutron tomography. This method consists of measuring neutron diffraction using a double-crystal diffractometer as a function of sample rotation and then using a phase-retrieval algorithm followed by tomographic reconstruction to generate a map of the sample's scattering-length density. Topological features found in the reconstructions are confirmed with scanning electron micrographs. This technique should be applicable to any sample that generates clear neutron-diffraction patterns, including nanofabricated samples, biological membranes and magnetic materials, such as skyrmion lattices.

nanoscience↗

SU-F-J-211: Scatter Correction for Clinical Cone-Beam CT System Using An Optimized Stationary Beam Blocker with a Single Scan

Purpose: X-ray scatter photons result in significant image quality degradation of cone-beam CT (CBCT). Measurement based algorithms using beam blocker directly acquire the scatter samples and achieve significant improvement on the quality of CBCT image. Within existing algorithms, single-scan and stationary beam blocker proposed previously is promising due to its simplicity and practicability. Although demonstrated effectively on tabletop system, the blocker fails to estimate the scatter distribution on clinical CBCT system mainly due to the gantry wobble. In addition, the uniform distributed blocker strips in our previous design results in primary data loss in the CBCT system and leads to the image artifacts due to data insufficiency. Methods: We investigate the motion behavior of the beam blocker in each projection and design an optimized non-uniform blocker strip distribution which accounts for the data insufficiency issue. An accurate scatter estimation is then achieved from the wobble modeling. Blocker wobble curve is estimated using threshold-based segmentation algorithms in each projection. In the blocker design optimization, the quality of final image is quantified using the number of the primary data loss voxels and the mesh adaptive direct search algorithm is applied to minimize the objective function. Scatter-corrected CT images are obtained using the optimized blocker. Results: The proposed method is evaluated using Catphan@504 phantom and a head patient. On the Catphan©504, our approach reduces the average CT number error from 115 Hounsfield unit (HU) to 11 HU in the selected regions of interest, and improves the image contrast by a factor of 1.45 in the high-contrast regions. On the head patient, the CT number error is reduced from 97 HU to 6 HU in the soft tissue region and image spatial non-uniformity is decreased from 27% to 5% after correction. Conclusion: The proposed optimized blocker design is practical and attractive for CBCT guided radiation therapy. This work is supported by grants from Guangdong Innovative Research Team Program of China (Grant No. 2011S013), National 863 Programs of China (Grant Nos. 2012AA02A604 and 2015AA043203), the National High-tech R&D Program for Young Scientists by the Ministry of Science and Technology of China (Grant No. 2015AA020917)

60 APPLIED LIFE SCIENCES↗

Quantifying the magic of quantum channels

Abstract To achieve universal quantum computation via general fault-tolerant schemes, stabilizer operations must be supplemented with other non-stabilizer quantum resources. Motivated by this necessity, we develop a resource theory for magic quantum channels to characterize and quantify the quantum ‘magic’ or non-stabilizerness of noisy quantum circuits. For qudit quantum computing with odd dimension d , it is known that quantum states with non-negative Wigner function can be efficiently simulated classically. First, inspired by this observation, we introduce a resource theory based on completely positive-Wigner-preserving quantum operations as free operations, and we show that they can be efficiently simulated via a classical algorithm. Second, we introduce two efficiently computable magic measures for quantum channels, called the mana and thauma of a quantum channel. As applications, we show that these measures not only provide fundamental limits on the distillable magic of quantum channels, but they also lead to lower bounds for the task of synthesizing non-Clifford gates. Third, we propose a classical algorithm for simulating noisy quantum circuits, whose sample complexity can be quantified by the mana of a quantum channel. We further show that this algorithm can outperform another approach for simulating noisy quantum circuits, based on channel robustness. Finally, we explore the threshold of non-stabilizerness for basic quantum circuits under depolarizing noise.

Wang, Xin (ORCID:0000000206413186)↗