Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
From MaRDI portal
Publication:4376179
DOI10.1137/S0097539795293172zbMath1005.11065arXivquant-ph/9508027WikidataQ55869064 ScholiaQ55869064MaRDI QIDQ4376179
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/9508027
Church's thesisFourier transformsquantum computersspin systemsfoundations of quantum mechanicsprime factorizationdiscrete logarithmsalgorithmic number theory
Related Items
Approximation of a quantum algorithm for order finding, Efficient and exact quantum compression, Simulation of a quantum algorithm for phase estimation, Quantum steganography using prior entanglement, Quantum Fourier transform over symmetric groups -- improved result, Quantum period reconstruction of approximate sequences, Sure success partial search, The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries, Entanglement decay versus energy change: a model, The quantum query complexity of the hidden subgroup problem is polynomial, Discrete logarithms for finite groups, Post-quantum cryptography: lattice signatures, Cryptanalysis of RGB, a mixed multivariate signature scheme, Deterministic implementations of single-photon multi-qubit Deutsch-Jozsa algorithms with linear optics, Efficient revocable identity-based encryption with short public parameters, New complexity estimation on the rainbow-band-separation attack, Optimal parallel quantum query algorithms, WOTS-S: a quantum secure compact signature scheme for distributed ledger, A survey of lattice based expressive attribute based encryption, The postprocessing of quantum digital signatures, Quantum image processing?, Cryptanalysis of quantum digital signature for the access control of sensitive data, An improved arbitrated quantum signature protocol based on the key-controlled chained CNOT encryption, Quantum Fourier transform in computational basis, Algebraic generalization of Diffie-Hellman key exchange, Post-quantum online voting scheme, Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle, Quantum and classical query complexities for generalized Simon's problem, Enhanced matrix power function for cryptographic primitive construction, Breaking the decisional Diffie-Hellman problem for class group actions using genus theory: extended version, A modeling and verification framework for optical quantum circuits, Quantum perceptron over a field and neural network architecture selection in a quantum computer, Authenticated semi-quantum key distribution without entanglement, Quantum designated verifier signature based on Bell states, Emulation of high-performance correlation-based quantum clustering algorithm for two-dimensional data on FPGA, A weak limit theorem for a class of long-range-type quantum walks in 1d, Optically controlled quantum gates for three spin qubits in quantum dot-microcavity coupled systems, Multiphoton process in cavity QED photons for implementing a three-qubit quantum gate operation, Quantum digital signature in a network, A general protocol for distributed quantum gates, Complete analysis of Simon's quantum algorithm with additional collisions, Cryptanalysis of multivariate threshold ring signature schemes, Benchmarking the quantum approximate optimization algorithm, Asymptotic security analysis of teleportation-based quantum cryptography, Quantum public-key signature scheme based on asymmetric quantum encryption with trapdoor information, Comments on the ``Efficient quantum multi-proxy signature, Efficient and scalable quantum walk algorithms via the quantum Fourier transform, An efficient quantum identity authentication key agreement protocol without entanglement, Retracted: Invertible matrices over some quotient rings: identification, generation, and analysis, An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary \(t\)-designs, Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm, A normal form for single-qudit Clifford+\(T\) operators, Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem, Entanglement universality of TGX states in qubit-qutrit systems, Benchmarking the performance of portfolio optimization with QAOA, Locally distinguishing multipartite orthogonal product states with different entanglement resource, An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups, Algebraic and quantum attacks on two digital signature schemes, Decision theory with prospect interference and entanglement, Elliptic curve cryptography: the serpentine course of a paradigm shift, Many worlds, the cluster-state quantum computer, and the problem of the preferred basis, Improving the security of arbitrated quantum signature against the forgery attack, Robust preparation of four-qubit decoherence-free states for superconducting quantum interference devices against collective amplitude damping, A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions, On the probability of generating a lattice, Line ordering of reversible circuits for linear nearest neighbor realization, A quantum physical design flow using ILP and graph drawing, The rational approximations of the unitary groups, Security weaknesses in arbitrated quantum signature protocols, Long term confidentiality: a survey, Selecting efficient phase estimation with constant-precision phase shift operators, Quantum circuit physical design methodology with emphasis on physical synthesis, Efficient protocol of \(N\)-bit discrete quantum Fourier transform via transmon qubits coupled to a resonator, Quantum computation in the decoherence-free subspaces with cavity QED, A randomized stochastic optimization algorithm: its estimation accuracy, Quantum certificate complexity, Optimal computation with non-unitary quantum walks, Interval-valued computations and their connection with PSPACE, Quantum and classical complexity classes: Separations, collapses, and closure properties, Quantum factorization algorithm by NMR ensemble computers, Polynomial degree vs. quantum query complexity, Some formal tools for analyzing quantum automata., Weak keys in MST\(_{1}\), On the complexity of searching for a maximum of a function on a quantum computer, On the computational power of molecular heat engines, Graph Isomorphism is in SPP, Church's thesis meets the \(N\)-body problem, On computing ord\(_{N}(2)\) and its application, On the mathematics of quantum computers, Identity-based proxy re-signatures from lattices, A lattice-based signcryption scheme without random oracles, One-dimensional quantum walks subject to next-nearest-neighbour hopping decoherence, Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count, A novel quantum group signature scheme without using entangled states, Determining the equivalence for one-way quantum finite automata, Discrete quantum walks hit exponentially faster, Classical and quantum complexity of the Sturm-Liouville eigenvalue problem, Universal test for quantum one-way permutations, Integers and polynomials: comparing the close cousins \(\mathbb Z\) and \(\mathbb F_q[x\)], On the computational power of probabilistic and quantum branching program, A quantum algorithm using NMR computers to break secret-key cryptosystems, A lower bound on the quantum query complexity of read-once functions, Splitting information securely with entanglement, A new protocol and lower bounds for quantum coin flipping, Quantum signature scheme with weak arbitrator, Some quantum states prepared with polynomial quantum circuit, Multivariate public key cryptosystems from Diophantine equations, Closed-form formula on quantum factorization effectiveness, A useful strong lower bound on two-qubit concurrence, Efficient entanglement channel construction schemes for a theoretical quantum network model with \(d\)-level system, Security of ping-pong protocol based on pairs of completely entangled qudits, QCWAVE - A Mathematica quantum computer simulation update, Quantum speed-up for unsupervised learning, Codes as fractals and noncommutative spaces, Direct implementation of an \(N\)-qubit controlled-unitary gate in a single step, The amplified quantum Fourier transform: solving the local period problem, CSIDH: an efficient post-quantum commutative group action, The elusive source of quantum speedup, Complexity limitations on quantum computation, Space-bounded quantum complexity, Quantum-inspired wolf pack algorithm to solve the 0-1 knapsack problem, Expressing the operations of quantum computing in multiparticle geometric algebra., Quantum algorithm design: techniques and applications, Binding complexity and multiparty entanglement, Interferometric computation beyond quantum theory, Quantum computing as a particular case of computing with tensors, An improved quantum voting scheme, Offline arbitrated quantum blind dual-signature protocol with better performance in resisting existential forgery attack, Implementation of RSA cryptographic algorithm using SN P systems based on HP/LP neurons, Identifying lens spaces in polynomial time, Deterministic MDI QKD with two secret bits per shared entangled pair, Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\), Quantum key-recovery on full AEZ, Pauli group: classification and joint higher rank numerical range, On sets of large Fourier transform under changes in domain, Quantum phase gate based on multiphoton process in multimode cavity QED, A lattice-based group signature scheme with verifier-local revocation, Symmetric blind information reconciliation and hash-function-based verification for quantum key distribution, A simple provably secure AKE from the LWE problem, Simulation of a multidimensional input quantum perceptron, On the role of dealing with quantum coherence in amplitude amplification, The quantum Fourier transform based on quantum vision representation, Shortcuts to adiabatic for implementing controlled-not gate with superconducting quantum interference device qubits, X states of the same spectrum and entanglement as all two-qubit states, Construction of quantum gates for concatenated Greenberger-Horne-Zeilinger-type logic qubit, A multivariate cryptosystem inspired by random linear codes, DAGS: key encapsulation using dyadic GS codes, Quantum walks: a comprehensive review, On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\), Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices, New public-key quantum signature scheme with quantum one-way function, Uniformity of quantum circuit families for error-free algorithms, Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves, Odd orders in Shor's factoring algorithm, Quantum walk with a general coin: exact solution and asymptotic properties, Reducing the number of ancilla qubits and the gate count required for creating large controlled operations, Deterministic generations of quantum state with no more than six qubits, Quantum private information retrieval has linear communication complexity, A quantum computing primer for operator theorists, Quantum branching programs and space-bounded nonuniform quantum complexity, Survey on SAP and its application in public-key cryptography, Remote preparation of general one-, two- and three-qubit states via \(\chi \)-type entangled states, A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions, Ironwood meta key agreement and authentication protocol, Indiscreet logarithms in finite fields of small characteristic, Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key, Breaking tweakable enciphering schemes using Simon's algorithm, An improved signature model of multivariate polynomial public key cryptosystem against key recovery attack, Quantum algorithms for computing general discrete logarithms and orders with tradeoffs, Quantum-access-secure message authentication via blind-unforgeability, Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes, Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem, Group encryption: full dynamicity, message filtering and code-based instantiation, A study on randomness used in signature generation of UOV, A new identity-based multivariate signature scheme, Invertible matrices over some quotient rings: identification, generation, and analysis, Quantum computers and unstructured search: finding and counting items with an arbitrarily entangled initial state, Time complexity analysis of quantum difference methods for linear high dimensional and multiscale partial differential equations, Quantum algorithm for Feynman loop integrals, Qubit authentication, Breaking the decisional Diffie-Hellman problem for class group actions using genus theory, Reordering decision diagrams for quantum computing is harder than you might think, Two-way finite automata with quantum and classical states., Expressiveness of matchgates., Quantum entanglement as a resource to locally distinguish orthogonal product states, On the impossibility of interaction-free quantum sensing for small I/O bandwidth, Almost-everywhere superiority for quantum polynomial time, Quantum entanglement involved in Grover's and Shor's algorithms: the four-qubit case, Controlled SWAP attack and improved quantum encryption of arbitrated quantum signature schemes, Efficient quantum private comparison protocol based on the entanglement swapping between four-qubit cluster state and extended Bell state, Evaluation of exact quantum query complexities by semidefinite programming, Efficient chain-encryption-based quantum signature scheme with semi-trusted arbitrator, Quantum learning of concentrated Boolean functions, A secure cross-chain transaction model based on quantum multi-signature, Cryptanalysis of secure multiparty quantum summation, A new post-quantum voting protocol based on physical laws, Some general probabilistic quantum cloning and deleting machines, New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups, PSPACE has constant-round quantum interactive proof systems, One complexity theorist's view of quantum computing, Global versus local quantum correlations in the Grover search algorithm, Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph, Duality quantum computer and the efficient quantum simulations, Hyper CNOT and hyper Bell-state analysis assisted by quantum dots in double-side optical microcavities, Secure quantum private comparison protocol based on the entanglement swapping between three-particle W-class state and Bell state, A new universal and fault-tolerant quantum basis, Unconditionally secure quantum signatures, Quantum teleportation of high-dimensional atomic momenta state, PEET: a Matlab tool for estimating physical gate errors in quantum information processing systems, Multi-qubit non-adiabatic holonomic controlled quantum gates in decoherence-free subspaces, Quantum broadcasting multiple blind signature with constant size, Study of a monogamous entanglement measure for three-qubit quantum systems, Improvement of a quantum broadcasting multiple blind signature scheme based on quantum teleportation, The number of terms in the superpositions upper bounds the amount of the coherence change, Security analysis of an arbitrated quantum signature scheme with Bell states, Improving quantum query complexity of Boolean matrix multiplication using graph collision, Single qudit realization of the Deutsch algorithm using superconducting many-level quantum circuits, Collapse of the hierarchy of constant-depth exact quantum circuits, A class of quantum low-density parity check codes by combining seed graphs, \(p\)-adic dynamics and angle doubling, Quantum computing without entanglement, The query complexity of order-finding, Quantum mathematics: backgrounds and some applications to nonlinear dynamical systems, Reexamination of arbitrated quantum signature: the impossible and the possible, A multivariate based threshold ring signature scheme, Enhancement non classical properties of a pair of qubit via deformed operators, New features of Wehrl entropy and Wehrl PD of a single Cooper-pair box placed inside a dissipative cavity, QCMPI: A parallel environment for quantum computing, Simulation of quantum key expansion using quantum cellular automata, The power of qutrit logic for quantum computation, Simulation of \(n\)-qubit quantum systems. V: Quantum measurements, Cryptanalysis of the quantum group signature protocols, The 2010 Benjamin Franklin Medal in Physics presented to J. Ignacio Cirac, David J. Wineland and Peter Zoller, Projective interpolation of polynomial vectors and improved key recovery attack on SFLASH, Quantum theory, namely the pure and reversible theory of information, On the relationship between continuous- and discrete-time quantum walk, Extended multivariate public key cryptosystems with secure encryption function, Quantum property testing of group solvability, A public key cryptosystem based on three new provable problems, Disentanglement and decoherence from classical non-Markovian noise: Random telegraph noise, Quantum public-key cryptosystem, On the arithmetic of the endomorphisms ring \(\text{End}(\mathbb Z_p\times\mathbb Z_{p^2})\)., Optimality proofs of quantum weight decision algorithms, On the uselessness of quantum queries, Computational indistinguishability between quantum states and its cryptographic application, A branching space-times view on quantum error correction, Is Hilbert space discrete?, A note on quantum related-key attacks, Cryptanalysis of a batch proxy quantum blind signature scheme, Typical unpreparability of quantum states with quantum circuit model, Bounds of concurrence and their relation with fidelity and frontier states, Quantum Kolmogorov complexity and information-disturbance theorem, Quantum-assisted QD-CFS signatures, Quantum mechanics experiment mimicked by stochastic calculations, Mini-maximizing two qubit quantum computations, Doped carbon nanotubes as quantum memory devices, The quadratic speedup in Grover's search algorithm from the entanglement perspective, \(Qcompiler\): quantum compilation with the CSD method, Circuit QED: implementation of the three-qubit refined Deutsch-Jozsa quantum algorithm, Remote preparation of quantum entangled state in a non-Markovian environment, Security of a sessional blind signature based on quantum cryptograph, Protocols of quantum key agreement solely using Bell states and Bell measurement, The quest for a quantum neural network, SimpleMatrix -- a multivariate public key cryptosystem (MPKC) for encryption, Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling, Maximally entangled states in discrete and Gaussian regimes, A quantum walk-assisted approximate algorithm for bounded NP optimisation problems, A novel protocol for multiparty quantum key management, Quantum private comparison over noisy channels, Minimal logarithmic signatures for the unitary group \(U_n(q)\), Quantum Boolean image denoising, Application of distributed semi-quantum computing model in phase estimation, Solving systems of diagonal polynomial equations over finite fields, Promise problems solved by quantum and classical finite automata, Improved quantum query algorithms for triangle detection and associativity testing, Two-photon phase gate with linear optical elements and atom-cavity system, Analogue algorithm for parallel factorization of an exponential number of large integers. II: Optical implementation, Analogue algorithm for parallel factorization of an exponential number of large integers. I: Theoretical description, Quantum public key cryptosystem based on Bell states, A quantum multi-proxy weak blind signature scheme based on entanglement swapping, Robust quantum private queries, Quantum revivals of a non-Rabi type in a Jaynes-Cummings model, \textit{OptQC}: an optimized parallel quantum compiler, Entanglement universality of two-qubit X-states, From doubled Chern-Simons-Maxwell lattice gauge theory to extensions of the toric code, The vectorial \(\lambda\)-calculus, Environment assisted energy transfer in dimer system, Solving the generalized subset sum problem with a light based device, Generating shorter bases for hard random lattices, Two-tape finite automata with quantum and classical states, Quantum information processing: The case of vanishing interaction energy, Fundamentals of quantum information theory, On the power of Ambainis lower bounds, An algorithm for simulating the Ising model on a type-II quantum computer, Simulation of \(n\)-qubit quantum systems. I: Quantum registers and quantum gates, QDENSITY -- a Mathematica quantum computer simulation, Simulation of \(n\)-qubit quantum systems. III. Quantum operations, Quantum computation and quantum information, Quantum commitments from complexity assumptions, A search for quantum coin-flipping protocols using optimization techniques, Minimal logarithmic signatures for one type of classical groups, A quantum proxy blind signature scheme based on genuine five-qubit entangled state, Entanglement in (1/2,1) mixed-spin XY model with long-range interaction, (Short paper) Simple matrix signature scheme, Quality of control in the Tavis-Cummings-Hubbard model, The quantum query complexity of the abelian hidden subgroup problem, A novel version of the hidden logarithm problem for post-quantum signature algorithms, Book review of: F. Bassino et al., Complexity and randomness in group theory. GAGTA book 1, On using RSA/ECC coprocessor for ideal lattice-based key exchange, Full key recovery side-channel attack against ephemeral SIKE on the cortex-M4, A quantum aggregate signature scheme based on quantum teleportation using four-qubit cluster state, Security analysis on an ElGamal-like multivariate encryption scheme based on isomorphism of polynomials, Lattice-based IBE with equality test supporting flexible authorization in the standard model, Pholkos -- efficient large-state tweakable block ciphers from the AES round function, Quantum \((t,n)\) threshold proxy blind signature scheme based on Bell states, Ciphertext-only attacks against compact-LWE submitted to NIST PQC project, The polynomial learning with errors problem and the smearing condition, Orientations and the supersingular endomorphism ring problem, Practical post-quantum signature schemes from isomorphism problems of trilinear forms, Quantum attacks on some Feistel block ciphers, Data science applications to string theory, Synthesis of Deutsch-Jozsa circuits and verification by IBM Q, Designing efficient dyadic operations for cryptographic applications, Improved broadcast attacks against subset sum problems via lattice oracle, A quantum model of the distribution of prime numbers and the Riemann hypothesis, Identity-based key-exposure resilient cloud storage public auditing scheme from lattices, Certain sequence of arithmetic progressions and a new key sharing method, On post-processing in the quantum algorithm for computing short discrete logarithms, Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage, Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results, Saber on ESP32, Efficient public-key encryption with equality test from lattices, Classically simulating quantum circuits with local depolarizing noise, A new quantum payment protocol based on a set of local indistinguishable orthogonal product states, The cost reduction of distributed quantum factorization circuits, A novel quantum voting scheme based on BB84-state, A secure quantum voting scheme based on orthogonal product states, A novel quantum protocol for private set intersection, Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation, Reproducible families of codes and cryptographic applications, Models of quantum computation and quantum programming languages, Estimating the ground state energy of the Schrödinger equation for convex potentials, The equivalence of sampling and searching, Coined quantum walks lift the cospectrality of graphs and trees, Hierarchy and equivalence of multi-letter quantum finite automata, Quantum evolutionary algorithm with rotational gate and \(H_\epsilon\)-gate updating in real and integer domains for optimization, A new encryption scheme for multivariate quadratic systems, Enhancement of the entanglement generation via randomly perturbed series of external pulses in a nonlinear Bose-Hubbard dimer, Extended learning graphs for triangle finding, Quantum voting scheme based on locally indistinguishable orthogonal product states, Security analysis of particular quantum proxy blind signature against the forgery attack, A novel quantum solution to privacy-preserving lexicographical string sorting problem, Identity-based quantum designated verifier signature, Cryptanalysis of a rank-based signature with short public keys, The cryptanalysis and improvement of a particular quantum voting model, An evolutionary approach to optimizing teleportation cost in distributed quantum computation, Lattice-based group signatures: achieving full dynamicity (and deniability) with ease, Key establishment à la Merkle in a quantum world, Quantum information in the Posner model of quantum cognition, Quantum computing: survey and analysis, A novel quantum group proxy blind signature scheme based on five-qubit entangled state, On coverings of products of uninitialized sequential quantum machines, Quantum binary search algorithm, The hidden subgroup problem and MKTP, Quantum mappings and characterization of entangled quantum states, Lattice-based revocable certificateless signature, Simple digital quantum algorithm for symmetric first-order linear hyperbolic systems, Strongly unforgeable ring signature scheme from lattices in the standard model, Sharing privacy protected and statistically sound clinical research data using outsourced data storage, Conjugacy systems based on nonabelian factorization problems and their applications in cryptography, Cryptanalysis of a quantum proxy weak blind signature scheme, Quantum signature scheme using a single qubit rotation operator, Prime number factorization using a spinor Bose-Einstein condensate-inspired topological quantum computer, Quantum public-key designated verifier signature, Grover on SM3, Quantum advantage through the magic pentagram problem, Paired quantum Fourier transform with \(\log_2N\) Hadamard gates, Cryptanalysis of multiparty quantum digital signatures, Multi-proxy signature scheme using five-qubit entangled state based on controlled quantum teleportation, Quantum multi-proxy blind signature based on cluster state, Multipartite mixed maximally entangled states: mixed states with entanglement 1, Quantum search degeneration under amplitude noise in queries to the oracle, Quantum partial search algorithm with smaller oracles for multiple target items, An improved quantum algorithm for the quantum learning with errors problem, Applications of the Lambert-Tsallis \(W_q\) function in quantum photonic Gaussian boson sampling, Efficient semiquantum key distribution without entanglement, Individual attacks with generalized discrimination and inadequacy of some information measures, Provably secure arbitrated-quantum signature, Quantum signature without classical private key, Novel controlled quantum dialogue protocols without information leakage, A different Deutsch-Jozsa, W-OTS\textsuperscript{+} up my sleeve! A hidden secure fallback for cryptocurrency wallets, Towards efficient LPN-based symmetric encryption, New practical multivariate signatures from a nonlinear modifier, A fusion algorithm for solving the hidden shift problem in finite abelian groups, The ``Quantum annoying property of password-authenticated key exchange protocols, Differential power analysis of the Picnic signature scheme, Semi-quantum voting protocol, Implementing Grover oracles for quantum key search on AES and LowMC, He gives C-sieves on the CSIDH, Physical quantum algorithms, Simulating fermions on a quantum computer, Digital signature scheme set in a hidden cyclic group, A third-party E-payment protocol based on quantum multi-proxy blind signature, Three-nucleon forces: implementation and applications to atomic nuclei and dense matter, Security analysis with improved design of post-confirmation mechanism for quantum sealed-bid auction with single photons, Geometric algebra and information geometry for quantum computational software, An efficient authenticated key exchange from random self-reducibility on CSIDH, Milestone developments in quantum information and no-go theorems, Practical isogeny-based key-exchange with optimal tightness, A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs, Random measurement bases, quantum state distinction and applications to the hidden subgroup problem, On the hardness of the computational ring-LWR problem and its applications, Processing information in quantum decision theory, New constructions of orthogonal product basis quantum states, Prospects of quantum-classical optimization for digital design, The quantum setting with randomized queries for continuous problems, On the security of stepwise triangular systems, Improved cryptanalysis of rank metric schemes based on Gabidulin codes, Quantum reversible circuit of AES-128, Classical versus quantum communication in XOR games, Quantum mechanics on finite groups, What can quantum computers do?, Quantum algorithm to solve function inversion with time-space trade-off, Simulations of Shor's algorithm using matrix product states, A quantum Jensen-Shannon graph kernel for unattributed graphs, Quantum key agreement protocols with single photon in both polarization and spatial-mode degrees of freedom, Quantum arithmetic with the quantum Fourier transform, Dynamic Grover search: applications in recommendation systems and optimization problems, Finding shortest lattice vectors faster using quantum search, Quantum computation with classical light: the Deutsch algorithm, Quantum information as a measure of multipartite correlation, Quantum algorithms for finding constant-sized sub-hypergraphs, Heralded quantum gates for atomic systems assisted by the scattering of photons off single emitters, Quantum multi-prover interactive proof systems with limited prior entanglement., Cryptanalysis of matrix-based UOV, Quantum computation in algebraic number theory: Hallgren's efficient quantum algorithm for solving Pell's equation., Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3, Key recovery attack on the cubic ABC Simple Matrix Multivariate Encryption Scheme, A review on quantum search algorithms, Scalable quantum computing model in the circuit-QED lattice with circulator function, Cryptanalysis of a multiparty quantum key agreement protocol based on commutative encryption, Towards implementation of a generalized architecture for high-level quantum programming language, The security problems in some novel arbitrated quantum signature protocols, Decompositions of \(n\)-qubit Toffoli gates with linear circuit complexity, Comparative complexity of quantum and classical OBDDs for total and partial functions, Compact quantum gates for hybrid photon-atom systems assisted by Faraday rotation, A quantum-implementable neural network model, Implementing pure adaptive search with Grover's quantum algorithm, Global and local translation designs of quantum image based on FRQI, Polynomial interpolation and identity testing from high powers over finite fields, Quantum inductive inference by finite automata, Quantum protocols for untrusted computations, On the exact evaluation of certain instances of the Potts partition function by quantum computers, Quantum pattern recognition with probability of 100\%, Entanglement in the Grover search algorithm, Quantum algorithms for the hidden subgroup problem on some semi-direct product groups by reduction to abelian cases, A one-time signature using run-length encoding, Simulation of \(n\)-qubit quantum systems. IV. Parametrizations of quantum states, matrices and probability distributions, Quantum game simulator, using the circuit model of quantum computation, Complexity classes of equivalence problems revisited, Quantum information processing, operational quantum logic, convexity, and the foundations of physics, The geometry of quantum learning, On zeros of exponential polynomials and quantum algorithms, Matrix exponentials and parallel prefix computation in a quantum control problem, Using modifications to Grover's search algorithm for quantum global optimization, Classical limit and quantum logic, Optimizing teleportation cost in distributed quantum circuits, Quantum deduction rules, Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm, End-to-end fault tolerance, Introductive backgrounds to modern quantum mathematics with application to nonlinear dynamical systems, Self-protected quantum algorithms based on quantum state tomography, Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families, Sufficient and necessary condition of separability for generalized Werner states, Graph matching using the interference of continuous-time quantum walks, Reconsidering Mermin's ``In praise of measurement, Exciton-mediated quantum search on a star graph, A weak quantum blind signature with entanglement permutation, Solving the subset-sum problem with a light-based device, Integrative connectionist learning systems inspired by nature: Current models, future trends and challenges, A public key cryptosystem based on non-abelian finite groups, A note on quantum sequential machines, Characterizations of one-way general quantum finite automata, Key masking using biometry, On enumeration of polynomial equivalence classes and their application to MPKC, Factorizing RSA keys, an improved analogue solution, Multi-letter quantum finite automata: decidability of the equivalence and minimization of states, Claw finding algorithms using quantum walk, Graphical reasoning in compact closed categories for quantum computation, Computer algebra tales on Goppa codes and McEliece cryptography, Teleportation as a quantum computation., Impurity entanglement in three-qubit Heisenberg \(XX\) chain, Quantum computing and quadratically signed weight enumerators, Quantum neural networks, A simulator for ensemble quantum computing, Computational complexity of uniform quantum circuit families and quantum Turing machines, Simplified proof of the Fourier sampling theorem, Relativized separation of EQP from \(\text{P}^{\text{NP}}\), Pairwise thermal entanglement in the \(n\)-qubit \((n\leqslant 5)\) Heisenberg \(XX\) chain, Unnamed Item, The Shortest Signatures Ever, Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms, QUANTUM QUERY COMPLEXITY OF CONSTANT-SIZED SUBGRAPH CONTAINMENT, Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm, D-Wave and predecessors: From simulated to quantum annealing, Phase Type Distributions with Finite Support, Control aspects of quantum computing using pure and mixed states, Quantum Complexity of Boolean Matrix Multiplication and Related Problems, Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets, Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem, Secure Message Authentication Against Related-Key Attack, Square Code Attack on a Modified Sidelnikov Cryptosystem, On quantum realisation of Boolean functions by the fingerprinting technique, Key ideas in quantum error correction, Time evolution of entanglement and bistability of two coupled quantum dots in a driven cavity, Translating non-trivial algorithms from the circuit model to the measurement-based quantum computing model, Unnamed Item, Quantum dimensionality reduction by linear discriminant analysis, A novel dynamic quantum secret sharing in high-dimensional quantum system, Quantum search for scaled hash function preimages, A novel quantum E-payment protocol based on blockchain, A comparison of various classical optimizers for a variational quantum linear solver, On completely factoring any integer efficiently in a single run of an order-finding algorithm, Optimal quantum state transformations based on machine learning, Quantum digital signature based on measurement-device-independent continuous-variable scheme, Cryptographic group actions and applications, Quantum circuit implementations of AES with fewer qubits, Improved FRQI on superconducting processors and its restrictions in the NISQ era, On error distributions in ring-based LWE, Recovery attack on Bob's reused randomness in CRYSTALS-KYBER and SABER, On quantum lambda calculi: a foundational perspective, Integer factorization as subset-sum problem, Non-associative public-key cryptography, Non-associative key establishment protocols and their implementation, Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems, Identity-Based Blind Signature from Lattices in Standard Model, BI-NTRU Encryption Schemes: Two New Secure Variants of NTRU, PhyChip: Growing Computers with Slime Mould, Quantum error-correcting codes over finite Frobenius rings, Differential Power Analysis of XMSS and SPHINCS, Integer Reconstruction Public-Key Encryption, Poly-Dragon: an efficient multivariate public key cryptosystem, A FINE ESTIMATE OF QUANTUM FACTORIZATION SUCCESS PROBABILITY, QUANTUM PHASE GATES WITH TRAPPED ATOMS COUPLING TO A SUPERCONDUCTING TRANSMISSION LINE RESONATOR, An introduction to quantum annealing, The Equivalence of Sampling and Searching, Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas, Note on coherent states and adiabatic connections, curvatures, Quantum Commitments from Complexity Assumptions, An Algorithm for Computing a Basis of a Finite Abelian Group, Implementation of group-covariant positive operator valued measures by orthogonal measurements, CIRCUIT DESIGN FOR A MEASUREMENT-BASED QUANTUM CARRY-LOOKAHEAD ADDER, Differential Power Analysis of a McEliece Cryptosystem, Perfect Structure on the Edge of Chaos, INFEASIBILITY OF QUANTUM CRYPTOGRAPHY WITHOUT EAVESDROPPING CHECK, Quantum analogue computing, Public key cryptosystem MST3: cryptanalysis and realization, On Halting Process of Quantum Turing Machine, Post-Quantum Cryptography: State of the Art, Lattice-based identity-based resplittable threshold public key encryption scheme, An efficient statistical zero-knowledge authentication protocol for smart cards, Superlinear Advantage for Exact Quantum Algorithms, Anderson localization makes adiabatic quantum optimization fail, Masking Large Keys in Hardware: A Masked Implementation of McEliece, An Efficient Post-Quantum One-Time Signature Scheme, Quantum algorithms for algebraic problems, Quantum computation and quantum information†, Algebraic cryptography: new constructions and their security against provable break, Optimization of $S$-boxes GOST R 34.12-2015 «Magma» quantum circuits without ancilla qubits, Hybrid MQ Signature for Embedded Device, A NEW PARAMETER OF ENTANGLEMENT FOR A QUBIT SYSTEM PLACED INSIDE A DISSIPATIVE CAVITY, A Practical E-Payment Protocol Based on Quantum Multi-Proxy Blind Signature, A Quantum Multi-Proxy Blind Signature Scheme Based on Entangled Four-Qubit Cluster State, A quantum speedup in machine learning: finding anN-bit Boolean function for a classification, Adiabatic graph-state quantum computation, Commutative Encryption Method Based on Hidden Logarithm Problem, Periodicity and Cyclic Shifts via Linear Sketches, Pretty good state transfer of entangled states through quantum spin chains, Accelerated randomized benchmarking, Quantum bootstrapping via compressed quantum Hamiltonian learning, Unnamed Item, Scalar System F for Linear-Algebraic λ-Calculus: Towards a Quantum Physical Logic, Breaking Symmetric Cryptosystems Using Quantum Period Finding, Distributed key agreement for group communications based on elliptic curves. An application to sensor networks., Fast quantum modular exponentiation, General Fault Attacks on Multivariate Public Key Cryptosystems, On the Differential Security of Multivariate Public Key Cryptosystems, Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices, Fiber-Optics Implementation of the Deutsch-Jozsa and Bernstein-Vazirani Quantum Algorithms with Three Qubits, Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer, EFFECTS OF CLASSICAL ENVIRONMENTAL NOISE ON ENTANGLEMENT AND QUANTUM DISCORD DYNAMICS, On the efficiency of Hamiltonian-based quantum computation for low-rank matrices, Quantum Patterns and Types for Entanglement and Separability, Quantum Data and Control Made Easier, Ultracold quantum gases and lattice systems: quantum simulation of lattice gauge theories, Coherence and decoherence in the brain, The physics of quantum computation, Quantum correlations and distinguishability of quantum states, The information role of entanglement and interference operators in Shor quantum algorithm gate dynamics, Quantum algorithm for the computation of the reactant conversion rate in homogeneous turbulence, Computational quantum key distribution (CQKD) on decentralized ledger and blockchain, Public key authentication scheme over quaternions, Novel Digital Signature Scheme with Multiple Private Keys on Non-commutative Division Semirings, MQ Aggregate Signature Schemes with Exact Security Based on UOV Signature, Efficient Key Generation for Rainbow, Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme, Practical Cryptanalysis of k-ary $$C^*$$, A Rank Attack Against Extension Field Cancellation, Improved Quantum Circuits for Elliptic Curve Discrete Logarithms, A Note on the Instantiability of the Quantum Random Oracle, Computation of lattice isomorphisms and the integral matrix similarity problem, New public key cryptosystems from combinatorial group theory, A public key cryptosystem based on data complexity under quantum environment, LESS is More: Code-Based Signatures Without Syndromes, Advances in Quantum Detection, On the Size of One-way Quantum Finite Automata with Periodic Behaviors, On Solving Systems of Diagonal Polynomial Equations Over Finite Fields, Quantum fast Fourier transform using multilevel atoms, The localization of quantum random walks on Sierpinski gaskets, Quantum circuits of $ \newcommand{\cZ}{c-\mathtt{Z}} \cZ$ and $ \newcommand{\Swap}{\mathtt{SWAP}} \Swap$ gates: optimization and entanglement, Algorithmic cooling and scalable NMR quantum computers, Wave-particle duality employing quantum coherence in superposition with non-orthogonal pointers, Unnamed Item, State complexity and quantum computation, Basics of Secrecy Coding, Optimal ancilla-free Pauli+V circuits for axial rotations, Quantum machine learning: a classical perspective, Security analysis of the W-OTS$^+$ signature scheme: Updating security bounds, SOME ARITHMETICAL PROPERTIES ON HYPERBOLA, New applications of the polynomial method: The cap set conjecture and beyond, Unnamed Item, Trading quantum for classical resources in quantum data compression, Forrelation: A Problem That Optimally Separates Quantum from Classical Computing, Post-quantum Security of Plain OAEP Transform, On the Isogeny Problem with Torsion Point Information, Rapid solution of problems by quantum computation, Products of two proportional primes, Cryptanalysis of the TRMS Signature Scheme of PKC’05, Discrete Fourier Transform and Theta Function Identities, A quantum algorithm to approximate the linear structures of Boolean functions, Improving the Success Probability for Shor’s Factorization Algorithm, Unnamed Item, Information gain when measuring an unknown qubit, Linear-algebraic λ-calculus: higher-order, encodings, and confluence., Unnamed Item, Side Channels in the McEliece PKC, Symmetry resolved entanglement: exact results in 1D and beyond, Factorization of numbers with Gauss sums: I. Mathematical background, Non-adaptive measurement-based quantum computation and multi-party Bell inequalities, Interacting quantum observables: categorical algebra and diagrammatics, Efficient quantum computing with weak measurements, A derivation of quantum theory from physical requirements, Quantum Query Algorithms are Completely Bounded Forms., Quantum Query Algorithms Are Completely Bounded Forms, SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES, Svetlichny’s approach to detecting genuine multipartite entanglement in arbitrarily-high-dimensional systems by a Bell-type inequality, Nonadiabatic quantum search algorithms, Key exchange protocols over noncommutative rings. The case of, Matchgates and classical simulation of quantum circuits, NMR Quantum Computing, ROBUST MESSAGE AUTHENTICATION OVER A COLLECTIVE-NOISE CHANNEL, PARTIALLY BLIND SIGNATURES BASED ON QUANTUM CRYPTOGRAPHY, THERMAL ENTANGLEMENT IN THE TWO-QUBIT HEISENBERG XYZ MODEL, Measurement-Based and Universal Blind Quantum Computation, Quantum attacks on pseudorandom generators, GRADIENT FLOWS FOR OPTIMIZATION IN QUANTUM INFORMATION AND QUANTUM DYNAMICS: FOUNDATIONS AND APPLICATIONS, Code-Based Public-Key Cryptosystems and Their Applications, MEASURED QUANTUM FOURIER TRANSFORM OF 1024 QUBITS ON FIBER OPTICS, Algorithmic problems in Engel groups and cryptographic applications, Unnamed Item, Graph Design for Secure Multiparty Computation over Non-Abelian Groups, ENTANGLEMENT IN ADIABATIC QUANTUM SEARCHING ALGORITHMS, A SUFFICIENT AND NECESSARY CONDITION FOR SUPERDENSE CODING OF QUANTUM STATES, Unnamed Item, A Less Known Side of Quantum Cryptography, К анализу некоторых систем открытого распределения ключей, основанных на неабелевых группах, MINIMAL EXECUTION TIME OF SHOR'S ALGORITHM AT LOW TEMPERATURES, Quantum Factoring Algorithm: Resource Estimation and Survey of Experiments, Post-Quantum Constant-Round Group Key Exchange from Static Assumptions, Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus, Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment, Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer, RingRainbow – An Efficient Multivariate Ring Signature Scheme, MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES, A NOTE ON AN ARBITRATED QUANTUM SIGNATURE SCHEME, A Mathematica Package for Simulation of Quantum Computation, Entanglement simulations of Shor's algorithm, ENTANGLEMENT, PURITY AND VIOLATION OF BELL INEQUALITY, TIGHT QUANTUM BOUNDS FOR COMPUTATIONAL GEOMETRY PROBLEMS, Public-Key Cryptographic Primitives Provably as Secure as Subset Sum, Boolean satisfiability in quantum compilation, Quantum Hardness of Learning Shallow Classical Circuits, Improved supersingularity testing of elliptic curves, Finite Precision Measurement Nullifies the Kochen-Specker Theorem, Quantum computing: beyond the limits of conventional computation†, The Significance of Relativistic Computation for the Philosophy of Mathematics, The Complexity of Public-Key Cryptography, Pseudorandom Functions: Three Decades Later, Testing Boolean Functions Properties, Implementing quantum Fourier transform using three qubits, JARLSKOG'S PARAMETRIZATION OF UNITARY MATRICES AND QUDIT THEORY, NONUNITARY QUANTUM CIRCUIT, QUANTUM PHASE ESTIMATION WITH AN ARBITRARY NUMBER OF QUBITS, Topological Quantum Computation, A random walk approach to quantum algorithms, QUANTUM SEARCH ALGORITHMS, On the period mod $m$ of polynomially-recursive sequences: a case study, A New Variant of Unbalanced Oil and Vinegar Using Quotient Ring: QR-UOV, Burst error-correcting quantum stabilizer codes designed from idempotents, Improved quantum supersampling for quantum ray tracing, Efficient implementation of LIMDDs for quantum circuit simulation, Quantum \((t, m, n)\) threshold group blind signature scheme with flexible number of participants, Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm, Universal Distributed Quantum Computing on Superconducting Qutrits with Dark Photons, QCB is blindly unforgeable, Sieve algorithms for some orthogonal integer lattices, Improved attacks against reduced-round Whirlwind, Advantage of Quantum Theory over Nonclassical Models of Communication, Implementing evolutionary optimization on actual quantum processors, Distribution and Generation of Quantum Coherence for Gaussian States in de Sitter Space, Following forrelation -- quantum algorithms in exploring Boolean functions' spectra, Optimized quantum implementation of AES, Classical and quantum security of elliptic curve VRF, via relative indifferentiability, A flexible shared hardware accelerator for NIST-recommended algorithms CRYSTALS-Kyber and CRYSTALS-Dilithium with SCA protection, Quantum Simulation of Tunable Neuron Activation, Implementing a Two‐Photon Three‐Degrees‐of‐Freedom Hyper‐Parallel Controlled Phase Flip Gate Through Cavity‐Assisted Interactions, Fast first-order masked NTTRU, On the feasibility of single-trace attacks on the Gaussian sampler using a CDT, Universal Classical Optical Computing Inspired by Quantum Information Process, Entanglement as a resource to locally distinguish tripartite quantum states, An efficient combination strategy for hybrid quantum ensemble classifier, \texttt{QOptCraft}: a python package for the design and study of linear optical quantum systems, Fast and scalable quantum computing simulation on multi-core and many-core platforms, Variable ansatz applied to spectral operator decomposition in a physical superconducting quantum device, A comprehensive review on blockchains for Internet of Vehicles: challenges and directions, Quantum bounds for 2D-grid and Dyck language, Code-Based Signature Schemes from Identification Protocols in the Rank Metric, A new quantum algorithm for computing RSA ciphertext period, Unnamed Item, Ancilla-based quantum simulation, EFFICIENT IMPLEMENTATIONS OF THE QUANTUM FOURIER TRANSFORM: AN EXPERIMENTAL PERSPECTIVE, An Introduction to Quantum Computing, without the Physics, EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM, SEPARABILITY OF PURE N-QUBIT STATES: TWO CHARACTERIZATIONS, ANALYSIS OF QUANTUM FUNCTIONS, A strategy for quantum algorithm design assisted by machine learning, Quantum lower bounds by quantum arguments, "NON-IDENTITY-CHECK" IS QMA-COMPLETE, Generalized Quantum Fast Transformations via Femtosecond Laser Writing Technique, Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians, A polynomial quantum algorithm for approximating the Jones polynomial, QUANTUM-STATISTICAL SIMULATIONS FOR QUANTUM CIRCUITS, Supersingular Isogeny-based Cryptography: A Survey, Physical Computational Complexity and First-order Logic, Modular quantum computing and quantum-like devices, Variational Quantum Eigensolver and Its Applications, Efficient Construction of Functional Representations for Quantum Algorithms, On quantum algorithms for noncommutative hidden subgroups, ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM, Short Stickelberger Class Relations and Application to Ideal-SVP, Revisiting the Efficient Key Generation of ZHFE, A novel 3-pass identification scheme and signature scheme based on multivariate quadratic polynomials, Counting by quantum eigenvalue estimation, Rotating a qubit, Decoherence in quantum walks – a review, A key exchange protocol using matrices over group ring, The significance of theC-numerical range and the localC-numerical range in quantum control and quantum information, Lattice-Based Identification Schemes Secure Under Active Attacks, Basing Weak Public-Key Cryptography on Strong One-Way Functions, Analogies and differences between quantum and stochastic automata, Algorithms on ensemble quantum computers, Trace monoids with idempotent generators and measure-only quantum automata, Transitive Signatures from Braid Groups, How does adiabatic quantum computation fit into quantum automata theory?, Sumcheck-based delegation of quantum computing to rational server, Integer Version of Ring-LWE and Its Applications, BASIC OPERATIONS AMONG ENTANGLED STATES AND THEIR APPLICATIONS TO QUANTUM PROTOCOLS, Efficient Realization of Toffoli and NCV Circuits for IBM QX Architectures, Evaluating the Flexibility of A* for Mapping Quantum Circuits, Optimal observables for minimum-error state discrimination in general probabilistic theories, Counting Method for Multi-party Computation over Non-abelian Groups, Classical and Quantum Algorithms for Exponential Congruences, On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography, A Practical Multivariate Blind Signature Scheme, Generalised phase kick-back: the structure of computational algorithms from physical principles, Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems, Quantum discriminant analysis for dimensionality reduction and classification, A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY, A Reduction of Integer Factorization to Modular Tetration, Quantum blind signature with an offline repository, New multivariate-based certificateless hybrid signcryption scheme for multi-recipient, Quantum Algorithms for a Set of Group Theoretic Problems, A novel public-key encryption scheme based on Bass cyclic units in integral group rings, Increasing complexity with quantum physics, Entanglement in orthonormal bases for quantum systems, Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography, The security of the code-based signature scheme based on the Stern identification protocol, Entanglement classification with algebraic geometry, Algorithm for initializing a generalized fermionic Gaussian state on a quantum computer, Implicit rejection in Fujisaki-Okamoto: framework and a novel realization, A quantum version of Pollard's Rho of which Shor's algorithm is a particular case, Quaternionic quantum automata, Deterministic factoring with oracles, Highly optimized quantum circuits synthesized via data-flow engines, Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext, Exploiting ROLLO's constant-time implementations with a single-trace analysis, Introducing nega-forrelation: quantum algorithms in analyzing nega-Hadamard and nega-crosscorrelation spectra, Key-recovery fault injection attack on the classic McEliece KEM, IND-CCA security of Kyber in the quantum random oracle model, revisited, Some remarks on super-Gram operators for general bipartite quantum states, Development of hybrid approach for solving MQ problem: Intermediate hybrid approach, Shor's Factoring Algorithm and Modular Exponentiation Operators, Chiral‐Quantum‐Optics‐Based Supervised Learning, Controlled Remote Implementation of Operations via Graph States, State‐Independent Geometric Quantum Gates via Nonadiabatic and Noncyclic Evolution, Secure keys data distribution based user-storage-transit server authentication process model using mathematical post-quantum cryptography methodology, Quantum designated multi-verifier signature, Quantum string matching unfolded and extended, Computing primitive idempotents in finite commutative rings and applications, Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations, Quantum walk search on a two-dimensional grid with extra edges, Quantum privacy-preserving two-party circle intersection protocol based on phase-encoded query, Lattice-Based Proof of a Shuffle, A new fault attack on UOV multivariate signature scheme, Post-quantum plaintext-awareness, Tsallis relative α entropy of coherence dynamics in Grover′s search algorithm, Two remarks on the vectorization problem, Quantum circuits for hyperelliptic curve discrete logarithms over the mersenne prime fields, Quantum circuit implementations of SM4 block cipher based on different gate sets, Practical adaptive quantum tomography, Micromotion-enabled improvement of quantum logic gates with trapped ions, \textsf{symQV}: automated symbolic verification of quantum programs, A practical digital signature scheme based on the hidden logarithm problem, Quantum designated verifier signature without third party, Further insights on constructing quantum circuits for Camellia block cipher, A quantum key distribution on qudits using quantum operators, On linear codes with random multiplier vectors and the maximum trace dimension property, Distributed Grover's algorithm, An approach to the classification of finite semifields by quantum computing, Oblivious transfer using non-abelian groups, Unnamed Item, Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
