Archive for the ‘Quantum Computer’ Category

Anta Lamas, physicist: In a few years, quantum computing will simply be another programming language – EL PAS USA

Anta Lamas Linares in Austin, Texas where Amazon Web Services has a technology complex.AWS

Anta Lamas Linares, 47, was born in Santiago de Compostela, in northwestern Spain. There she studied physics before going on to study at Oxford University and in California. Later she ended up in Singapore, leading the Amazon Web Services (AWS) Center for Quantum Networking.

In recent years she has dedicated herself to quantum computing, a field of study that is still in its infancy but promises to deliver unimaginable computational power (see box below).

Question. What is Amazon Web Services (AWS) doing in the race for quantum computing?

Answer. Since 2019, weve had a service called Amazon Braket. It allows anyone to submit a program and run it on a quantum computer in the cloud. Were also building a quantum computer at the Caltech (California Institute of Technology) campus. The latest initiative we have in the area of quantum information is the Boston-based center for quantum networks (the AWS Center for Quantum Networking).

Q. What network are you responsible for at AWS?

A. Were building the elements that allow quantum computers to be connected, kind of like a repeater to connect them over a long distance, or the quantum memories that are needed in the intermediate components. We develop the necessary hardware and software for when quantum computers will be up and running.

Q. Why is AWS entering this sector?

A. We believe theres a lot of potential in quantum technology. Amazon always thinks about whats going to be useful for its customers, even if its in the long-term. Computing, networking and other types of quantum technologies are expected to be very important in the future. Its basically an extension of the processors that do high performance computing, but in certain areas, its even more powerful. Quantum networks have immediate security implications and will eventually allow quantum computers to be connected to expand their capacity. Quantum networks will allow us to implement amazing capabilities

Q. Is a quantum internet possible?

A. Thats what were hoping for. It will be [possible] when all the capabilities of the quantum network are available. But there are several intermediate stages. The first [consists of] security and cryptography. Later, these networks will allow us to implement amazing capabilities, such as blind quantum computing, which basically [ensures that] no one can see what program youre running or see the results. In this way, if youre connected to the quantum computer with a quantum network, youre able to do the whole operation in a completely private way. But all this has many intermediate steps: we must have a quantum computer capable of doing these computations. At the moment, this doesnt exist. The [computers] that exist now are very basic; that is, they dont have many qubits and have a number of errors that dont allow several operations to be carried out in a row.

Q. What are the [quantum computers] available on AWS being used for?

A. There are several categories of users: a large part are academic researchers testing programs and comparing how they run on an ion-based quantum computer, or on a superconductor-based quantum computer. Then theres another group made up of researchers in the industry. For example, BMW uses [the computers] to optimize processes for a problem they could solve with supercomputers, but they reduce that problem to a simpler version and explore and learn.

Q. When will there be a robust and error-tolerant quantum computer?

A. We believe that, in 10 years, there will be quantum computers with interesting capabilities, but the possibility of error in that prediction is enormous. We may have a discovery tomorrow and speed it up by five years, or run into a roadblock that slows it down. In parallel, were developing the infrastructure to connect [the quantum computers] to each other and to the user. When we have that quantum network, all those capabilities that are now purely theoretical will be enabled.

Q. Will quantum computing ever be accessible without quantum knowledge?

A. Almost certainly, yes. If you think about how classical computing developed, early on, programmers had to understand circuitry. Now, in quantum computing, were still in that period the programmers are often physicists who know whats behind it. But in a few years, all of that will be just another programming language. Its still unknown what exactly the impact of quantum computing will be. Not all the possibilities are understood, nor is the effect of the intersection with artificial intelligence. In 1943, the president of IBM, Thomas J. Watson, said that he believed there was a market for five computers in the world. And now, as you can see, we all have a computer in our pocket. Companies like Amazon and others see the quantum potential, although we all recognize that this will be in the long-term.

Q. The technology world is suffering a wave of job cuts. Will this affect the development of quantum computing?

A. Investments in quantum technology are very long-term. Thats not to say that were immune to the general macroeconomic situation.

In conventional computing, a bit is the basic unit of information. A bit is binary in that it can only have one of two values: 0 or 1. Combinations of bits can provide computers with extraordinary capabilities, but in quantum computing, the basic unit is the quantum bit, or qubit. Its a quantum system that can have one of two states (0 and 1), or any superposition of these states. Superposition is the ability of a quantum system to be in multiple states at the same time until it is measured. The use of qubits allows trillions of bit combinations and therefore infinite computing possibilities. According to CSIC researcher Alberto Casas, A quantum computer of 273 qubits will have more memory than there are atoms in the observable universe.

Sign up for our weekly newsletter to get more English-language news coverage from EL PAS USA Edition

Link:
Anta Lamas, physicist: In a few years, quantum computing will simply be another programming language - EL PAS USA

EY and IBM expand strategic alliance into quantum computing – Investing News Network

The EY organization and IBM (NYSE: IBM) today announced that EY Global Services Limited will be joining the IBM Quantum Network, further enabling EY teams to explore solutions with IBM that could help resolve some of today's most complex business challenges. The EY organization will gain access to IBM's fleet of quantum computers over the cloud, and will become part of the IBM Quantum Network's community of organizations working to advance quantum computing.

Quantum computing is a rapidly emerging technology that harnesses the laws of quantum mechanics to solve problems that today's most powerful supercomputers cannot practically solve. EY teams will leverage their access to the world's largest fleet of quantum computers to explore solutions to enterprise challenges across finance, oil and gas, healthcare, and government.

