Searcharxiv⌕ Search

arXiv subjects

Sergii Strelchuk

Publications and source records attributed to Sergii Strelchuk.

At least 19 recordsLinked to original sources

Entanglement Lower Bounds for Symmetric Quantum Circuits

Symmetric circuits require every symmetry of the input to extend to an automorphism of the circuit. In the classical setting, their connection to descriptive complexity yields strong unconditional lower bounds. We extend this approach to the quantum model of symmetric computation defined by Castro-Silva, Gur, and Strelchuk (ITCS 2026), proving a tradeoff between circuit size and entanglement width (the smallest $b$ such that, on every computational-basis input, the state after each layer factors into states on at most $b$ qubits each). Our main result identifies a graph property decidable in classical polynomial time that no polynomial-size family of symmetric quantum circuits on $n$-vertex graphs with entanglement width $o(n/\log n)$ can compute. The bound holds for circuits with arbitrary one-qubit and two-qubit gates and unrestricted depth, and remains valid under the weaker notion of symmetry with respect to even permutations of vertices. Our proof is based on a new quantum pebble game based on the partial trace. The resulting indistinguishability theorem transfers classical pebble-game lower bounds to quantum circuits with restricted entanglement. By contrast, without entanglement restrictions, we show that every graph property in BQP can be computed by a uniform family of polynomial-size symmetric quantum circuits. Restricting to circuits with no entanglement at all, we show that polynomial-size symmetric quantum circuits with entanglement width 1 can compute every graph property definable in fixed-point logic with counting. Finally, we give an efficient symmetric implementation of QAOA for MAX 3XOR, providing a starting point for studying entanglement lower bounds in quantum optimization algorithms.

quant-ph↗

Classification of Kirkwood-Dirac positivity-preserving unitaries

Kirkwood-Dirac (KD) quasiprobability distributions are increasingly used across quantum information science, yet their computational significance remains unclear. We classify unitary dynamics that preserve KD positivity and connect this structure to classical simulation. In contrast to the discrete Wigner setting, we show that KD positivity preservation, stochastic evolution of quasiprobabilities, and preservation of total non-positivity do not coincide. We identify three classes of positivity-preserving unitaries: type I gates, which are exactly the KD-stochastic unitaries; type II gates, which are non-stochastic yet preserve total non-positivity by permuting and conjugating KD entries; and, for Fourier-conjugate bases in dimension $d=pq$, type III gates, which preserve KD positivity but can change the total non-positivity of non-real distributions. The classification is complete for Haar-random bases and for Fourier-conjugate dimensions $d=p^k$ and $d=pq$, with $p, q$ distinct primes. Adapting the sampling algorithm of Pashayan et al. [PRL 115, 070501], we simulate all of these positivity-preserving circuits efficiently on KD-positive inputs; type III gates, however, create a sharp distinction between real inputs, which remain efficiently simulable, and non-real inputs, whose sampling overhead can grow exponentially. Consequently, for $d=pq$ no resource theory can both treat the KD total non-positivity as a monotone and admit every efficiently simulable positivity-preserving unitary as a free operation.

quant-ph↗

Lossless Reductions and Hybrid Sampling for Phylogeny Using the Maximum Compatibility Criterion

Maximum compatibility provides a criterion for phylogenetic reconstruction in which the objective is to retain a maximum set of mutually compatible characters. For binary characters, pairwise compatibility can be represented by a weighted graph whose vertices correspond to characters and whose edges connect compatible pairs. A leading algorithm by Cherry [BMC Bioinformatics, 18(1):127, 2017] uses this representation to identify maximum compatible character sets as maximum weight cliques. We formulate the problem as maximum weight independent set enumeration on the complement graph and use deterministic postprocessing to map sampled bit strings to maximal feasible solutions. To explore the prospects of quantum computational advantage, we further construct bespoke correction-in-the-loop Quantum Approximate Optimisation Algorithm instances and find that traditional Lagrange multiplier choices may not be optimal for the enumeration problem on noisy devices. We also introduce lossless graph reductions with reconstruction rules that preserve the complete set of optimal solutions. Our results indicate that graph reduction and sampling can be effectively combined to address the enumeration bottleneck in maximum compatibility phylogeny, while retaining exact reconstruction when the residual optimum set is completely resolved. We enhance Cherry's approach to maximum compatibility by introducing graph reduction techniques and quantum sampling. Our classical benchmarks show a clear difference between finding one optimum and recovering the optimum set in practice. We demonstrate the utility of our methods on graphs constructed from SARS-CoV-2 sequences.

