Cluster State Computation with Quantum-Dot Charge Qubits by Matthew Lubelski Katz, Jingbo Wang

“…The cluster state is a special, highly entangled quantum state that forms the universal resource on which measurement-based quantum computation can be performed. This paper provides a brief review of the theoretical foundations of cluster state quantum computation and how it evolved from the traditional model of digital computers. …”
Get full text

Quantum Teleportation and Entanglement of the 5-Qubit State Over a GHZ-Like Channel by Aseel Hamad, Shareef Faiq Al-tikrity, Abdullah. H. Mohammed

“… Quantum information processing has a wide range of uses, including the solution of complex algorithms, cryptography, dense coding, quantum computation, and quantum teleportation. Quantum entanglement, a phenomenon that is crucial to many different applications of quantum computation, is an essential resource for quantum computation, and the need for quantum circuits that generate entangled states is one of the ongoing needs for constructing quantum computers. …”
Get full text

Quantum-mechanical prediction of the behavior of quantum trigger on a two-qubit cell of boron in silicene by Andrey N. Chibisov, Mary A. Chibisova

“…The problem of creating energy-efficient quantum computers capable of performing quantum operations without errors is a significant scientific challenge in modern nanoelectronics. …”
Get full text

Spontaneous parametric down conversion without poling for silicon carbide and lithium niobate photonics by Tim F. Weiss, Hamed Arianfard, Yang Yang, Alberto Peruzzo

Get full text

Quantum Surface Topological Code for Bell State Stabilization in Superconducting Physical Qubit Systems by Jordi Fabián González-Contreras, Erik Zamora, Jesús Yaljá Montiel-Pérez, Juan Humberto Sossa-Azuela, Elsa Rubio-Espino, Víctor Hugo Ponce-Ponce

“…Stabilizing quantum states in physical qubits quantum computers has been a widely explored topic in the Noisy Intermediate-Scale Quantum era. …”
Get full text

Technontologies, Complexity, and Hybrid Interfaces by Renata Lemos, Vinícius Kern

“…These new developments, together with recent advances in quantum computational physics, challenge traditional philosophical ontology. …”
Get full text

Non-variational quantum random access optimization with alternating operator ansatz by Zichang He, Rudy Raymond, Ruslan Shaydulin, Marco Pistoia

“…Our results pave the way for the practical execution of QRAO on early fault-tolerant quantum computers.…”
Get full text

On the Physical Basis for the Incomparability of NP and BQP by Vivek Kumar, Maheshwari Prasad Singh, Srikanth Radhakrishna

“…Thus, the linearity of quantum theory prevents complete problems in these complexity classes to be efficiently solvable on a quantum computer. On the other hand, the exponentiality of quantum theory endows quantum computers with a certain strength going beyond $\mathcal{NP}$ or even $\mathcal{PH}$. …”
Get full text

Robust holonomic quantum gates via cyclic evolution protection by Yan Liang, Tao Chen, Zheng-Yuan Xue

“…Nonadiabatic holonomic quantum computation provides a promising approach toward fault-tolerant quantum control, due to its simple requirements for energy level structure and intrinsic robustness stemming from non-Abelian geometric phases. …”
Get full text

Entangling gates from cabling of knots by Sergey Mironov, Andrey Morozov

“…In this paper we discuss how to construct an efficient realization of a two qubit gate in topological quantum computer, by using principle of cabling from the knot theory. …”
Get full text

Unconditional quantum magic advantage in shallow circuit computation by Xingjian Zhang, Zhaokai Pan, Guoding Liu

“…The celebrated Gottesman-Knill Theorem implies that the full power of quantum computation resides in the specific resource of “magic” states—the secret sauce to establish universal quantum computation. …”
Get full text

Topological computation by non-Abelian braiding in classical metamaterials by Liyuan Chen, Matthew Fuertes, Bolei Deng

“…This work provides a different framework for exploring topological quantum computation using classical metamaterials and offers a pathway to realizing stable vibrational systems protected by topology.…”
Get full text

