<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
    <channel>
        <title>Quantum Information &amp; Computation Feed</title>
        <link>https://sciendo.com/journal/QIC</link>
        <description>Sciendo RSS Feed for Quantum Information &amp; Computation</description>
        <lastBuildDate>Sun, 10 May 2026 13:18:16 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>https://github.com/jpmonette/feed</generator>
        <image>
            <title>Quantum Information &amp; Computation Feed</title>
            <url>https://sciendo-parsed.s3.eu-central-1.amazonaws.com/663ab65edd1c3d1f871195bf/cover-image.jpg</url>
            <link>https://sciendo.com/journal/QIC</link>
        </image>
        <copyright>All rights reserved 2026, Cerebration Science Publishing Co., Limited</copyright>
        <item>
            <title><![CDATA[Quantum Information and Computing for Beginners: Basics of Qubit Transformations and Quantum Algorithms]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0040</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0040</guid>
            <pubDate>Mon, 09 Mar 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[

Quantum information and quantum computing are based on the concept and manipulation of qubits. In this pedagogical Tutorial–written with the aim of assisting self-motivated undergraduate mathematics, physics, and engineering students–transformation of these qubits, especially the Hadamard transformation (H) and the phase shifter transformation (Φ), is illustrated. Two-qubit gates and their application in production of entangled states, along with quantum algorithms (including Deutsch–Jozsa algorithm), are included as well. With 2025 being declared as the International Year of Quantum Science and Technology (IYQ) by the United Nations General Assembly (UNGA), under the leadership of United Nations Educational, Scientific and Cultural Organization (UNESCO), the timeliness and relevance of this Tutorial, in order to nudge the budding researchers in the “quantum” direction, cannot be emphasized enough.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[On Quantum Solvers for Linear Algebraic Systems]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0035</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0035</guid>
            <pubDate>Mon, 09 Mar 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[

Solving large-scale linear systems is an integral part of many scientific disciplines. Classical linear solvers have a polynomial time complexity and it seems impossible to further improve their performance. This fact has directed scientific research to the study of corresponding quantum algorithms, which promise even exponential acceleration compared to existing methods. In this paper, we present and analyze some of the most important related results. In particular, we present the HHL and WZP algorithms based on the eigen-decomposition of a matrix, the row and column iteration methods, as well as two hybrid algorithms that require the cooperation of a classical and a quantum computer, namely an algorithm that uses random walks and the VQLS algorithm. The latter is also examined from an experimental standpoint using the Qiskit open-source framework and a suitable quantum circuit is proposed which can enhance its performance.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[One Application of Duistermaat-Heckman Measure in Quantum Information Theory]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0033</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0033</guid>
            <pubDate>Mon, 09 Mar 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[

While the exact separability probability of 8/33 for two-qubit states under the Hilbert-Schmidt measure has been reported by Huong and Khoi, detailed derivations remain inaccessible for general audiences. This paper provides a comprehensive, self-contained derivation of this result, elucidating the underlying geometric and probabilistic structures. We achieve this by developing a framework centered on the computation of Hilbert-Schmidt volumes for key components: the quantum state space, relevant flag manifolds, and regular (co)adjoint orbits. Crucially, we establish and leverage the connection between these Hilbert-Schmidt volumes and the symplectic volumes of the corresponding regular co-adjoint orbits, formalized through the Duistermaat-Heckman measure. By meticulously synthesizing these volume computations—specifically, the ratios defining the relevant probability measures—we reconstruct and rigorously verify the 8/33 separability probability. Our approach offers a transparent pathway to this fundamental constant, detailing the interplay between symplectic geometry, representation theory, and quantum probability.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Bit Symmetry Entails the Symmetry of the Quantum Transition Probability]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0034</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0034</guid>
            <pubDate>Mon, 09 Mar 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[

It is quite common to use the generalized probabilistic theories (GPTs) as generic models to reconstruct quantum theory from a few basic principles and to gain a better understanding of the probabilistic or information theoretic foundations of quantum physics and quantum computing. A variety of symmetry postulates was introduced and studied in this framework, including the transitivity of the automorphism group (1) on the pure states, (2) on the pairs of orthogonal pure states [these pairs are called 2-frames] and (3) on any frames of the same size. The second postulate is Müller and Ududec’s bit symmetry, which they motivate by quantum computational needs. Here we explore these three postulates in the transition probability framework, which is more specific than the GPTs since the existence of the transition probabilities for the quantum logical atoms is presupposed either directly or indirectly via a certain geometric property of the state space. This property for compact convex sets was introduced by the author in a recent paper. We show that bit symmetry implicates the symmetry of the transition probabilities between the atoms. Using a result by Barnum and Hilgert, we can then conclude that the third rather strong symmetry postulate rules out all models but the classical cases and the simple Euclidean Jordan algebras.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Quantum Algorithms for Matrix Operations of Row Addition, Row Swapping, Trace Calculation and Transpose]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0031</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0031</guid>
            <pubDate>Mon, 09 Mar 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[

Quantum algorithms of matrix operations are of great significance in many fields in science and technology. In this paper, by leveraging multi-qubit Toffoli gates and basic single-qubit operations, the quantum algorithms of matrix operations of row addition, row swapping, trace calculation and transpose are obtained. In particular, the complexities of these quantum algorithms are presented, too.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Realization of Deterministic Quantum Circuits for Non-Deterministic or Incompletely Specified Quantum State Machines]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0038</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0038</guid>
            <pubDate>Mon, 09 Mar 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[

In classical logic design, there are machine learning methods based on converting a set of input-output traces to non-deterministic automata that are then converted to deterministic automata and synthesized using logic gates. This approach has not yet been extended to quantum automata. In this paper, we present a method to convert a set of input-output traces to a non-deterministic automaton, which is then converted to an incompletely specified multi-output Boolean function. The existing logic synthesis approaches for designing quantum circuits are insufficient to handle incompletely specified functions. So, we present a novel algorithm to synthesize logic functions with don’t cares using permutative quantum gates. The original MMD (D.M.Miller, D. Maslov, and G.W.Dueck) algorithm minimizes only completely specified reversible functions using cascades of reversible gates. In this paper, this algorithm is modified to allow for the inclusion of don’t cares within the given function’s truth table (reversible or irreversible). The distinguishing property of our presented algorithm QAS, is that it does not add any ancilla qubits if it is not necessary. This algorithm solves the problem of synthesizing deterministic and non-deterministic quantum state machines, both completely specified and incompletely specified.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Optimal T-depth Quantum Circuits for Implementing Arbitrary Boolean Functions]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0032</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0032</guid>
            <pubDate>Mon, 09 Mar 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[

In this paper, we present a generic construction for synthesizing an optimal T-depth quantum circuit for any arbitrary n-input, m-output Boolean function f : {0, 1 }n → {0, 1}m with algebraic degree k ≤ n, achieving an exact Toffoli (consequently T) depth of ⌈log2 k⌉. This broadly generalizes the recent result establishing the optimal Toffoli (and T) depth for multi-controlled Toffoli decompositions (Dutta et al., Phys. Rev. A, 2025). The optimality of T-depth in this initiative is considered in the context of implementing an n-MCT, assuming the decomposition via Clifford plus Toffoli gates. The key technique involves inspecting the Algebraic Normal Form (ANF) of the Boolean function. Obtaining a benchmark for the minimum T-depth of such circuits is crucial for the efficient implementation of quantum algorithms by enabling greater parallelism, reducing time complexity, and minimizing circuit latency, making them suitable for near-term quantum devices with limited coherence times. The broader implications of our results include a provable lower bounds on T-depth for S-box and block cipher implementations, such as AES. Finally, we also explain the impact of our result in identifying the T-depth for the generic cryptanalysis of block ciphers using Grover’s algorithm.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Toward an Algorithmic Framework and Grover’s search speedup for Quantum Circuit Design—Leveraging the Minimum Connected Dominating Set Problem as an Example]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0037</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0037</guid>
            <pubDate>Mon, 09 Mar 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[

In recent years, quantum computing has gradually extended its influence beyond the realm of physics research into the fields of electrical engineering and computer science. Most researchers and programmers remain more familiar with traditional algorithmic techniques based on conventional computer architectures. To address this gap, this study proposes a quantum algorithmic circuit design framework with Grover’s search speedup technique and provides theoretical proofs for some design techniques, aiming to facilitate knowledge transfer and ease the learning curve for designers entering the field of quantum algorithm development. Since combinatorial optimization problems in graph theory serve as the foundation for many practical applications, this study adopts the well-known Connected Dominating Set (CDS) problem as a design example to illustrate the practical applicability of the proposed quantum algorithmic design framework and presents a quantum circuit as a potential solution for addressing realworld challenges in network optimization and related applications. In addition, the circuit proposed in this paper can serve as a quantum oracle to identify connected dominating sets (CDSs) of a graph. When the oracle is applied to a superposition of vertex subsets, Grover’s search algorithm achieves a quadratic speedup. We designed a method for adjusting the initial amplitudes so that the search can be biased toward smaller CDSs, which maximizes the probability of finding the minimum CDS.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Simple Ways of Preparing Qudit Dicke States]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0036</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0036</guid>
            <pubDate>Mon, 09 Mar 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[

Dicke states are permutation-invariant superpositions of qubit computational basis states, which play a prominent role in quantum information science. We consider here two higher-dimensional generalizations of these states: SU(d) spin-s Dicke states and SU(2) Dicke states. We present various ways of preparing both types of qudit Dicke states on a qudit quantum computer, using two main approaches: a deterministic approach, based on exact canonical matrix product state representations; and a probabilistic approach, based on quantum phase estimation. The quantum circuits are explicit and straightforward, and are arguably simpler than those previously reported.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Random-Projector Quantum Diagnostics of Ramsey Numbers and A Prime-factor Heuristic for R(5, 5) = 45]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0039</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0039</guid>
            <pubDate>Mon, 09 Mar 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[

We introduce a statistical framework for estimating Ramsey numbers by embedding two-color Ramsey instances into a ℤ2 × ℤ2-graded Majorana algebra. This approach replaces brute-force enumeration with two randomized spectral diagnostics applied to operators of a given dimension d associated with Ramsey numbers: a linear projector Plin and an exponential map Pexp(α), suitable for both classical and quantum computation. In the diagonal case, both diagnostics identify R(5, 5) at n = 45. The quantum realizations act on a reduced module and therefore require only five data qubits plus a few ancillas via block-encoding/qubitization for R(5, 5) = 45, in stark contrast to the (n2)≈103\left( \matrix{
  n \cr 
  2 \cr}  \right) \approx {10^3} logical qubits demanded by direct edge encodings. We also provide few-qubit estimates for R(6, 6) and R(7, 7), and propose a simple “prime-sequence” consistency heuristic that connects R(5, 5) = 45 to constrained diagonal growth. Our method echoes Erdős’s probabilistic paradigm, emphasizing randomized arguments rather than explicit colorings, and parallels the classical coin-flip approach to Ramsey bounds. Finally, we discuss potential applications of this framework to machine learning with a limited number of qubits.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Twin-Field Quantum Network Coding for Multi-Party Key Distribution]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0027</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0027</guid>
            <pubDate>Wed, 31 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[

Quantum network coding enables multi-party quantum interactions over bottleneck channels. The communication distance is usually constrained by the instability of quantum states. Twin-field quantum key distribution is designed to improve the communication distance, but it can only be applied in point-to-point scenarios. In this paper, we propose a feasible twin-field quantum network coding scheme, which enables multi-party key distribution over long distance in networks with bottleneck channels. Firstly, a butterfly network model is designed for long-distance communication. Then, the coding method at each intermediate node is designed to overcome the limitations of bottleneck channels. Finally, the key rate and decoy-state transmission features are derived to demonstrate the security and efficiency advantages. Compared with the original point-to-point twin-field quantum key distribution protocol, the proposed scheme can distribute a group key among the four end nodes of the butterfly network with only one transmission round. The key rate R and the channel transmittance η still satisfy R ∝ η1/2. Such results will extend the communication distance and provide a foundation for the construction of large-scale quantum networks.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Qubit Geometry through Holomorphic Quantization]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0022</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0022</guid>
            <pubDate>Wed, 31 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[

We develop a wave mechanics formalism for qubit geometry using holomorphic functions and Möbius transformations, providing a geometric perspective on quantum computation. This framework extends the standard Hilbert space description, offering a natural interpretation of standard quantum gates on the Riemann sphere that is examined through their Möbius action on holomorphic wavefunction. These wavefunctions emerge via a quantization process, with the Riemann sphere serving as the classical phase space of the qubit geometry. We quantize this space using Isham’s canonical group quantization with holomorphic polarization, yielding holomorphic wavefunctions and spin angular momentum operators that recover the standard SU(2) algebra with interesting geometric properties. Such properties reveal how geometric transformations induce quantum logic gates on the Riemann sphere, providing a novel perspective on quantum information processing. This result provides a new direction for exploring quantum computation through Isham’s canonical group quantization and its holomorphic polarization method.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Analysis and Evaluation of Post-Quantum Cryptography for DNSSEC]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0025</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0025</guid>
            <pubDate>Wed, 31 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[

The development of quantum computing poses a threat to many internet protocols because it undermines the security of current asymmetric cryptography. New types of algorithms, collectively known as post-quantum cryptography (PQC), are being developed and tested as potential replacements. Despite being engineered to counter quantum computers using Shor’s algorithm, these systems frequently demand larger keys or signatures and substantial computational resources. This complicates the implementation of these algorithms in higher-level protocols, which requires thorough studies of the transition consequences. This paper evaluates the usefulness of one such PQC algorithm, FALCON-512, in the DNSSEC protocol. Using a containerized testbed, simulated DNS traffic is analyzed with a focus on key performance metrics, namely network latency and error rates, as the number of DNS clients in the network increases. The results show that PQC-enabled DNSSEC introduces higher error rates compared to today’s algorithms, especially in NSEC responses used to deny the existence of DNS records, which represent a significant increase, resulting in the network’s overload. The main contribution of this article is the validation of previous theoretical assumptions on the practical implications of FALCON-512 signature sizes in the implementation to DNSSEC. The differences in latency observed between nameservers in the DNS hierarchy during this study may inform DNS operators during the transition to PQC.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[New Approaches to Complexity via Quantum Graphs]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0026</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0026</guid>
            <pubDate>Wed, 31 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[

Problems based on the structure of graphs—for example, finding cliques, independent sets, or colorings—are of fundamental importance in classical complexity. Defining well-formulated decision problems for quantum graphs, which are an operator system generalization of graphs, presents several technical challenges. Consequently, the connections between quantum graphs and complexity have been underexplored. In this work, we introduce and study the clique problem for quantum graphs. Our approach utilizes a well-known connection between quantum graphs and quantum channels. The inputs for our problems are presented as quantum channels induced by circuits, which implicitly determine a corresponding quantum graph. We show that when quantifying over all channels, this problem is complete for QMA(2); in fact, it remains QMA(2) -complete when restricted to channels that are probabilistic mixtures of entanglement-breaking and partial trace channels. Quantifying over a subset of entanglementbreaking channels, this problem becomes QMA-complete, and restricting further to deterministic or classical noisy channels gives rise to complete problems for NP and MA, respectively. In this way, we exhibit a classical complexity problem whose natural quantization is QMA(2), rather than QMA, and provide the first problem that allows for a direct comparison of the classes QMA(2), QMA, MA, and NP by quantifying over increasingly larger families of instances. We use methods that are inspired by self-testing to provide a direct proof of QMA(2)-completeness, rather than reducing to a previously studied complete problem. We also give a new proof of the celebrated reduction of QMA(k) to QMA(2). In parallel, we study a version of the closely related independent set problem for quantum graphs, and provide preliminary evidence that it may be in general weaker in complexity, contrasting to the classical case.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Implementation of Quantum Fourier Transform and Quantum Hashing for Quantum Devices with Arbitrary Qubit Connectivity Graphs]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0028</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0028</guid>
            <pubDate>Wed, 31 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[

In the paper, we consider quantum circuits for quantum fingerprinting (quantum hashing) and quantum Fourier transform (QFT) algorithms. Quantum fingerprinting (quantum hashing) is a well-known technique for comparing large objects using small images. The QFT algorithm is a very popular technique used in many algorithms. We present a generic method for constructing quantum circuits for these algorithms for quantum devices with restrictions. Many quantum devices (e.g., based on superconductors) have restrictions on applying two-qubit gates. The restrictions are presented by a qubit connectivity graph. Typically, researchers consider only the linear nearest neighbor (LNN) architecture, but current devices have more complex graphs. We present a method for arbitrary connected graphs that minimizes the number of CNOT gates in the circuit. The heuristic version of the method is fast enough and works with O(n6) time complexity, where n is the number of qubits. The certain version of the algorithm has an exponential time complexity that is O(n22n). We compare quantum circuits built by our algorithm with quantum circuits optimized for specific graphs that are Linear-nearest-neighbor (LNN) architecture, “sun” (a cycle with tails, presented by the 16-qubit IBMQ device) and “two joint suns” (two joint cycles with tails, presented by the 27-qubit IBMQ device). Our generic method gives similar results with a few more CNOT gates. At the same time, our method allows us to construct a circuit for arbitrary connected graphs.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[A Quantum-Inspired Algorithm for Solving Sudoku Puzzles and the MaxCut Problem †]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0023</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0023</guid>
            <pubDate>Wed, 31 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[

We propose and evaluate a quantum-inspired algorithm for solving Quadratic Unconstrained Binary Optimization (QUBO) problems, which are mathematically equivalent to finding ground states of Ising spin-glass Hamiltonians. The algorithm employs Matrix Product States (MPS) to compactly represent large superpositions of spin configurations and utilizes a discrete driving schedule to guide the MPS toward the ground state. At each step, a driver Hamiltonian—incorporating a transverse magnetic field—is combined with the problem Hamiltonian to enable spin flips and facilitate quantum tunneling. The MPS is updated using the standard Density Matrix Renormalization Group (DMRG) method, which iteratively minimizes the system’s energy via multiple sweeps across the spin chain. Despite its heuristic nature, the algorithm reliably identifies global minima, not merely near-optimal solutions, across diverse QUBO instances. We first demonstrate its effectiveness on intermediate-level Sudoku puzzles from publicly available sources, involving over 200 Ising spins with long-range couplings dictated by constraint satisfaction. We then apply the algorithm to MaxCut problems from the Biq Mac library, successfully solving instances with up to 251 nodes and 3,265 edges. We discuss the advantages of this quantum-inspired approach, including its scalability, generalizability, and suitability for industrial-scale QUBO applications.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Experimental Factoring Integers Using Fixed-Point-QAOA with a Trapped-Ion Quantum Processor]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0021</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0021</guid>
            <pubDate>Wed, 31 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[

Factoring integers is considered as a computationally hard problem for classical methods, whereas there exists polynomial-time Shor’s quantum algorithm for solving this task. However, requirements for running Shor’s algorithm for realistic tasks, which are beyond the capabilities of existing and upcoming generations of quantum computing devices, motivate to search for alternative approaches. In this work, we experimentally demonstrate factoring of the integer with a trapped ion quantum processor using the Schnorr approach and a modified version of the quantum approximate optimization algorithm (QAOA). The key difference of our approach in comparison with the recently proposed QAOA-based factoring method is the use of the fixed-point feature, which relies on the use of universal parameters. We present experimental results on factoring 1591 = 37 × 43 using 6 qubits as well as simulation results for 74425657 = 9521 × 7817 with 10 qubits and 35183361263263 = 4194191 × 8388593 with 15 qubits. Although we present all the necessary details for reproducing our results and analysis of the performance of the factoring method, the scalability of this approach in both the classical and quantum domains still requires further studies.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[A Novel and Ultra-Efficient Design of Reversible Quantum Vedic Multiplier]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0030</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0030</guid>
            <pubDate>Wed, 31 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[

Quantum computing has attracted increased attention in recent years owing to substantial advancements in quantum algorithms and system architecture. Quantum algorithms are implemented using quantum circuits. These circuits include an intrinsic reversibility and often have a substantial Boolean component that requires synthesis. A crucial characteristic of reversible circuits is the preservation of parity. Parity-preserving logic is a category that maintains the parity of both inputs and outputs, facilitating the detection of permanent and transient errors. Multiplier circuits are essential components in digital computing systems, playing a crucial role in the development of various hardware, including arithmetic circuits. This paper first introduces a novel block based on a transformationbased synthesis technique from the elementary quantum gates. Then it proposes a distinctive 2×2 parity-preserving reversible quantum Vedic multiplier based on the recommended block and prior gates. In addition, further designs of Vedic multipliers are provided, encompassing 4-bit, 8-bit, and 16-bit configurations. We illustrate that our design brings superior outcomes regarding quantum cost (QC), constant inputs (CI) count, CNOT-V/V+ count, garbage outputs (GO) count, and gate count (GC) in comparison to earlier designs. This study achieves an average decrease of 23.09%, 37.51%, 37.51%, 54.89%, and 19.38% in QC, CI, GO, GC, and CNOT-V/V+ count, respectively. Furthermore, all suggested circuits undergo appraisal and validation within the IBM quantum laboratory.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Deterministic Quantum Key Distribution with Untrusted Relay and Finite Sources]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0029</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0029</guid>
            <pubDate>Wed, 31 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[

Measurement-device-independent quantum key distribution (MDI-QKD) is proposed to close all loopholes of detection devices in QKD systems, and it holds the potential to double the limit transmission distance of those one-way QKD protocols. However, most MDI-QKD protocols are nondeterministic, which reduces the potential key rate by nearly half. In this paper, we propose a deterministic QKD protocol with an untrusted detection relay and finite sources, and based on the current technology of QKD devices, we derive the performance formula for it. The simulation results show that the performance of this protocol can exceed the MDI-QKD within the long limit transmission distance range, about 445km.
]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Tight Analysis of Grover-Meets-Simon and Alg-PolyQ2 Attacks via Formalizing Quantum Rank-Solving under Deferred Measurement]]></title>
            <link>https://sciendo.com/article/10.2478/qic-2025-0024</link>
            <guid>https://sciendo.com/article/10.2478/qic-2025-0024</guid>
            <pubDate>Wed, 31 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[

The combination of quantum algorithms is one promising approach to attacking symmetric cryptography. In this paper, we study in detail the Grover-meets-Simon and Alg-PolyQ2 algorithms under deferred measurement, which combine the ideas of Grover’s and Simon’s algorithms and are applicable to attacking the FX construction. By converting intermediate measurements into unitary operations deferred to the end of the quantum circuit, both quantum algorithms involve a quantum rank-solving problem. To address it, we first provide a formal analysis of the generalized quantum Gauss–Jordan elimination and characterize the resulting quantum state after the corresponding unitary operations, which serves as a subroutine in these two algorithms. Subsequently, we derive the tight bounds of the attack success probability of these two algorithms based on the initial amplitude, offering a novel perspective that confirms their effectiveness. Furthermore, our research perspective provides an idea for analyzing the attack success probability for some quantum algorithms integrating Grover’s algorithm without considering quantum input length, and contributes to a deeper understanding of these attacks’ underlying mechanisms under the deferred measurement principle.
]]></description>
            <category>ARTICLE</category>
        </item>
    </channel>
</rss>