quant-ph↗

The Power of Power-of-SWAP: Postselected Quantum Computation with the Exchange Interaction

We introduce Exchange Quantum Polynomial Time (XQP) circuits, which comprise quantum computation using only computational basis SPAM and the isotropic Heisenberg exchange interaction. Structurally, this restricted model captures decoherence-free subspace computation without access to singlet states. We prove that XQP, as well as its constrained family consisting solely of $\sqrt{\mathrm{SWAP}}$ gates, is universal for quantum computation under polynomial overheads in circuit depth and size. This establishes the universality of the $\sqrt{\mathrm{SWAP}}$ gate on its own under a logical encoding of qubits. We further prove that circuits generated by $\sqrt{\mathrm{SWAP}}$ gates are semi-universal, and thus generate $t$-designs for the uniform distribution over SU(2)-invariant unitaries. Finally, we study additional properties of the XQP model, including its relation to the six-vertex and Potts model in statistical physics. Our findings suggest that XQP circuits are naturally suited to near-term hardware and provide a simple platform for experimental demonstrations of quantum advantage.

quant-ph↗

Exponential de Finetti Theorems for Fermionic Gaussian States

We prove an exponential variant of the Gaussian de Finetti theorem: the subsystems of permutation-invariant, free-fermionic Gaussian states are well approximated by convex combinations of almost-i.i.d. states that are Gaussian on subsets of their parts. Our result provides an error bound between the original state and its approximants that decays exponentially in the number of unconstrained parts, becoming super-exponential when the subsystem under consideration is small. The dependence of our bound on the local Hilbert space dimension is polylogarithmic, giving an exponential improvement over the standard de Finetti theorem of [Nat. Phys. 3, 645-649]. Previous works considered Gaussian-symmetric states, which are supported on the trivial irrep of the tensor matchgate representation. We extend these results to the broader class of Gaussian-invariant states, which contains, for example, i.i.d. copies of single-replica mixed Gaussian states. We show that Gaussian-invariant states are precisely the partial traces of Gaussian-symmetric states on locally enlarged replicas and always admit a purification into a larger Gaussian-symmetric state. As an application, we derive explicit convergence bounds for a hierarchy of convex relaxations of polynomial optimisation over fermionic Gaussian states. For variational energy minimisation, the hierarchy gives lower bounds converging to the global Gaussian minimum. Combined with upper bounds from Gaussian trial states, these bounds quantify how far a variational calculation can be from the best energy attainable within the Gaussian family.

quant-ph↗

Two-body control of noiseless subsystems with mixed $SU(3)$ representations lifts teleportation above the classical fidelity limit

Collective noise can leave degrees of freedom unaffected, allowing them to store quantum information. Processing this information also requires physically available logical gates. We consider $r$ fundamental qutrits transforming under $U\in SU(3)$ and $s$ dual qutrits transforming under its complex conjugate $\overline U$, with collective action $R_{r,s}(U)=U^{\otimes r}\otimes\overline U^{\otimes s}$. Using the image of the walled Brauer algebra and Lie-algebra arguments, we show that adjacent exchanges within each qutrit type and one singlet-projector interaction between the two types generate any independently chosen family of special unitary gates on the noiseless subsystems by a finite pulse sequence, for every $r,s\geq1$. This establishes semi-universality of this system. We illustrate the result with a numerically optimised sequence of 24 pulses for three fundamental qutrits and one dual qutrit. We then use the encoding and available logical corrections for qutrit teleportation under correlated Weyl noise. Under explicit assumptions on channel composition and which trials are retained, and allowing for baseline implementation errors, we identify noise ranges in which encoded teleportation exceeds the classical fidelity bound of $1/2$, while the unencoded teleportation channel is entanglement breaking. We analyse fidelity on accepted trials separately from the transmission costs of the additional physical qutrits.

quant-ph↗

Complex Quantum Dynamics Versus Classical Simulability of Noisy Random Circuits

