scientific article; zbMATH DE number 1256737
From MaRDI portal
Publication:4228473
zbMath0922.68044arXivquant-ph/9605043MaRDI QIDQ4228473
Publication date: 1 March 1999
Full work available at URL: https://arxiv.org/abs/quant-ph/9605043
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
The discrete-time quaternionic quantum walk on a graph ⋮ Challenges of adiabatic quantum evaluation of NAND trees ⋮ A survey of quantum image representations ⋮ An efficient quantum scheme for private set intersection ⋮ Participant attack on three-party quantum key agreement with two-photon entanglement ⋮ Periodicity of quantum walks defined by mixed paths and mixed cycles ⋮ Application of Grover's algorithm to check non-resiliency of a Boolean function ⋮ SoK: how (not) to design and implement post-quantum cryptography ⋮ Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics ⋮ (Quantum) cryptanalysis of misty schemes ⋮ Quantum and approximation algorithms for maximum witnesses of Boolean matrix products ⋮ Magnifying computing gaps. Establishing encrypted communication over unidirectional channels ⋮ Spatial search by continuous-time quantum walk with multiple marked vertices ⋮ Generator of an abstract quantum walk ⋮ QRDA: quantum representation of digital audio ⋮ Applications of Singh-Rajput MES in recall operations of quantum associative memory for a two-qubit system ⋮ Multi-party quantum key agreement by an entangled six-qubit state ⋮ Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables ⋮ A new universal and fault-tolerant quantum basis ⋮ Collusive attacks to ``circle-type multi-party quantum key agreement protocols ⋮ PEET: a Matlab tool for estimating physical gate errors in quantum information processing systems ⋮ Quantum image matching ⋮ Novel classical post-processing for quantum key distribution-based quantum private query ⋮ The number of terms in the superpositions upper bounds the amount of the coherence change ⋮ Improving quantum query complexity of Boolean matrix multiplication using graph collision ⋮ Quantum query complexity of almost all functions with fixed on-set size ⋮ A class of quantum low-density parity check codes by combining seed graphs ⋮ Image storage, retrieval, compression and segmentation in a quantum system ⋮ Multiparty quantum key agreement with single particles ⋮ A fast natural algorithm for searching ⋮ The query complexity of order-finding ⋮ The quantum search algorithms for all solutions ⋮ Automata theory based on quantum logic: Some characterizations ⋮ Reexamination of arbitrated quantum signature: the impossible and the possible ⋮ Amplitudes distribution over two copies of small quantum subsystems ⋮ A novel quantum representation for log-polar images ⋮ Quantum computer simulation using the CUDA programming model ⋮ Quantum pattern search with closed match ⋮ Cryptanalysis of the quantum group signature protocols ⋮ Phase matching in Grover's algorithm ⋮ Strategies for designing geometric transformations on quantum images ⋮ Watermarking and authentication of quantum images based on restricted geometric transformations ⋮ A flexible representation of quantum images for polynomial preparation, image compression, and processing operations ⋮ Assertoric semantics and the computational power of self-referential truth ⋮ A hybrid method for quantum global optimization ⋮ Optimality proofs of quantum weight decision algorithms ⋮ Can quantum entanglement detection schemes improve search? ⋮ Parrondo's game using a discrete-time quantum walk ⋮ Tree search and quantum computation ⋮ Quantum key agreement against collective decoherence ⋮ Noise-based logic hyperspace with the superposition of \(2^N\) states in a single wire ⋮ Quantum-assisted QD-CFS signatures ⋮ A logarithmic time complexity algorithm for pattern searching using product-sum property ⋮ Mini-maximizing two qubit quantum computations ⋮ SQR: a simple quantum representation of infrared images ⋮ Efficient quantum algorithms to construct arbitrary Dicke states ⋮ Multiple network alignment on quantum computers ⋮ Circuit QED: implementation of the three-qubit refined Deutsch-Jozsa quantum algorithm ⋮ How low can approximate degree and quantum query complexity be for total Boolean functions? ⋮ On the power of non-adaptive learning graphs ⋮ An exact quantum search algorithm with arbitrary database ⋮ Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling ⋮ Quantum image edge extraction based on classical Sobel operator for NEQR ⋮ Quantum image edge extraction based on Laplacian operator and zero-cross method ⋮ Two quantum protocols for secure Hamming distance computation ⋮ A quantum walk-assisted approximate algorithm for bounded NP optimisation problems ⋮ Efficiently embedding QUBO problems on adiabatic quantum computers ⋮ A novel protocol for multiparty quantum key management ⋮ Trapping and spreading properties of quantum walk in homological structure ⋮ Quantum image scaling using nearest neighbor interpolation ⋮ Local feature point extraction for quantum images ⋮ Image segmentation on a quantum computer ⋮ Quantum image pseudocolor coding based on the density-stratified method ⋮ Unrelated parallel machine scheduling -- perspectives and progress ⋮ Application of distributed semi-quantum computing model in phase estimation ⋮ Improved quantum query algorithms for triangle detection and associativity testing ⋮ Szegedy's quantum walk with queries ⋮ Quantum point cloud and its compression ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ Quantum image location ⋮ On the complexity of minimizing probabilistic and quantum automata ⋮ The vectorial \(\lambda\)-calculus ⋮ Two-tape finite automata with quantum and classical states ⋮ Duality quantum computing and duality quantum information processing ⋮ Quantum walks, Ihara zeta functions and cospectrality in regular graphs ⋮ Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights ⋮ Schemes for teleportation of quantum gates ⋮ Randomized and quantum algorithms yield a speed-up for initial-value problems ⋮ On the power of Ambainis lower bounds ⋮ Quantum counterfeit coin problems ⋮ Pattern classifications using Grover's and Ventura's algorithms in a two-qubits system ⋮ Optimizing teleportation cost in distributed quantum circuits ⋮ The quantum speed up as advanced cognition of the solution ⋮ Exponential separation of quantum and classical online space complexity ⋮ Simulating a perceptron on a quantum computer ⋮ Exciton-mediated quantum search on a star graph ⋮ Characterizations of one-way general quantum finite automata ⋮ Multi-letter quantum finite automata: decidability of the equivalence and minimization of states ⋮ Quantum computation and quantum information ⋮ Quantum mechanics and computation
This page was built for publication:
