Skip to main content
Have a personal or library account? Click to login
New Approaches to Complexity via Quantum Graphs Cover

New Approaches to Complexity via Quantum Graphs

Quantum Information & Computation
Volume 25 (2025): Issue 5 (December 2025)
By:  and    
Open Access
|Dec 2025
Figures & tables

Figures & Tables

graphic/j_qic-2025-0026_ufig_001.jpg
Figure 1.

Quantum circuit representation of the swap test.

Figure 2.

Representation of the construction of the circuit C1 ⊕p C2 from the circuits C1 and C2 in canonical form, with out(C2) < out(C1). Up is a unitary that implements the map |0〉↦p|0〉+1−p|1〉 to good approximation.

Figure A1.

Construction of the channel from a QMA(2)-language verification circuit.

DOI: https://doi.org/10.2478/qic-2025-0026 | Journal eISSN: 3106-0544 (formerly 1533-7146) | Journal ISSN: 1533-7146
Journal RSS Feed
Language: English
Page range: 453 - 487
Submitted on: May 7, 2025
Accepted on: Aug 27, 2025
Published on: Dec 31, 2025
Published by: Cerebration Science Publishing Co., Limited
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Keywords:
Complexity Theory,
Quantum Graphs ,
Quantum Channels,
Unentanglement
Related subjects:
Computer sciences,
Computer sciences in the humanities,
Computer sciences in natural sciences,
Mathematics,
Applied mathematics,
Physics,
Quantum physics

© 2025 Eric Culf, Arthur Mehta, published by Cerebration Science Publishing Co., Limited
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Volume 25 (2025): Issue 5 (December 2025)
Previous article
Next article