Claims of quantum advantage rest on the classical hardness of simulating quantum circuits. Magic, operator scrambling, anticoncentration, and non-Gaussianity for fermionic circuits are standard diagnostics of complex quantum dynamics. For pure states, some of these have been rigorously connected to classical simulability. Whether these diagnostics reliably track the limits of efficient classical simulation under noise remains unclear. Here, we show that in noisy Clifford+$T$ and nearest-neighbour matchgate+SWAP circuits, dynamical diagnostics and classical simulability can separate in both directions. In particular, the diagnostics can remain nontrivial after classical simulation becomes efficient, or become trivial before known efficient classical algorithms apply. We trace this mismatch to the different statistical properties they probe: magic and scrambling depend on fourth-order statistics of the Pauli spectrum, whereas the simulation algorithms depend primarily on second-order moments, which local noise suppresses at different rates. Thus, dynamical diagnostics measured on a noisy quantum device do not by themselves constitute evidence for classical hardness.

quant-ph↗

Fast Cliffords When Your Quantum Memory Is Full

Additional qubits can reduce the depth of a quantum circuit by providing workspace for parallel computation, but standard constructions assume that this workspace is initialized in a known state. In this work we study catalytic implementations, i.e. asking whether dirty qubits can instead be used provided that their joint state including any entanglement with other registers is restored exactly at the end of the computation. We show that every $n$-qubit Clifford circuit has a catalytic implementation of depth $O(\log n)$ using $O(n^2/\log^2 n)$ catalytic qubits and no clean qubits, matching the asymptotic depth achievable when clean workspace is available. We extend this approach to diagonal elements of any fixed level $C_k$ of the Clifford hierarchy, which admit catalytic implementations of depth $O(\log(n+1))$ with $O(n^k/\log(n))$ gates and $O(n^k/\log^2(n))$ catalytic qubits, as well as to semi-Clifford Gates.

quant-ph↗

The power of constant-depth quantum circuits of unbounded size

Classical circuits with unbounded fan-in can compute any Boolean function in constant depth when their size is unrestricted. We ask whether removing the restrictions on circuit size and ancillary qubits also allows quantum circuits built from arbitrary single-qubit gates and generalised Toffoli gates to implement every unitary in constant depth. We give exact constant-depth constructions for arbitrary permutations of computational basis states, diagonal unitaries and the preparation of arbitrary pure states. These connect quantum state preparation to reversible classical computation and the preparation of probability distributions. With fanout in the gate set, they use exponentially many gates and ancillary qubits and return all ancillary qubits to zero. Replacing fanout by an exact circuit over the original gate set preserves constant depth, although the size bounds can become doubly exponential. The implementation of arbitrary unitaries in constant depth remains open. We give equivalent formulations in terms of copying the vectors of a specified orthonormal basis, extracting their labels and implementing restricted families of unitaries. We also reduce arbitrary unitary implementation to that of traceless unitary involutions using one additional clean qubit. With adaptive measurements, gate teleportation gives depth proportional to the level of a gate in the Clifford hierarchy. Towards arbitrary unitary implementation in constant depth, we use port-based teleportation: for input dimension $d$ and $M\geq d^2-1$ ports, we construct a unitary circuit of depth $O(\sqrt d)$, independent of $M$ and including resource preparation and port selection, with entanglement fidelity at least $(1-(d^2-1)/(2M))^2$. Thus, at fixed $d$, the approximation can be made arbitrarily accurate without increasing depth. Whether the dependence on $d$ can also be removed remains open.

quant-ph↗

Average-case hardness of Betti number estimation

We establish the average-case hardness of Betti number estimation on random clique complexes via a reduction from the planted clique problem. We further show that our reduction implies a series of hardness results for many problems in both classical and quantum Topological Data Analysis (qTDA). Under the classical planted clique conjecture, no randomized polynomial-time Betti number estimator achieves additive error below $\tfrac12$ with constant advantage. Under a new quantum planted clique conjecture that we introduce, the same conclusion holds for quantum polynomial-time algorithms. We also obtain related conditional hardness results for homology vanishing, additive approximations with larger error tolerances, preparation of simplex and harmonic states, cycle recovery, and counting eigenvalues at low energy. Our reduction clarifies the structural requirements for quantum advantage in TDA and provides a new lens to investigate the classical and quantum complexity of related problems.

quant-ph↗

Parameterised graph theory for tensor networks: entanglement rerouting, structural simplification, and agnostic tomography

Parameterised graph theory studies how the complexity of graph-theoretic problems depends on structural parameters of the input graph. This perspective has proved useful in analysing tensor-network simulation (Markov and Shi, 2008). Its implications for tensor-network representations and tomography are less well understood. In particular, which graph parameters determine whether a tensor-network state (TNS) admits a tractable matrix product state (MPS) or tree tensor network (TTN) representation, and which control the complexity of learning the state? We address these questions using parameterised graph theory. First, we show that cutwidth and tree-cutwidth bound the bond dimension overhead required to represent a TNS as an MPS or TTN. In the TTN case, tree-cutwidth also bounds the local dimension of the grouped subsystems. The proofs are based on entanglement rerouting, a tensor-network analogue of rerouting information in a classical network. Second, we derive graph-dependent upper bounds on the sample and computational complexity of realisable TNS tomography, with exponents that depend on cutwidth, tree-cutwidth, and a new graph parameter, learning complexity, which we bound in terms of degree and treewidth. We obtain these results by extending the disentangling MPS learner of (Cramer et al., 2010), as analysed further in (Bakshi et al., 2025; Lin et al., 2025), to TTNs and to tensor networks on arbitrary known graphs. Finally, we extend the framework beyond the realisable setting. For an arbitrary input state, our agnostic learner outputs a pure state whose fidelity is within additive error $ε$ of the optimum over tensor-network states on the given graph with a given bond dimension, with explicit graph-dependent bounds on sample and computational complexity.

quant-ph↗

A Lightweight Protocol for Matchgate Fidelity Estimation

We present a low-depth randomised protocol for estimating the entanglement fidelity between an $n$-qubit matchgate circuit $\mathcal{U}$ and its noisy implementation $\mathcal{E}$. Our method uses a Pauli-Liouville representation adapted to Clifford algebra elements, in which matchgate superoperators acquire a block-diagonal form. This structure enables efficient direct fidelity estimation using only Pauli state preparation and measurement, while avoiding the exponentially costly sampling step required for generic unitary channels. Compared with the protocol of Flammia and Liu [PRL 106, 230501], our algorithm gives an exponential improvement in classical sampling complexity and a multiplicative $1/\sqrt{n}$ reduction in expected shot count for matchgate circuits. The protocol also extends, without asymptotic overhead, to matchgate circuits sandwiched between Clifford circuits. For nearest-neighbour $XY(θ)$ gates and Givens rotations we demonstrate an increase in superoperator sparsity, giving an additional $1/\sqrt{n}$ reduction in expected shot count and, to our knowledge, the first scalable fidelity estimation protocol for these important matchgate subgroups.

quant-ph↗

Flexible Catalysis

In quantum information and computation, a central challenge is to determine which quantum states can be transformed into which others under restricted sets of free operations. While many transformations are impossible directly, catalytic processes can enable otherwise forbidden conversions: an auxiliary quantum state (the catalyst) facilitates the transformation while remaining unchanged. In this work, we introduce flexible catalysis, a generalization in which the catalyst is allowed to transform into a different auxiliary state, provided it remains a valid catalyst. We show that this framework subsumes both standard catalytic and multicopy transformations, and we analyse its advantages across several classes of free operations. In particular, we prove that when the free operations are local unitaries or permutation matrices, flexible catalysis enables state extractions that are unattainable with standard catalysis alone.

quant-ph↗

Scalable Quantum State Preparation for Encoding Genomic Data with Matrix Product States

As quantum computing hardware advances, the need for algorithms that facilitate the loading of classical data into the quantum states of these devices has become increasingly important. This study presents a method for producing scalable quantum circuits to encode genomic data using the Matrix Product State (MPS) formalism. The method is illustrated by encoding the genome of the bacteriophage $ΦX174$ into a 15-qubit state, and analysing the trade-offs between MPS bond dimension, reconstruction error, and the resulting circuit complexity. This study proposes methods for optimising encoding circuits with standard benchmark datasets for the emerging field of quantum bioinformatics. The results for circuit generation and simulation on HPC and on current quantum hardware demonstrate the viability and utility of the encoding.

quant-ph↗

Nonvariational quantum optimisation approaches to pangenome-guided sequence assembly

Assembling genomes from short-read sequencing data remains difficult in repetitive regions, where reference bias and combinatorial complexity limit existing methods. Pangenome-guided sequence assembly (PGSA) mitigates reference bias by reconstructing an individual genome as a walk through a population-level graph. The associated problem, identifying a walk whose node visits match read-derived copy numbers, is NP-hard and already challenges classical solvers at a moderate scale. We develop near-term quantum optimisation approaches for this computational bottleneck. We consider two problem encodings: an established quadratic unconstrained binary optimisation and a new higher-order binary optimisation (HUBO) formulation. The latter reduces the number of variables from $O(N^2)$ to $O(N\log N)$ and places moderate-sized instances within the qubit budget of current devices. We solve both using the Iterative-QAOA framework, which combines a fixed linear-ramp QAOA schedule with iterative warm-start bias updates, avoiding the overhead of full variational parameter optimisation. A custom circuit compilation strategy reduces hardware gate overhead by up to 67\% compared with standard tools. In noiseless simulations of QUBO problems, Iterative-QAOA reliably identifies optimal assemblies from as few as $10^{-17}\%$ of all candidate solutions, and \textit{IBM} quantum hardware closely reproduces relevant results with sufficient sampling via CVaR-style post-selection. For HUBO, the variable reduction comes at the cost of deeper compiled circuits and greater noise sensitivity: an expected qubit--depth trade-off. Our findings establish pangenome assembly as a concrete, biologically motivated problem class at the scale where quantum optimisation may first provide practical value.

quant-ph↗

RotorMap and Quantum Fingerprints of DNA Sequences via Rotary Position Embeddings

For strings of letters from a small alphabet, such as DNA sequences, we present a quantum encoding that empirically provides a strong correlation between the Levenshtein edit distance and the fidelity between quantum states defined by the encodings. It is based on the principles of Rotary Position Embeddings (RoPE), employed in modern large language models. Classically, this encoding yields RotorMap - a GPU-accelerated DNA mapping algorithm that achieves speedups of 50-700x over single-thread Minimap2 in proof-of-concept tests on human and maize genomes. For use on quantum devices, we introduce the Angular encoding, which is built from RoPE and directly outputs state preparation circuits. To verify its properties and utility on NISQ devices, we report results of experiments conducted on quantum computers from Quantinuum: the 56-qubit H2-1, H2-2 and the latest 98-qubit Helios-1. As a potential application, we consider a quantum DNA authentication problem and conjecture that a quantum advantage in one-way communication complexity could be achieved over any comparable classical solution.

quant-ph↗

Optimal fermion-qubit mappings via quadratic assignment

Simulation of fermionic systems is one of the most promising applications of quantum computers. It spans problems in quantum chemistry, high-energy physics and condensed matter. Underpinning the core steps of any quantum simulation algorithm, fermion-qubit mappings translate the fermionic interactions to the operators and states of quantum computers. This translation is highly non-trivial: a burgeoning supply of fermion-qubit mappings has arisen over the past twenty years to address the limited resources of early quantum technology. Previous literature has presented a dichotomy between ancilla-free fermion-qubit mappings, which minimise qubit count, and local encodings, which minimise gate complexity. We present two computational approaches to the construction of general mappings while working with a limited number of qubits, striking a balance between the low-qubit and low-gate demands of present quantum technology. The first method frames the order of fermionic labels as an instance of the quadratic assignment problem to minimize the total and maximum Pauli weights in a problem Hamiltonian. We compare the order-optimized performance of several common ancilla-free mappings on systems of size up to 225 fermionic modes. The second method is a computational approach to incrementally add ancilla qubits to Jordan--Wigner transformations and further reduce the Pauli weights. By adding up to 10 ancilla qubits, we were able to reduce the total Pauli weight by as much as 67% in Jordan--Wigner transformations of fermionic systems with up to 64 modes, outperforming the previous state-of-the-art ancilla-free mappings. Reproducibility: source code and data are available at https://github.com/cameton/QCE_QubitAssignment

quant-ph↗

Pangenome-guided sequence assembly via binary optimisation

De novo genome assembly is challenging in highly repetitive regions; however, reference-guided assemblers often suffer from bias. We propose a framework for pangenome-guided sequence assembly, which can resolve short-read data in complex regions without bias towards a single reference genome. Our primary contribution is to frame the assembly as a graph traversal optimisation problem, which can be implemented classically or on a quantum computer. The workflow involves first annotating pangenome graphs with estimated copy numbers for each node, then finding a path on the graph that best explains those copy numbers. On simulated data, our approach significantly reduces the number of contigs compared to de novo assemblers. While they introduce a small increase in inaccuracies, such as false joins, our optimisation-based methods are competitive with current exhaustive search techniques. They are also designed to scale more efficiently as the problem size grows and will run effectively on future quantum computers; a small experiment on a real quantum device showcases this behaviour. Moreover, they are more resilient to noise in copy number estimation inherent in short-read-based assembly. We also develop novel tools for creating realistic synthetic pangenomes, aligning reads to pangenomes and for evaluating assembly quality.

quant-ph↗