The EY organization established its own Global Quantum Lab last year with a mission to harness quantum value in the domains of trust, transformation and sustainability. Using IBM quantum technology, EY teams plan to conduct leading-class practice research to uncover transformative use cases, including: the reduction of CO2 emissions from classical computing, the improvement of safety and accuracy of self-driving cars, and most critically, integrate quantum benefits into organizations' mainstream systems for data processing and enterprise decision making.

Andy Baldwin , EY Global Managing Partner Client Service, says:

"Quantum, in terms of importance to business, society and the EY organization, is akin to what AI represented years ago. This alliance puts the EY organization at the forefront of technology. As we invest in this level of quantum computing access, we accelerate our own position and depth of knowledge and capabilities in this space and deepen the rich relationship with our IBM alliance teams."

Jeff Wong , EY Global Chief Innovation Officer, says:

"As we navigate this period of technology-led change, which is accelerating at unprecedented speed, companies must have a full understanding of how to maximize breakthrough innovations in order to keep pace. Through this collaboration with IBM, the EY organization will now have the ability to take advantage of quantum computing to propel its innovation journey."

Jay Gambetta , Vice President IBM Quantum, says:

"IBM's vision is to deliver useful quantum computing to the world. We value partners like the EY organization that can introduce the emerging technology to a wide ecosystem of public and private industry. This will help EY facilitate the exploration of quantum computing's potential for use cases that matter in its industry."

Membership in the IBM Quantum Network is part of a broader effort by the EY organization to invest and develop robust capabilities in emerging technologies, which already include artificial intelligence, blockchain, and metaverse development. Beyond the increased investment of the EY-IBM Alliance, the EY organization is investing $10 billion in technology initiatives over three years, including investment in the organization's own quantum function.

More information on the EY-IBM Alliance, here .

About EY

EY exists to build a better working world, helping to create long-term value for clients, people and society and build trust in the capital markets.

Enabled by data and technology, diverse EY teams in over 150 countries provide trust through assurance and help clients grow, transform and operate.

Working across assurance, consulting, law, strategy, tax and transactions, EY teams ask better questions to find new answers for the complex issues facing our world today.

EY refers to the global organization, and may refer to one or more, of the member firms of Ernst & Young Global Limited, each of which is a separate legal entity. Ernst & Young Global Limited, a UK company limited by guarantee, does not provide services to clients. Information about how EY collects and uses personal data and a description of the rights individuals have under data protection legislation are available via ey.com/privacy. EY member firms do not practice law where prohibited by local laws. For more information about our organization, please visit ey.com.

This news release has been issued by EYGM Limited, a member of the global EY organization that also does not provide any services to clients.

About IBM

IBM is a leading global hybrid cloud and AI, and business services provider, helping clients in more than 175 countries capitalize on insights from their data, streamline business processes, reduce costs and gain the competitive edge in their industries. Nearly 3,800 government and corporate entities in critical infrastructure areas such as financial services, telecommunications and healthcare rely on IBM's hybrid cloud platform and Red Hat OpenShift to affect their digital transformations quickly, efficiently, and securely. IBM's breakthrough innovations in AI, quantum computing, industry-specific cloud solutions and business services deliver open and flexible options to our clients. All of this is backed by IBM's legendary commitment to trust, transparency, responsibility, inclusivity, and service. For more information, visit https://www.ibm.com/quantum

View original content to download multimedia: https://www.prnewswire.com/news-releases/ey-and-ibm-expand-strategic-alliance-into-quantum-computing-301797237.html

SOURCE EY

Go here to read the rest:
EY and IBM expand strategic alliance into quantum computing - Investing News Network

7 emerging tech trends changing the cybersecurity landscape – SiliconRepublic.com

BearingPoints Shashank Awadhut examines some key tech trends through the lens of cybersecurity.

While cyberattacks themselves are becoming more sophisticated, the rapid growth of emerging technologies such as 5G, robotic process automation and, of course, generative AI, means there are even more opportunities for cyberattacks and data breaches to occur.

Shashank Awadhut is a senior technology consultant on the advisory team at BearingPoint Ireland with more than five years of experience in information security governance risk and compliance frameworks.

Evolvement of technology is directly proportional to the evolvement of security, he told SiliconRepublic.com.

Organisations need to be aware of a number of developing technologies when it comes to security.

With this in mind, Awadhut has outlined seven major emerging technologies that will affect the cybersecurity sector in both good and bad ways.

Artificial intelligence (AI) is the development of devices or computer programmes that are capable of carrying out operations that ordinarily require human intelligence, such as speech recognition, decision-making and language translation.

Machine learning (ML) is a subset of AI that focuses on developing algorithms and statistical models that enable computers to learn and improve from experience without being explicitly programmed. In other words, ML enables computers to automatically identify patterns and insights in data and use them to make predictions or decisions.

Advanced security solutions, such as anomaly detection and threat identification, are being created using AI and ML and can assist enterprises in identifying and preventing security threats in real time.

For example, ChatGPT, which is built on an AI and machine learning algorithm, can provide exact solutions to its user instantly. In a word, AI is the creation of machines that are capable of carrying out tasks that often call for human intelligence. Machine learning enables computers to learn from data and generate predictions without having to be explicitly programmed. There are various security threats related to ChatGPT such as malware, impersonation, phishing emails and data theft.

