Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Institute of Physics eBooks

Simplified Quantum Computing with Applications

Koji Nagata, Do Ngoc Diep, Ahmed Farouk, Tadao Nakamura

Published Jul 1, 2022• 10 citations
Publisher
DOI
10.1088/978-0-7503-4700-6

Related papers

Quantum Entanglement Matrix: A Novel Geometric Interpretation

Jincheng Zhang

This paper explores a new geometric framework rooted in quantum entanglement to provide a deeper understanding of quantum computation. We propose a model, the "纠缠几何", that transforms entanglement's non-commutative nature into a novel mathematical structure, offering potential advantages for quantum computing. The core claim is that this model simplifies quantum computation and unlocks new application possibilities. The paper details the design of this model, its mathematical properties, and the potential for its application within the field of quantum information processing.

•Sep 4, 2026•0 citations

Applications for Quantum Computing

Madhusudan Singh Irish Singh, Bharat S. Rawal

Springer eBooks•Jan 1, 2026•0 citations

A Simplified Quantum Approach Using Grover's Algorithm for Solving the Vertex Cover Problem

Mohamed Yassine Cherif, Wided Lejouad Chaari, Olfa Belkahla Driss

Quantum computing offers an accelerated mechanism for solving combinatorial optimization problems that could be hardly solvable with classical tools, in this context, this paper highlights the utility of quantum computing in solving NP-complete problems efficiently and shows up the importance of employing quantum algorithms achieving parallel calculation in the purpose of reducing the algorithmic complexity and simplifying the development of optimization applications. Within this publication, an optimized version of quantum circuit conception for developing the oracle of the Grover's search algorithm is introduced for solving the vertex cover problem, and it was also tested using the Qiskit library and applied to a set of instances to evaluate its performance.

IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)•Oct 22, 2024•1 citation

Quantum Computing: Basics and New Results

Anas N. Al‐Rabadi

Springer eBooks•Jan 1, 2004•0 citations

Geometric Simulation of Quantum Superposition

Jincheng Zhang

This paper presents a novel geometric simulation framework designed to model and analyze quantum superposition. Traditional approaches often struggle with the inherent complexity of the superposition state, making it difficult to visualize and computationally explore. We introduce a geometric model that encapsulates the superposition of quantum states, allowing for a simplified yet effective representation of quantum phenomena. The core mechanism involves representing the superposition as a geometric object – a set of points or curves – and utilizing geometric transformations to mimic the evolution of the superposition. This framework offers a promising path towards a more intuitive and efficient understanding of quantum mechanics, particularly in the context of quantum computing and information theory. The paper details the model's architecture, demonstrates its application to a simplified example, and discusses potential future directions.

•Aug 31, 2026•0 citations

Basics of Quantum Computing

P. Nagendra Kumar, K. Chiranjeevi, B. Poojitha +1 more

•Apr 1, 2026•0 citations
This paper explores a new geometric framework rooted in quantum entanglement to provide a deeper understanding of quantum computation. We propose a model, the "纠缠几何", that transforms entanglement's non-commutative nature into a novel mathematical structure, offering potential advantages for quantum computing. The core claim is that this model simplifies quantum computation and unlocks new application possibilities. The paper details the design of this model, its mathematical properties, and the potential for its application within the field of quantum information processing.
Quantum computing offers an accelerated mechanism for solving combinatorial optimization problems that could be hardly solvable with classical tools, in this context, this paper highlights the utility of quantum computing in solving NP-complete problems efficiently and shows up the importance of employing quantum algorithms achieving parallel calculation in the purpose of reducing the algorithmic complexity and simplifying the development of optimization applications. Within this publication, an optimized version of quantum circuit conception for developing the oracle of the Grover's search algorithm is introduced for solving the vertex cover problem, and it was also tested using the Qiskit library and applied to a set of instances to evaluate its performance.
This paper presents a novel geometric simulation framework designed to model and analyze quantum superposition. Traditional approaches often struggle with the inherent complexity of the superposition state, making it difficult to visualize and computationally explore. We introduce a geometric model that encapsulates the superposition of quantum states, allowing for a simplified yet effective representation of quantum phenomena. The core mechanism involves representing the superposition as a geometric object – a set of points or curves – and utilizing geometric transformations to mimic the evolution of the superposition. This framework offers a promising path towards a more intuitive and efficient understanding of quantum mechanics, particularly in the context of quantum computing and information theory. The paper details the model's architecture, demonstrates its application to a simplified example, and discusses potential future directions.