Engineering Papers⌕ Search

Engineering topics

Korepin, Vladimir

Publications and source records attributed to Korepin, Vladimir.

6 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Geometric representations of braid and Yang–Baxter gates

Brick-wall circuits composed of the Yang–Baxter gates are integrable. It becomes an important tool to study the quantum many-body system out of equilibrium. To put the Yang–Baxter gate on quantum computers, it has to be decomposed into the native gates of quantum computers. It is favorable to apply the least number of native two-qubit gates to construct the Yang–Baxter gate. We study the geometric representations of all X-type braid gates and their corresponding Yang–Baxter gates via the Yang–Baxterization. We find that the braid and Yang–Baxter gates can only exist on certain edges and faces of the two-qubit tetrahedron. We identify the parameters by which the braid and Yang–Baxter gates are the Clifford gate, the matchgate, and the dual-unitary gate. The geometric representations provide the optimal decompositions of the braid and Yang–Baxter gates in terms of other two-qubit gates. We also find that the entangling powers of the Yang–Baxter gates are determined by the spectral parameters. Our results provide the necessary conditions to construct the braid and Yang–Baxter gates on quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Optimal Realization of Yang–Baxter Gate on Quantum Computers

Quantum computers provide a promising method to study the dynamics of many-body systems beyond classical simulation. On the other hand, the analytical methods developed and results obtained from the integrable systems provide deep insights on the many-body system. Quantum simulation of the integrable system not only provides a valid benchmark for quantum computers but is also the first step in studying integrable-breaking systems. The building block for the simulation of an integrable system is the Yang–Baxter gate. It is vital to know how to optimally realize the Yang–Baxter gates on quantum computers. Based on the geometric picture of the Yang–Baxter gates, the optimal realizations of two types of Yang–Baxter gates with a minimal number of controlled NOT (CNOT) or gates are presented. It is also shown how to systematically realize the Yang–Baxter gates via the pulse control. The different realizations on IBM quantum computers are tested and compared. It is found that the pulse realizations of the Yang–Baxter gates always have a higher gate fidelity compared to the optimal CNOT or realizations. On the basis of the above optimal realizations, the simulation of the Yang–Baxter equation on quantum computers is demonstrated. Finally, these results provide a guideline and standard for further experimental studies based on the Yang–Baxter gate.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

The case for an EIC Theory Alliance: Theoretical Challenges of the EIC

We outline the physics opportunities provided by the Electron Ion Collider (EIC). These include the study of the parton structure of the nucleon and nuclei, the onset of gluon saturation, the production of jets and heavy flavor, hadron spectroscopy and tests of fundamental symmetries. We review the present status and future challenges in EIC theory that have to be addressed in order to realize this ambitious and impactful physics program, including how to engage a diverse and inclusive workforce. In order to address these many-fold challenges, we propose a coordinated effort involving theory groups with differing expertise is needed. We discuss the scientific goals and scope of such an EIC Theory Alliance.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

The Case for an EIC Theory Alliance

This documents outlines the case for the creation of an EIC Theory Alliance. The EIC will be a unique and versatile facility that will enable the understanding of some of the most compelling questions in the physics of the strong nuclear force. To fully exploit the potential of the EIC, a focused theory effort will be required. The goal of the EIC Theory Alliance is to provide support and stewardship of the theory effort in EIC physics, broadly defined, over the lifetime of the facility. It will promote EIC theory and contribute to workforce development through: support of graduate students; EIC Theory Fellowships for postdocs; bridge positions at universities; and short and long term visitor programs to enhance collaboration between groups. In addition, the alliance will organize topical schools and workshops. The EIC Theory Alliance will be a decentralized organization, open to participation by anyone in the community who is interested in EIC physics, i.e., it will be a membership organization, where members elect an executive board which will effectively run the alliance. The executive board will determine the major scientific thrusts of the theory alliance, make decisions regarding at which universities bridge faculty positions will be created, and serve as a search committee for EIC-related positions. Furthermore, the executive board will coordinate the organization of workshops and schools related to the research activities of the alliance. In addition, the EIC theory alliance will seek out and nurture international cooperation to maximally leverage the available funding. The EIC theory alliance has a wider range of physics goals and longer lifetime, commensurate with that of the EIC research program, than individual nuclear theory topical collaborations. The structure of the EIC Theory Alliance will build on previous examples of successful alliances in nuclear theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Quantum multi-programming for Grover’s search

Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size quantum algorithms without correlation. In this paper, we propose a quantum multi-programming (QMP algorithm for Grover's search. Our algorithm decomposes Grover's algorithm by the partial diffusion operator and executes the decomposed circuits in parallel by QMP. We proved that this new algorithm increases the rotation angle of the Grover operator which, as a result, increases the success probability. The new algorithm is implemented on IBM quantum computers and compared with the canonical Grover's algorithm and other variations of Grover's algorithms. So, the empirical tests validate that our new algorithm outperforms other variations of Grover's algorithms as well as the canonical Grover's algorithm.

97 MATHEMATICS AND COMPUTING↗