The Internet of Things (IoT) refers to the network of physical objects or things embedded with sensors, software and other technologies that enable them to connect and exchange data with other devices and systems over the internet.

IoT devices are proliferating in the workplace and can provide serious security issues. Businesses must be aware of the security threat posed by IoT devices and take precautions to protect them. IoT devices often collect and transmit sensitive data, such as personal information or financial data. If this data is not properly secured, it can be vulnerable to unauthorised access and theft.

For example, wearable devices such as smartwatches and fitness trackers are popular for tracking health and fitness. However, they may also contain sensitive information such as personal identification data and health records, which can be compromised if they are not secured properly.

Smart home security systems allow homeowners to monitor their homes using their mobile devices. However, if these devices are not secured properly, hackers can potentially access the live feed and steal private information, or worse, gain access to your home.

Blockchain is a distributed digital ledger technology that allows for secure, transparent and tamper-proof transactions without the need for intermediaries, such as banks or governments. The technology underpins cryptocurrencies such as bitcoin and Ethereum but has many other potential applications beyond just financial transactions.

Blockchain technology is being used to improve security in various industries, including finance and healthcare. It provides a secure and tamper-proof way of storing and transmitting data, making it difficult for attackers to manipulate data. However, security issues such as hacking, fraud and theft of digital wallets remain a concern.

Quantum computing is a field of study focused on the development of computer technology based on the principles of quantum theory. It is different from classical computing, which relies on bits that can either be zero or one and instead uses quantum bits, or qubits, which can exist in both zero and one states at the same time due to the principles of superposition and entanglement.

Quantum computing has the potential to break encryption algorithms that are currently used to secure data. Organisations need to start preparing for the implications of quantum computing on their security infrastructure.

Quantum computing can perform certain types of calculations exponentially faster than classical computers, which can make encryption algorithms more secure by making it more difficult for hackers to decrypt encrypted data.

However, quantum computing can also pose a security risk by breaking existing encryption algorithms. For example, a quantum computer could theoretically crack the widely used RSA encryption algorithm, which is currently considered secure, in a matter of seconds. This could lead to the exposure of sensitive information, such as passwords, credit card numbers and other confidential data.

Metaverse is a term used to describe a hypothetical future iteration of the internet, in which virtual worlds and augmented reality are seamlessly integrated with physical reality.

It is essentially a shared, immersive virtual environment in which users can interact with each other and digital objects in a three-dimensional space. The security concerns in the metaverse are around protecting users personal information and privacy.

Since users will be interacting with each other in a shared virtual space, there will be a need for robust security protocols to prevent unauthorised access to personal information and to protect against identity theft and fraud.

Robotics and automation technologies enable machines to perform tasks traditionally done by humans, such as manufacturing and logistics. These technologies are expected to increase productivity, reduce costs and improve safety in various industries.

Robotic automation systems can be vulnerable to malware and hacking attacks, which can result in system failure or the compromise of sensitive data. Human error, such as improper configuration or operation of robotic automation systems, can lead to security vulnerabilities and system failures.

For example, a company can use robotic process automation (RPA) to automate its customer service chatbot. The chatbot is programmed to answer customer queries, process orders and provide product recommendations. The system collects customer data and uses it to improve the accuracy and efficiency of the chatbot.

However, the RPA system used by the company may not be secure enough to protect customer data. If the RPA system is not designed to handle sensitive information, hackers can potentially access and steal customer data, including personal information, credit card numbers and transaction records.

5G is the next generation of wireless technology that promises faster speeds, lower latency and greater reliability. It is expected to enable new applications and services such as autonomous vehicles, smart cities and virtual reality.

5G networks will increase the number of connected devices and the amount of data transmitted, making them more vulnerable to cyberattacks. Attackers can exploit vulnerabilities in 5G networks to steal data, launch distributed denial-of-service (DDoS) attacks and cause network downtime.

5G networks rely on a complex supply chain that involves many vendors and suppliers. This increases the risk of compromised hardware or software being introduced into the network.

By Shashank Awadhut

Shashank Awadhut is a senior technology consultant on the advisory team at BearingPoint Ireland.

10 things you need to know direct to your inbox every weekday. Sign up for theDaily Brief, Silicon Republics digest of essential sci-tech news.

See the original post here:
7 emerging tech trends changing the cybersecurity landscape - SiliconRepublic.com

Quantum annealing for microstructure equilibration with long-range … – Nature.com

One-dimensional model

For a simplified 1D model we consider only a martensitic phase which is assumed to exist in two different variants. Hence the microstructure consists of a line of grains of these variants, as depicted in the inset of Fig.1a. To be explicit, we assume that both variants have a stress free strain (eigenstrain), which leads to a shear deformation relative to the austenitic mother phase, and denote these variants by state variables (s_i=pm 1). As in the end we will map the description to a one-dimensional Ising model, we also use here the terminology of spins with two possible alignments in the spirit of a magnetic model. As each of the variants leads to a shearing of the cell, we get an overall stress free deformation of this line (compared to the shear strain free austenite), depending on the spin configuration. We assume that all grains have the same height (d), the same elastic constants, and opposite shear eigenstrain (pm varepsilon _0). As one can readily see from the inset of Fig.1a, the stress free equilibrium position of the top grain (x_0) depends only on the number of variants (N_+) with orientation (s_i=+1) and (N_-) with (s_i=-1), but not on the individual arrangement, which is a particularity of the simplified 1D model and the chosen eigenstrain. Hence, for a fixed number (N=N_++N_-) spins in a row, the macroscopic stress free strain is (bar{varepsilon } = (N_+ - N_-)varepsilon _0/N), which leads to (x_0 = N d bar{varepsilon }). If an external deformation is enforced, i.e.(xne x_0) the elastic energy is (F_{el}=mu _text{eff} (x-x_0)^2) with an effective shear modulus (mu _text{eff}). Obviously, the elastic energy is minimized if the spin configuration is such that (x=x_0), which implies ((N_+-N_-)_text{min} = x/varepsilon _0 d), up to the point of saturation, where all spins are aligned. This expression serves as reference for the comparison with the numerical minimization approaches below. We note that we neglected at this stage the discrete nature of the variants, which means that the integer value (N_+-N_-) should be as close as possible to the continuum value ((N_+-N_-)_text{min}) above. Although the energy in the simple 1D model does not depend on the arrangement of the variants but only on the total numbers (N_+) and (N_-=N-N_+), we formulate the model here on the level of the individual spins (s_i) for the later extension towards higher dimensions and the use of the quantum annealer. Hence we get (N_+ - N_- = sum _i s_i). Inserting this into the elastic energy expression yields (F_text{el} = mu _text{eff} varepsilon _0^2d ^2 sum _{i,j} s_i s_j - 2mu _text{eff} x varepsilon _0 d sum _i s_i +mu _text{eff} x^2), where the summations run over all spins. For the implementation on a quantum annealer, we need to bring this to the Ising form of a Hamiltonian H with

