BPBO performs certified local resynthesis on one- to three-wire regions of BFK09 brickwork to reduce pattern size while preserving UBQC blindness, demonstrated on Grover and Toffoli cases with reductions up to 3x725 to 3x98.
hub
A fast quantum mechanical algorithm for database search
15 Pith papers cite this work. Polarity classification is still indexing.
15
Pith papers citing it
abstract
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a 50% probability, any classical algorithm (whether deterministic or probabilistic) will need to look at a minimum of N/2 names. Quantum mechanical systems can be in a superposition of states and simultaneously examine multiple names. By properly adjusting the phases of various operations, successful computations reinforce each other while others interfere randomly. As a result, the desired phone number can be obtained in only O(sqrt(N)) steps. The algorithm is within a small constant factor of the fastest possible quantum mechanical algorithm.
hub tools
citation-role summary
background 2
citation-polarity summary
roles
background 2polarities
background 2representative citing papers
A one-ancilla framework for QSAMPLE preparation via GQSP-based selective phase compilation embedded in fixed-point amplitude amplification, improving overlap dependence to inverse square-root minimum overlap.
A gadget-based simulator directly simulates high-level quantum gates via low-rank stabilizer decompositions of magic states, improving both theoretical complexity and practical runtime over standard compilation-based methods.
The paper gives a QLSS with query complexity (1+O(ε))κ ln(2√2/ε) using one kernel reflection when ||x|| is known, or O(κ log(1/ε)) overall, with explicit bound 56κ + 1.05κ ln(1/ε).
Exhaustively parametrised feasibility-respecting quantum circuits can reach every feasible solution to problems like TSP with certainty using fixed parameters by leveraging group actions and generating sequences.
A quantum machine learning surrogate based on parameterized circuits with data re-uploading approximates the full BGK collision dynamics in LBM across all admissible relaxation parameters and is validated on Taylor-Green vortex and double shear layer benchmarks.
Characterizes qubit magic states via relative entropy of entanglement results and proves nonadditivity of relative entropy of magic for multi-qubit tensor products.
Benchmarks gradient-ascent algorithms for constrained free energy minimization on quantum Heisenberg models and stabilizer codes, with applications to thermal state design and fixed-temperature quantum encoding.
Proposes a quantum-walker qRAM on a single binary tree using local operations that reduces resources while preserving optimal query complexity.
A witness-based framework quantifies continuous-variable resources and activates them into discrete-variable entanglement or EPR steering via measure-and-prepare channels that produce Werner states.
Numerical simulations indicate isotropic errors degrade Grover's algorithm performance and success probability on noisy quantum hardware.
Post-quantum certificate chains cause discrete jumps in TTFB once they exceed transport flight limits, with Merkle Tree Certificates supporting 2-3x larger chains than current CDN optimizations.
The abstract and full text of arXiv:2605.12675 describe different papers; the abstract's partition-query classification is absent from the v3 text, which is a clarificatory essay with a correct but routine which-path-interference appendix.
Tensor network algorithms provide exact optimal task assignments on machines under directed constraints, with preprocessing and iterative improvements to reduce complexity.
A review describing the Decoded Quantum Interferometry algorithm for quantum speedups in max-LINSAT optimization, with claimed superpolynomial advantage in the OPI problem.
citing papers explorer
-
BPBO: Blindness-Preserving Brickwork Optimization by Certified Region Resynthesis
BPBO performs certified local resynthesis on one- to three-wire regions of BFK09 brickwork to reduce pattern size while preserving UBQC blindness, demonstrated on Grover and Toffoli cases with reductions up to 3x725 to 3x98.
-
Ancilla-Efficient QSAMPLE Preparation for Reversible Markov Chains
A one-ancilla framework for QSAMPLE preparation via GQSP-based selective phase compilation embedded in fixed-point amplitude amplification, improving overlap dependence to inverse square-root minimum overlap.
-
Efficient Simulation of High-Level Quantum Gates
A gadget-based simulator directly simulates high-level quantum gates via low-rank stabilizer decompositions of magic states, improving both theoretical complexity and practical runtime over standard compilation-based methods.
-
A shortcut to an optimal quantum linear system solver
The paper gives a QLSS with query complexity (1+O(ε))κ ln(2√2/ε) using one kernel reflection when ||x|| is known, or O(κ log(1/ε)) overall, with explicit bound 56κ + 1.05κ ln(1/ε).
-
Exhaustive and feasible parametrisation with applications to the travelling salesperson problem
Exhaustively parametrised feasibility-respecting quantum circuits can reach every feasible solution to problems like TSP with certainty using fixed parameters by leveraging group actions and generating sequences.
-
A Quantum-Classical Surrogate Model for the Collision Operator of the Lattice Boltzmann Method
A quantum machine learning surrogate based on parameterized circuits with data re-uploading approximates the full BGK collision dynamics in LBM across all admissible relaxation parameters and is validated on Taylor-Green vortex and double shear layer 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.
-
Constrained free energy minimization for the design of thermal states and stabilizer thermodynamic systems
Benchmarks gradient-ascent algorithms for constrained free energy minimization on quantum Heisenberg models and stabilizer codes, with applications to thermal state design and fixed-temperature quantum encoding.
-
A resource-efficient quantum-walker Quantum RAM
Proposes a quantum-walker qRAM on a single binary tree using local operations that reduces resources while preserving optimal query complexity.
-
Activating entanglement and EPR steering from continuous-variable resources using witness-based measures
A witness-based framework quantifies continuous-variable resources and activates them into discrete-variable entanglement or EPR steering via measure-and-prepare channels that produce Werner states.
-
Effect of isotropic errors on the complexity of Grover's algorithm
Numerical simulations indicate isotropic errors degrade Grover's algorithm performance and success probability on noisy quantum hardware.
-
Network Impact of Post-Quantum Certificate Chain sizes on Time to First Byte in TLS Deployments
Post-quantum certificate chains cause discrete jumps in TTFB once they exceed transport flight limits, with Merkle Tree Certificates supporting 2-3x larger chains than current CDN optimizations.
-
Answer Partitions and Oracle Access Determine Quantum Query Complexity
The abstract and full text of arXiv:2605.12675 describe different papers; the abstract's partition-query classification is absent from the v3 text, which is a clarificatory essay with a correct but routine which-path-interference appendix.
-
Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective
Tensor network algorithms provide exact optimal task assignments on machines under directed constraints, with preprocessing and iterative improvements to reduce complexity.
-
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.