Nonlocal magic in fermionic Gaussian states is bounded by the entanglement spectrum of the covariance matrix, is extensive in the Haar ensemble, peaks at criticality in the Kitaev chain, and grows diffusively under random circuits.
Canonical reference
Shor (1997): Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Canonical reference. 88% of citing Pith papers cite this work as background.
26
Pith papers citing it
5,521
external citations · Crossref
Background
88% of classified citations
citation-role summary
background 7
method 1
citation-polarity summary
representative citing papers
Rigorous security proofs for variable-length QKD, phase-error bounding with imperfect detectors, marginal-constrained entropy accumulation, and authentication reductions place practical QKD on firmer mathematical ground.
Quantum PINNs using tensor-rank polynomials solve the Merton portfolio optimization PDE more accurately and with far fewer parameters than classical neural networks.
Bivariate bicycle codes enable a modular architecture that supports an order of magnitude more logical circuit volume per physical qubit than surface-code designs under circuit noise.
A closed-form resource estimation tool for concatenated quantum error correction reveals that magic-state operations rarely dominate qubit costs, with general optimizations providing orders-of-magnitude larger reductions than magic-specific ones.
Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.
Characterizes qubit magic states via relative entropy of entanglement results and proves nonadditivity of relative entropy of magic for multi-qubit tensor products.
Stabilizer redundancy from error-correcting codes reduces the choice of physical operators for a logical target to a least-squares problem with closed-form solution, allowing native hardware Hamiltonians to replace costly swaps.
Meta-learning with 24 classical complexity metrics predicts the optimal quantum encoding circuit among 9 candidates with up to 85.7% top-3 accuracy.
GreenPeas delivers a just-in-time GPU compiler for decoding hypergraphs that achieves >10x speedup on surface and bivariate bicycle codes, unlocking circuit-level decoding for adaptive quantum error correction.
Fault-tolerant Iceberg code on trapped-ion hardware achieves beyond-break-even error detection for Toffoli and Bell circuits by filtering errors, yielding higher fidelity than unencoded versions.
Presents an exact tensor-network equation and optimized algorithm for integer factorization by tensorizing a multiplication circuit and contracting it to match a target composite number.
Model-checking stateless quantum pushdown systems against PCTL is undecidable while against bPCTL it is decidable and NP-hard.
Empirical study of real NISQ order-finding data identifies dominant verified mass fraction as the strongest predictor of whether standard post-processing recovers the true order.
A quantum anonymous secret sharing scheme is constructed using permutation-invariant codes, with leakage in ramp schemes quantified by quantum conditional min-entropy related to Knill-Laflamme conditions.
A hybrid quantum-safe IPsec architecture using SDN for mixing classical, QKD, and PQC keys has been implemented and validated on a heterogeneous five-node testbed with physical and cloud nodes.
A hardware-calibrated truncated QFT reduces gate count 31-44% at 30 qubits while bounding total variation distance error by O(2^{-d}) and outperforming full QFT under moderate noise.
TUSQ reduces redundant work in noisy quantum simulations via error tallying, commutation, importance sampling, and depth-first tree traversal with compute/uncompute reuse, reporting large speedups over Qiskit, CUDA-Q, and TQSim on 198 benchmarks.
A distributed (6.6.6) color code is realized by interconnecting patches via entangled pairs, with simulations showing the concatenated MWPM decoder maintains error threshold under asymmetric seam noise while tensor-network decoder shows slight reduction.
A Grover-search-based quantum model for CVRPTW that encodes constraints with only linear additional decision qubits relative to TSP formulations.
A layered framework is defined to interpret post-quantum cryptographic security assumptions through complexity models, combinatorial Hodge theory on lattices, and Julia-based lattice reduction experiments.
Fermion mappings combined with Z2 tapering and frozen-core approximations reduce qubit counts by up to 50%, gate counts by up to 27.5x, and Pauli strings by up to 2.75x for VQE on small molecules.
XGBoost models trained on ≤16-qubit data predict eigensolver hyperparameters and reduce error by 0.12% on 28-qubit systems.
A review of how quantum information science is expected to provide new tools and insights for nuclear and high-energy physics phenomenology and quantum simulations.
citing papers explorer
-
Nonlocal nonstabilizerness in free fermion models
Nonlocal magic in fermionic Gaussian states is bounded by the entanglement spectrum of the covariance matrix, is extensive in the Haar ensemble, peaks at criticality in the Kitaev chain, and grows diffusively under random circuits.
-
Rigorous Security Proofs for Practical Quantum Key Distribution
Rigorous security proofs for variable-length QKD, phase-error bounding with imperfect detectors, marginal-constrained entropy accumulation, and authentication reductions place practical QKD on firmer mathematical ground.
-
Learning PDEs for Portfolio Optimization with Quantum Physics-Informed Neural Networks
Quantum PINNs using tensor-rank polynomials solve the Merton portfolio optimization PDE more accurately and with far fewer parameters than classical neural networks.
-
Tour de gross: A modular quantum computer based on bivariate bicycle codes
Bivariate bicycle codes enable a modular architecture that supports an order of magnitude more logical circuit volume per physical qubit than surface-code designs under circuit noise.
-
Magic states are rarely the best resource to optimize: An analytical tool for qubit resource estimation in concatenated codes
A closed-form resource estimation tool for concatenated quantum error correction reveals that magic-state operations rarely dominate qubit costs, with general optimizations providing orders-of-magnitude larger reductions than magic-specific ones.
-
High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.
-
The relative entropy of magic and its nonadditivity
Characterizes qubit magic states via relative entropy of entanglement results and proves nonadditivity of relative entropy of magic for multi-qubit tensor products.
-
Stabilizers for Compiling Logical Circuits under Hardware Constraints
Stabilizer redundancy from error-correcting codes reduces the choice of physical operators for a logical target to a least-squares problem with closed-form solution, allowing native hardware Hamiltonians to replace costly swaps.
-
Towards Automated Selection of Quantum Encoding Circuits via Meta-Learning
Meta-learning with 24 classical complexity metrics predicts the optimal quantum encoding circuit among 9 candidates with up to 85.7% top-3 accuracy.
-
GreenPeas: Unlocking Adaptive Quantum Error Correction with Just-in-Time Decoding Hypergraphs
GreenPeas delivers a just-in-time GPU compiler for decoding hypergraphs that achieves >10x speedup on surface and bivariate bicycle codes, unlocking circuit-level decoding for adaptive quantum error correction.
-
Fault-Tolerant Error Detection Above Break-Even for Multi-Qubit Gates
Fault-tolerant Iceberg code on trapped-ion hardware achieves beyond-break-even error detection for Toffoli and Bell circuits by filtering errors, yielding higher fidelity than unencoded versions.
-
Prime Factorization Equation from a Tensor Network Perspective
Presents an exact tensor-network equation and optimized algorithm for integer factorization by tensorizing a multiplication circuit and contracting it to match a target composite number.
-
Computational Complexity of Model-Checking Quantum Pushdown Systems
Model-checking stateless quantum pushdown systems against PCTL is undecidable while against bPCTL it is decidable and NP-hard.
-
When Noisy Quantum Order Finding Remains Recoverable for Shor's Algorithm
Empirical study of real NISQ order-finding data identifies dominant verified mass fraction as the strongest predictor of whether standard post-processing recovers the true order.
-
Quantum Anonymous Secret Sharing with Permutation Invariant Codes
A quantum anonymous secret sharing scheme is constructed using permutation-invariant codes, with leakage in ramp schemes quantified by quantum conditional min-entropy related to Knill-Laflamme conditions.
-
Quantum-safe IPsec in the banking industry
A hybrid quantum-safe IPsec architecture using SDN for mixing classical, QKD, and PQC keys has been implemented and validated on a heterogeneous five-node testbed with physical and cloud nodes.
-
Phase-Fidelity-Aware Truncated Quantum Fourier Transform for Scalable Phase Estimation on NISQ Hardware
A hardware-calibrated truncated QFT reduces gate count 31-44% at 30 qubits while bounding total variation distance error by O(2^{-d}) and outperforming full QFT under moderate noise.
-
Noisy Quantum Simulation Using Tracking, Uncomputation and Sampling
TUSQ reduces redundant work in noisy quantum simulations via error tallying, commutation, importance sampling, and depth-first tree traversal with compute/uncompute reuse, reporting large speedups over Qiskit, CUDA-Q, and TQSim on 198 benchmarks.
-
Distributed Realization of Color Codes for Quantum Error Correction
A distributed (6.6.6) color code is realized by interconnecting patches via entangled pairs, with simulations showing the concatenated MWPM decoder maintains error threshold under asymmetric seam noise while tensor-network decoder shows slight reduction.
-
Quantum Model for CVRPTW
A Grover-search-based quantum model for CVRPTW that encodes constraints with only linear additional decision qubits relative to TSP formulations.
-
Explainable PQC: A Layered Interpretive Framework for Post-Quantum Cryptographic Security Assumptions
A layered framework is defined to interpret post-quantum cryptographic security assumptions through complexity models, combinatorial Hodge theory on lattices, and Julia-based lattice reduction experiments.
-
Resource Estimation for VQE on Small Molecules: Impact of Fermion Mappings and Hamiltonian Reductions
Fermion mappings combined with Z2 tapering and frozen-core approximations reduce qubit counts by up to 50%, gate counts by up to 27.5x, and Pauli strings by up to 2.75x for VQE on small molecules.
-
Accelerating Quantum Eigensolver Algorithms With Machine Learning
XGBoost models trained on ≤16-qubit data predict eigensolver hyperparameters and reduce error by 0.12% on 28-qubit systems.
-
Quantum Complexity and New Directions in Nuclear Physics and High-Energy Physics Phenomenology
A review of how quantum information science is expected to provide new tools and insights for nuclear and high-energy physics phenomenology and quantum simulations.
-
Quantum Decoding Algorithms: Quantum Speedups in Optimization
A review describing the Decoded Quantum Interferometry algorithm for quantum speedups in max-LINSAT optimization, with claimed superpolynomial advantage in the OPI problem.
-
Review of Superconducting Qubit Devices and Their Large-Scale Integration
A review summarizing superconducting qubit types, DiVincenzo criteria implementations, coherence limits from defects, and large-scale integration strategies for quantum computing.