$$begin{aligned} H =sum _ih_is_i + sum _{i

(1)

where the first term corresponds to the interaction with an external magnetic field (h_i) and the second term to a spin-spin interaction, which favors ferromagnetic (antiferromagnetic) ordering in case that the coupling constant (J_{ij}) is negative (positive). The last, spin-independent term (H_0) is only an irrelevant additive constant. From the comparison of the two above expressions we identify (h_i = - 2mu _text{eff} x varepsilon _0 d) and (J_{ij} = 2 mu _text{eff} varepsilon _0^2 d ^2). First, we note that the external deformation is here analogous to the magnetic field in the Ising description. Second, the spin-spin interaction term (J_{ij}) is positive, hence favoring antiferromagnetic ordering. Also, this term is independent of the spin numbers i,j, which means that this interaction does not depend on the distance between the grains. In other words, the elastic interaction depends only on the averaged magnetization (N_+-N_-), which implies a mean field interaction.

The goal of the formulation is to minimize the elastic energy and to find the optimal spin or variant configuration ({s_i}). To this end, we use three different numerical approaches (see methods section), and the results are compared to the analytical solution above: First, a brute force approach iterates over all spin configurations to find the energetic minimum exactly, second we use simulated annealing as probabilistic ground state finder, and finally the quantum annealing approach. Fig.1a shows the resulting magnetization ((N_+-N_-)/N), i.e.the average variant orientation, as function of applied displacement (x/d Nvarepsilon _0), which corresponds to the magnetic field in the Ising model.

Results of the one-dimensional model comparing different numerical and analytical methods. (a) Mean variant orientation ((N_+-N_-) / N) as function of the displacement (x / d N varepsilon _0). Comparison between the results obtained by numerical minimization (solid lines) versus the analytical theory for an infinite and continuous system (dashed line). For large displacement, all spins are aligned and therefore the magnetization saturates. The inset shows a sketch of the one-dimensional arrangement of martensite variants (s_i=+1) (red) and (s_i=-1) (green). The bottom row is fixed to position (x=0), whereas the top grain has a mean position (x_0) in the stress free state. If an additional external stress or strain is applied, the top layer is moved to position x, and the entire microstructure is sheared to the dashed configuration. (b) Elapsed computation time as a function of the number of grains. Different methods and algorithms are compared. Dashed parts of the QA curve belong to the regime of chain breaks. For large system sizes, only the hybrid quantum annealing approach remains feasible, showing an almost constant computing time need for less than 1000 spin variables (inset).

As expected, the results agree with the analytical theory up to the aforementioned discretization effect, which becomes less pronounced for large grain numbers. For high displacements saturation sets in when all variants are de-twinned, which means that all spins are either in the state (+1) or (-1). We note that for the investigated number of spins all used algorithms lead to the same energy minimum, which confirms that also the probabilistic approaches indeed find the global minimum states.

Fig.1b shows the required computation time for the different methods and algorithms as a function of the number of grains N. All conventional algorithm implementations are based on single core computations without parallelization and are mainly shown for a qualitative comparison, as the focus of the investigations is on the quantum annealing approach. For the latter, we use quantum processing unit (QPU) implementations up to the highest possible number of spins (typically (Napprox 170) for the Pegasus architecture34 of a D-Wave machine). The brute force approach, where iterations over all spin configurations are run, has the highest computation time. Even at small spin systems of around (Napprox 40) the elapsed user time was too large for practical applications due to the simulation time scaling (sim {{mathcal {O}}}(2^N)). The pure quantum annealing method produces the fastest results and ends up with an almost constant elapsed QPU access time. Overall, the computations for (Napprox 150) are roughly three orders of magnitude faster than for the other classical approaches. Beyond around (Napprox 50) spins, so called chain breaks35 occur occasionally. They result from the need to encode strongly coupled spins as a single logical spin. Ideally, these spins should represent the same state as the individual spins, but in practise this identity can be violated. To avoid this issue and to simulate even larger systems, which are essential for higher dimensional modeling in the following sections, hybrid classical and quantum annealing approaches can be used, which combine pure QA with conventional minimization approaches36. The numerical results in Fig.1b show an increase of the computation time of the hybrid solver compared to the pure QA, but the relative acceleration compared to the classical algorithms becomes even more striking. For the hybrid solver, the elapsed computation time is essentially independent of the number of spin variables and increases only beyond (10^3) grains to several seconds. Altogether, the hybrid QA is clearly the fastest approach for large grain numbers and is therefore used in the following two-dimensional simulations.

For the determination of the linear elastic energy beyond one dimension, we consider coherent precipitates of different variants which form inside the matrix. In this way, the entire material can be considered to consist of small entities (in the following denoted as grains), which can be in one of the different martensitic states. The simplest possible (cartesian) discretization is to use small cuboidal grains with edge length a. All grains are assumed to be coherent (the elastic displacements and tractions are continuous at the interfaces between the grains), and we use homogeneous elasticity, i.e.we ignore differences in the elastic constants between the different phases or variants. This has the consequence that the elastic energy reduces to combinations of pairwise interactions between all grains37.

For demonstrational purposes we perform here two-dimensional simulations in a plane strain setup, but a transfer to three dimensions is straightforward. In particular, the annealer part does not depend on the dimensionality of the description. The qualitatively new aspect beyond 1D is the appearance of distance and orientation dependent spin-spin interactions, which decay only slowly with the distance between the grains, and therefore leads to fully populated matrices (J_{ij}). As it turns out that an accurate determination of the elastic interaction energy is essential for a precise prediction of the equilibrium microstructure, we use Fourier transformation approaches with periodic boundary conditions as outlined in the methods section. As boundary conditions, we use either vanishing average stress in the periodic volume V, (langle sigma _{ij} rangle = frac{1}{V} int sigma _{ij}(textbf{r}),dtextbf{r} = 0), or, similarly to the 1D description, a given average strain (langle varepsilon _{ij} rangle). We employ in the following for simplicity isotropic elasticity, which is e.g.described by the Lam coefficient (lambda) and the shear modulus (mu), i.e.the stress-strain relationship reads (sigma _{ij} = 2mu (varepsilon _{ij}-varepsilon _{ij}^{(0)}) + lambda delta _{ij} (varepsilon _{kk}-varepsilon _{kk}^{(0)})), where implicit summation over repeated indices is used. The position dependent eigenstrain (varepsilon _{ij}^{(0)}(textbf{r})) is known for a given microstructure with fixed phase dependent stress free strains (relative to the austenitic mother phase), (varepsilon _{ij}^{(0)}(textbf{r}) = theta (textbf{r}) varepsilon _{ij}^0), where the indicator function (theta) is zero in the austenite and either (+1) or (-1) in the two considered martensite variants. For a given microstructure, the elastic energy can then be computed in reciprocal space, as shown in the methods section. For the formulation as Ising model we discretize our microstructure using small non-overlapping cuboidal grains as discussed above and assign a spin (s_i) to each of them like before, such that the indicator field becomes a superposition (theta (textbf{r}) = sum _i s_i theta _i(textbf{r})), where (theta _i) equals one inside the corresponding square and is zero outside. Therefore, the elastic energy decomposes into pairwise interactions (for (ine j)) and self-energy terms (for (i=j))

$$begin{aligned} E_{i,j} = s_i s_j frac{1}{2V} int dtextbf{r} int dmathbf {r'} B(textbf{r}-mathbf {r'}) theta _i(textbf{r}) theta _j(mathbf {r'}), end{aligned}$$

(2)

where the integral kernel (B(textbf{r})) is defined through the inverse of the elastic Greens function. Hence, it is sufficient to perform the Fourier transform energy calculations for all pairs of the same martensite variant (s_i=s_j=1) on the discrete lattice sites in the volume V; for periodic boundary conditions and identical grain shapes, it is sufficient to calculate the elastic interaction energy between a reference grain and all the other grains, due to translation invariance. In case of fixed average strain boundary conditions, an additional homogeneous term appears (see methods section), contributing both to the spin-spin interaction (J_{ij}) as well as to the magnetic field term (h_i), which is absent for zero average stress boundary conditions. The resulting fully populated matrix of coupling constants with both positive and negative entries has similarities to spin glass systems with random couplings, which have been investigated in the literature with conventional approaches, see e.g.38.

For the simplest case that the eigenstrain is purely dilatational and isotropic the Bitter-Crum theorem applies and the total energy depends only on the volume fraction of the martensite variant, where no interaction between the grains is present and only a self energy term remains39.

For a nontrivial elastic interaction and the link to the previous 1D description, we consider a shear transformation strain with (varepsilon _{xy}^0=varepsilon _{yx}^0=varepsilon _0), where all other components vanish. In this case, we obtain a distance and orientation dependent interaction as depicted in Fig.2a, which is computed here for the case of vanishing average stress, (langle sigma _{ik}rangle =0). Here and in the following parts the Poisson ratio is chosen as (nu =1/4) (i.e.(lambda =mu)).

Interaction energies of two grains of equal variant type ((mathbf {s_i=s_j})). Interaction energies in the case of (a) shear eigenstrain and vanishing average stress and (b) tetragonal eigenstrain. The interaction energy per length is given in units of (lambda a^3 varepsilon _0^2), and the computations were done using a system size of (L_x/a=L_y/a=50), where a is the edge length of the grains. At distance (r/a=0) the grains touch each other. The symbols on the continuous curves indicate the information for the interaction at discrete lattice sites, which is actually used in the annealer simulations.

The interaction energy is obtained by subtracting the elastic self energies (E_text{self}) for each of the two (isolated) martensite grains inside the austenitic matrix from the total elastic energy (E_text{el}) of the two-grain arrangement, i.e.(E_text{int}=E_text{el}-2E_text{self}), to normalize the interaction energy such that it decays to zero for large grain separations. For short distances, a transition between attraction and repulsion is found for the (langle 100rangle) direction, whereas a purely repulsive interaction results for the diagonal (langle 110rangle) directions. Due to the periodic boundary conditions, the result depends on the system size (V=L_xtimes L_y), as the grains also interact with their periodic images, hence (rll L_x, L_y) is required to observe the decay of the interaction.

We note that in two dimensions the interaction energy decays asymptotically as (r^{-2}), whereas in three dimensions it scales as (r^{-3}) in large systems, which follows from the elastic Greens function40. For the quantum annealer implementation, the interaction energies are needed only for the discrete lattice points (symbols on the curves). Although the decay of the elastic interaction may suggest to cut it off beyond a certain distance in real space, it turns out that such an approach is inappropriate, as it leads in the end to invalid equilibrium microstructures, and it is therefore essential to keep all interaction terms (J_{ij}) with high precision to avoid spurious effects. We note that the formulation on the quantum annealer does not depend on the dimensionality, therefore the scaling plot in Fig.1b applies here as well.

Based on the calculation of the elastic interactions, we obtain from the Ising model implementation on the quantum annealer with hybrid solver stripe patterns in (langle 100rangle) direction as equilibrium structures. These patterns are irregular in the sense that the widths of the stripes are not uniform. This is in analogy to the 1D model, which was discussed above, where we found that the arrangement of the two variants is not determined. This coincidence, which is physically expected, is nontrivial from the model formulation, as (i) in the 1D model we had a distance independent interaction in the discretized model, where here the interaction is significantly more complex, but adds up to the same effective descriptions for the periodic arrangement; (ii) a rotation of the pattern by 90 degree is possible and sometimes obtained from the optimal configuration due to the discrete rotational symmetry; (iii) the fixing of the average stress compared to the given average strain in the 1D formulation can lead to unequal distributions of the different variants. In particular, for the presently considered absence of an external strain (implying a vanishing magnetic field in the Ising terminology), there is no constraint of the sort (langle s_irangle = 0) for the average spin alignment. All stripe configurations are energetically equivalent, which includes the possibility of a single variant configuration. These results therefore confirm simultaneously the accuracy of the elastic interaction calculation with the pairwise decomposition as well as the ability of the quantum annealer to identify the true ground state configurations.

As next example, we use a tetragonal eigenstrain with the only nonvanishing components (varepsilon _{xx}^0=-varepsilon _{yy}^0=varepsilon _{zz}^0=varepsilon _0). First, we consider again the situation with vanishing average stress, (langle sigma _{ij}rangle = 0). The corresponding interaction energy is shown in Fig.2b for (nu =1/4). In this case, the equilibrium microstructure is trivial and consists of a single variant, as in this case the elastic energy is zero for the periodic system. Therefore, the situation differs from the previous shear transformation, where also lamellar arrangements with both variants lead to stress free situations. The reason is that any interface between two variants leads to a mismatch between adjacent variants for the tetragonal transformation, and therefore such a situation is energetically unfavorable here. A change of boundary conditions to vanishing average strain, (langle varepsilon _{ij}rangle =0), alters the situation, since then arrangements with equal amounts of both variants are preferred, as this lowers the volumic part of the elastic energy. In this case, we find regular inclined stripes as equilibrium pattern, as shown in Fig.3a.

Resulting stripe patterns for tetragonal eigenstrain. (a) Equilibrium structure with three stripe pairs (counted along the horizontal axis) in a system consisting of (50times 50) cuboidal grains. A vanishing mean strain, (langle varepsilon _{ij}rangle =0), is imposed. The width of the stripes is uniform, consisting of grains with configuration (s_i=+1) (red) and (s_i=-1) (green). (b) Elastic energy of stripe patterns with different inclination angles (phi .) The solid curves correspond to smooth stripes (the grain size (a/L_x, a/L_yll 1) is negligible) and show a pronounced stationary point for inclinations for which the pattern repeats periodically without kinks at the boundaries. The squares correspond to situations with the same number of stripes, where the system is discretized by (50times 50) quadratic grains, leading to pronounced aliasing effects, and the resulting elastic energy is higher than for the smooth stripes. This shifts the energetic minimum for 6 stripe pairs at (phi approx 40^circ) to a lower angle (phi approx 33^circ) with 3 stripe pairs. The infinite system size limit for smooth stripes is depicted as black dotted curve.

Again, the solution is not unique; in particular, due to translation invariance, the annealer returns also configurations where the stripes are shifted. Also, a switch of the sign of the inclination angle (phi) (see definition in the figure) leads to energetically equivalent solutions. However, we do not find ground state configurations which lead to different (absolute) inclination angles or strip widths or even irregular variations of the latter, contrary to the shear transformation case before.

The reason for the observed ground state morphologies is a combination of continuum elasticity effects, the granular structure of the material and constraints induced by periodic boundary conditions. Figure3b shows the computed elastic energy for different numbers of regular arrangements of stripes in the periodic system as function of the inclination angle (phi). Here we see a pronounced influence of the grain size, as the elastic energy of configurations with regular stripe pairs with a discretization by (50times 50) grains (squares in the figure) is higher than for corresponding cases with very fine grains, where discretization effects do not play a role anymore (smooth curves). The oscillating nature is due to the periodic boundary conditions, as improper choices of the inclination angle lead to discontinuities of the stripe patterns at the boundaries, which is energetically unfavorable. Therefore, continuous patterns correspond to the stationary points of the curves. For specific angles, the curves for three and six stripe pairs meet at local minima, which is a consequence of the scale invariance of linear elasticity. From the smooth, continuum limit curves one would conclude that an angle of about (phi approx 40^circ) should lead to the energetically lowest configuration (absolute minimum of the smooth red curve). Moreover, in the limit of infinite systems, where periodic boundary conditions do not play a role anymore, an analytical treatment is possible, leading to the energy expression (E_text{el}^infty = V B(n)/2) for equal volume fraction of the two variants with

$$B(n) = frac{{4mu }}{{lambda + 2mu }}varepsilon _{0}^{2} {text{ }}left[ {(3lambda + 2mu ) - 2(3lambda + 2mu )n^{2} + 4(lambda + mu )n^{4} } right]$$

with (n=cos phi). Energy minimization gives the optimal angle (phi =cos ^{-1}sqrt{5/8}approx 37.8^circ), see Fig.3b (minimum of the black dotted curve).

However, these predictions disagree with the finding from the quantum annealer, which favors a configuration with three stripe pairs at a lower angle of (phi approx 33^circ). This observation can be understood by consideration of the granular structure of the patterns investigated here, as the microstructure in the annealer simulations consists of (50times 50) square grains. First, the explicit appearance of the length scale a breaks the scale invariance of the periodic pattern, and therefore the minima of the energy curves belonging to the discrete microstructures (squares in Fig.3b) do not coincide anymore at the local minima. Additionally, with increasing inclination antialiasing effects of the patterns become more relevant, and therefore the energy curves show an increasing disagreement with the continuum limit curves. As a result, the energetic minimum in the discrete microstructure indeed shifts toward a configuration with three stripe pairs at (phi approx 33^circ) (absolute minimum of the blue squares in Fig.3b), which is in agreement with the prediction of the quantum annealer. Consequently, details of the granular structure can change the energetics compared to a full continuum approximation, especially since many local minima of the elastic energy are located close to each other.

The approach presented above is not limited to mutually interacting cuboidal grains, but can also be applied to realistic microstructures. To illustrate the procedures, we have generated a microstructure consisting of (N=400) grains using a Voronoi tesselation41. Each grain is allowed to take one out of two martensite variants with the tetragonal eigenstrain tensor, and we pre-compute all mutual elastic interactions between them. We note that contrary to the case with the cuboidal grains in a periodic array here we cannot exploit translational invarince due to the different shapes of the grains, and hence these elastic interaction energy calculations scale here as ({{mathcal {O}}}(N^2)) instead of ({{mathcal {O}}}(N)) before, although we still use periodic boundary conditions. Additionally, we consider now arbitrary given external strains (langle varepsilon _{ij}rangle), which leads to the appearance of a magnetic term like in the one dimensional description. With that, we can predict the equilibrium variant distribution within the microstructure using the hybrid quantum annealer, and this step is typically executed within a few seconds of runtime.

Examples for the equilibrium microstructures are shown in Fig.4 as function of the externally applied strain (langle varepsilon _{xx}rangle), whereas the other average strain components vanish.

Resulting equilibrium variant distribution with uniform grain orientation. The microstructures consist of 400 grains and tensile strain is applied in horizontal (x) direction. Red (green) grains correspond to variant (s_i=+1) ((s_i=-1)). The tensile strain is (a) (langle varepsilon _{xx}rangle /varepsilon _0 = 0), (b) (langle varepsilon _{xx}rangle /varepsilon _0 = 0.1), (c) (langle varepsilon _{xx}rangle /varepsilon _0 = 0.5), (d) (langle varepsilon _{xx}rangle /varepsilon _0 = 0.9), (e) (langle varepsilon _{xx}rangle /varepsilon _0 = 1.1) and (f) (langle varepsilon _{xx}rangle /varepsilon _0 = 1.3).

The observed microstructures are indeed similar to what we have found before using the square discretization, although here the band widths and orientation deviate from the previous case due to microstructural details and the smaller number of grains, and these effects can be explained using an analysis similar to the one done for Fig.3b. We note that in these microstructures all grains have the same orientation, and therefore the application of a tensile strain strongly favors the selection of the grain variant (s_i=+1) (for a compressive situation we observe the opposite behavior), and we find a full alignment of all variants in the last snapshot.

Additionally, we have performed the same analysis for grains with uniformly distributed random orientation, which implies a rotation of the local transformation strain tensor, see Fig.5 for the grain orientations and for the variant selection.

Resulting equilibrium variant distribution with random grain orientation. (a) Grain orientation map corresponding to the microstructures. In the color bar the grain rotation angle is given in radian (modulo (pi) due to symmetry). The rotation axis is along the [001] direction. The microstructures consist of 400 grains and tensile strain is applied in horizontal (x) direction. The grains have a random orientation, which is the same for all cases, based on a uniform distribution. The tensile strain in horizontal direction is (b) (langle varepsilon _{xx}rangle /varepsilon _0 = 0) and (c) (langle varepsilon _{xx}rangle /varepsilon _0 = 2.1). Red (green) grains correspond to variant (s_i=+1) ((s_i=-1)).

Here, also the equilibrated spatial distribution of the variants appears to be irregular. Application of a tensile strain again favors the alignment of the variant, but this time even for high strains not all grains select the same variant, which is due to the local rotation. In fact, a grain, which is rotated by (90^circ) with respect to the straining direction has a preference to be in variant state (s_i=-1), as then the direction of expansion is aligned with the external tensile strain. This can be clearly seen e.g.in Fig.5(c) for the highest tensile strain in x direction, where the remaining patches with spin (s_i=-1) correspond to the grains with orientation close to (pi /2) (or (3pi /2)). We emphasize that for a given microstructure (shapes of all grains) the mutual elastic grain-grain interactions have to be computed only once. As mentioned before, this step has to be done with high precision, and consequently this is the step which demands the highest amount of computing time. After that, all changes of the external boundary conditions affect only the (k=0) mode contributing to the interactions (J_{ij}) and (h_i), and these terms can be calculated analytically (see methods section). As each hybrid quantum annealing calculation typically requires only a few seconds, the entire microstructural change during mechanical loading can be calculated extremely fast.

See original here:
Quantum annealing for microstructure equilibration with long-range ... - Nature.com

New IBM Study Reveals Inadequate Data Hinders Progress Against Environmental, Social and Governance Goals – Investing News Network

A new global IBM (NYSE: IBM) Institute for Business Value (IBV) study, " The ESG ultimatum: Profit or perish ," of executives and consumers reveals that while an increased focus on environmental sustainability remains a top priority for consumers and business executives, inadequate data is a key challenge for both groups when it comes to achieving personal and corporate Environmental, Social and Governance (ESG) goals.

The study* reveals that surveyed executives point to inadequate data (41%) as the biggest obstacle to their ESG progress, followed by regulatory barriers (39%), inconsistent standards (37%) and inadequate skills (36%). Without the ability to access, analyze and understand ESG data, companies struggle to deliver greater transparency to the consumer a key stakeholder and meet consumer expectations.

Seventy-four percent of surveyed executives believe that stakeholders understand their organizations' ESG objectives and performance, yet only about 4 in 10 surveyed consumers feel they have enough data to make environmentally sustainable purchasing (41%) or employment (37%) decisions.

"Consumer commitment to environmental sustainability and social responsibility has intensified with consumers voting with their wallets," said Jonathan Wright , Global Managing Partner Sustainability Services and Global Business Transformation, IBM Consulting. "As a majority of consumers choose to buy from and work for ESG leaders, businesses must prioritize transparency and break down barriers to ESG data."

Other study findings include:

Companies are investing in ESG and see it as good for business

Consumer commitment to sustainability has intensified, but consumers don't feel they have sufficient information to make informed choices

Executives admit their companies haven't made significant progress toward ESG goals, indicating data challenges impact their ability to measure progress and meet consumer demands

The study highlights ESG leaders, a sub-set of respondents with greater maturity in operationalizing ESG, who are seeing higher revenue, improved profitability, deeper customer engagement by approaching ESG as a transparency play that creates strategic business opportunities. These role models provide a roadmap for organizations looking to overcome data-related challenges and create sustainable change that includes: automating ESG processes and reporting capabilities to keep data current; tapping AI for enhanced insights into performance, forward looking analysis, and scenario development; aligning with ecosystem partners on ESG metric definitions and standards; and proactively establishing ESG data governance principles with stakeholders.

"Data is the lifeblood of ESG. Now is the time for enterprises to act. By operationalizing ESG plans, enterprises are putting information in the hands of operators who can make informed business decisions that can improve their ESG impact on a daily basis," said Wright. "Organizations looking to increase stakeholder support and meet ESG reporting requirements should implement a sustainability roadmap that is inclusive of technologies, services and ecosystem partners that can position them for greater business success and help them address regulatory compliance," said Wright.

To view the full study, visit: https://ibm.co/esg-ultimatum

*Study Methodology

The IBM Institute for Business Value (IBV) surveyed 2,500 executives from across 22 industries and34 countries, delving into their organizations' ESG strategy, approach, and operationalization; what benefits they expect from ESG initiatives; and how they weigh ESG against other business objectives. The IBV also surveyed more than 20,000 consumers across 34 countries about their attitudes toward sustainability and social responsibility, and how these beliefs influence shopping, investing, and career decisions.

About the IBM Institute for Business Value

The IBM Institute for Business Value, IBM's thought leadership think tank, combines global research and performance data with expertise from industry thinkers and leading academics to deliver insights that make business leaders smarter. For more world-class thought leadership, visit: http://www.ibm.com/ibv .

Media Contact: Jamee Nelson IBM External Relations jamee.nelson@ibm.com

View original content to download multimedia: https://www.prnewswire.com/news-releases/new-ibm-study-reveals-inadequate-data-hinders-progress-against-environmental-social-and-governance-goals-301798830.html

SOURCE IBM

Read this article:
New IBM Study Reveals Inadequate Data Hinders Progress Against Environmental, Social and Governance Goals - Investing News Network