Proxy re-signature scheme based on isomorphisms of polynomial by Hui-xian LI, Lu SHAO, Liao-jun PANG

“…Most of the existing proxy resignature schemes were based on the hardness of big integer factoring,discrete logarithm,elliptic curve.However,none of them can resist the attack by a quantum computer.Motivated by these concerns,a new proxy resignature scheme was proposed.By employing secret affine transformations and homogeneous polynomials,the proposed scheme could implement the signature transformation with high-efficiency,and meanwhile it was secure against the attack by a quantum computer.The results of analysis showed that the proposed scheme was correct and consistent,and had the unforgeability in the random oracle model.Compared with the existing schemes,the proposed scheme not only inherits the resistance to quantum attack and high efficiency from the multivariate public key cryptosystems,but also has the properties of multi-use,transparent and private proxy.…”
Get full text

Computational Power of Random Quantum Circuits in Arbitrary Geometries by M. DeCross, R. Haghshenas, M. Liu, E. Rinaldi, J. Gray, Y. Alexeev, C. H. Baldwin, J. P. Bartolotta, M. Bohn, E. Chertkov, J. Cline, J. Colina, D. DelVento, J. M. Dreiling, C. Foltz, J. P. Gaebler, T. M. Gatterman, C. N. Gilbreth, J. Giles, D. Gresh, A. Hall, A. Hankin, A. Hansen, N. Hewitt, I. Hoffman, C. Holliman, R. B. Hutson, T. Jacobs, J. Johansen, P. J. Lee, E. Lehman, D. Lucchetti, D. Lykov, I. S. Madjarov, B. Mathewson, K. Mayer, M. Mills, P. Niroula, J. M. Pino, C. Roman, M. Schecter, P. E. Siegfried, B. G. Tiemann, C. Volin, J. Walker, R. Shaydulin, M. Pistoia, S. A. Moses, D. Hayes, B. Neyenhuis, R. P. Stutz, M. Foss-Feig

“…Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. …”
Get full text

Towards a real-time computation of timelike hadronic vacuum polarization and light-by-light scattering: Schwinger Model tests by João Barata, Kazuki Ikeda, Swagato Mukherjee, Jonathan Raghoonanan

“…To that end, we use both tensor network techniques, specifically matrix product states, and classical emulators of digital quantum computers. Demonstrating feasibility in a simplified model, our approach sets the stage for future endeavors leveraging digital quantum computers.…”
Get full text

Optimization Techniques on Quantum and Classical Systems: A Comprehensive Comparative Study by Shaik Hussain, Rajitha Morampudi, Priyamvada K., Bhargavi R. Naveena

“…Future research should address challenges like noise, limited qubits, and high material costs to improve quantum computers’ efficiency and availability.…”
Get full text

Measurement-based long-range entangling gates in constant depth by Elisa Bäumer, Stefan Woerner

“…Reducing circuit depth decreases noise in near-term quantum computations and reduces overall computation time. …”
Get full text

Classical simulations of noisy variational quantum circuits by Enrico Fontana, Manuel S. Rudolph, Ross Duncan, Ivan Rungger, Cristina Cîrstoiu

“…Abstract Noise detrimentally affects quantum computations so that they not only become less accurate but also easier to simulate classically as systems scale up. …”
Get full text

Shallow implementation of quantum fingerprinting with application to quantum finite automata by Mansur Ziiatdinov, Aliya Khadieva, Aliya Khadieva, Aliya Khadieva, Kamil Khadiev, Kamil Khadiev

“…Despite the fact that on the ideal quantum computational device, the opposite situation arises. …”
Get full text

Resource-optimized fault-tolerant simulation of the Fermi-Hubbard model and high-temperature superconductor models by Angus Kan, Benjamin C. B. Symons

“…Abstract Exploring low-cost applications is paramount to creating value in early fault-tolerant quantum computers. Here, we optimize both gate and qubit counts of recent algorithms for simulating the Fermi-Hubbard model. …”
Get full text