The Experts below are selected from a list of 255 Experts worldwide ranked by ideXlab platform

Daniel A. Lidar - One of the best experts on this subject based on the ideXlab platform.

  • Grover’s quantum search algorithm for an arbitrary initial Amplitude Distribution
    Physical Review A, 1999
    Co-Authors: Eli Biham, David Biron, Ofer Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover’s algorithm for quantum searching is generalized to deal with arbitrary initial complex Amplitude Distributions. First-order linear difference equations are found for the time evolution of the Amplitudes of the marked and unmarked states. These equations are solved exactly. New expressions are derived for the optimal time of measurement and the maximal probability of success. They are found to depend on the averages and variances of the initial Amplitude Distributions of the marked and unmarked states, but not on higher moments. Our results imply that Grover’s algorithm is robust against modest noise in the Amplitude initialization procedure. @S1050-2947~99!09009-5# PACS number~s!: 03.67.Lx, 89.70.1c

  • grover s quantum search algorithm for an arbitrary initial Amplitude Distribution
    Physical Review A, 1999
    Co-Authors: Eli Biham, David Biron, Ofer Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover’s algorithm for quantum searching is generalized to deal with arbitrary initial complex Amplitude Distributions. First-order linear difference equations are found for the time evolution of the Amplitudes of the marked and unmarked states. These equations are solved exactly. New expressions are derived for the optimal time of measurement and the maximal probability of success. They are found to depend on the averages and variances of the initial Amplitude Distributions of the marked and unmarked states, but not on higher moments. Our results imply that Grover’s algorithm is robust against modest noise in the Amplitude initialization procedure. @S1050-2947~99!09009-5# PACS number~s!: 03.67.Lx, 89.70.1c

  • QCQC - Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution
    Quantum Computing and Quantum Communications, 1999
    Co-Authors: David Biron, Ofer Biham, Eli Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover's algorithm for quantum searching of a database is generalized to deal with arbitrary initial Amplitude Distributions. First order linear difference equations are found for the time evolution of the Amplitudes of the r marked and N - r unmarked states. These equations are solved exactly. An expression for the optimal measurement time T ∼ O(√N/r) is derived which is shown to depend only on the initial average Amplitudes of the marked and unmarked states. A bound on the probability of measuring a marked state is derived, which depends only on the standard deviation of the initial Amplitude Distributions of the marked or unmarked states.

  • Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution
    arXiv: Quantum Physics, 1998
    Co-Authors: David Biron, Ofer Biham, Eli Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover's algorithm for quantum searching of a database is generalized to deal with arbitrary initial Amplitude Distributions. First order linear difference equations are found for the time evolution of the Amplitudes of the r marked and N-r unmarked states. These equations are solved exactly. An expression for the optimal measurement time T \sim O(\sqrt{N/r}) is derived which is shown to depend only on the initial average Amplitudes of the marked and unmarked states. A bound on the probability of measuring a marked state is derived, which depends only on the standard deviation of the initial Amplitude Distributions of the marked or unmarked states.

Eli Biham - One of the best experts on this subject based on the ideXlab platform.

  • Grover’s quantum search algorithm for an arbitrary initial Amplitude Distribution
    Physical Review A, 1999
    Co-Authors: Eli Biham, David Biron, Ofer Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover’s algorithm for quantum searching is generalized to deal with arbitrary initial complex Amplitude Distributions. First-order linear difference equations are found for the time evolution of the Amplitudes of the marked and unmarked states. These equations are solved exactly. New expressions are derived for the optimal time of measurement and the maximal probability of success. They are found to depend on the averages and variances of the initial Amplitude Distributions of the marked and unmarked states, but not on higher moments. Our results imply that Grover’s algorithm is robust against modest noise in the Amplitude initialization procedure. @S1050-2947~99!09009-5# PACS number~s!: 03.67.Lx, 89.70.1c

  • grover s quantum search algorithm for an arbitrary initial Amplitude Distribution
    Physical Review A, 1999
    Co-Authors: Eli Biham, David Biron, Ofer Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover’s algorithm for quantum searching is generalized to deal with arbitrary initial complex Amplitude Distributions. First-order linear difference equations are found for the time evolution of the Amplitudes of the marked and unmarked states. These equations are solved exactly. New expressions are derived for the optimal time of measurement and the maximal probability of success. They are found to depend on the averages and variances of the initial Amplitude Distributions of the marked and unmarked states, but not on higher moments. Our results imply that Grover’s algorithm is robust against modest noise in the Amplitude initialization procedure. @S1050-2947~99!09009-5# PACS number~s!: 03.67.Lx, 89.70.1c

  • QCQC - Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution
    Quantum Computing and Quantum Communications, 1999
    Co-Authors: David Biron, Ofer Biham, Eli Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover's algorithm for quantum searching of a database is generalized to deal with arbitrary initial Amplitude Distributions. First order linear difference equations are found for the time evolution of the Amplitudes of the r marked and N - r unmarked states. These equations are solved exactly. An expression for the optimal measurement time T ∼ O(√N/r) is derived which is shown to depend only on the initial average Amplitudes of the marked and unmarked states. A bound on the probability of measuring a marked state is derived, which depends only on the standard deviation of the initial Amplitude Distributions of the marked or unmarked states.

  • Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution
    arXiv: Quantum Physics, 1998
    Co-Authors: David Biron, Ofer Biham, Eli Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover's algorithm for quantum searching of a database is generalized to deal with arbitrary initial Amplitude Distributions. First order linear difference equations are found for the time evolution of the Amplitudes of the r marked and N-r unmarked states. These equations are solved exactly. An expression for the optimal measurement time T \sim O(\sqrt{N/r}) is derived which is shown to depend only on the initial average Amplitudes of the marked and unmarked states. A bound on the probability of measuring a marked state is derived, which depends only on the standard deviation of the initial Amplitude Distributions of the marked or unmarked states.

Matthew Ritchie - One of the best experts on this subject based on the ideXlab platform.

  • Modeling the Amplitude Distribution of Radar Sea Clutter
    Remote Sensing, 2019
    Co-Authors: Sebastien Angelliaume, Luke Rosenberg, Matthew Ritchie
    Abstract:

    Ship detection in the maritime domain is best performed with radar due to its ability to surveil wide areas and operate in almost any weather condition or time of day. Many common detection schemes require an accurate model of the Amplitude Distribution of radar echoes backscattered by the ocean surface. This paper presents a review of select Amplitude Distributions from the literature and their ability to represent data from several different radar systems operating from 1 GHz to 10 GHz. These include the K Distribution, arguably the most popular model from the literature as well as the Pareto, K+Rayleigh, and the trimodal discrete (3MD) Distributions. The models are evaluated with radar data collected from a ground-based bistatic radar system and two experimental airborne radars. These data sets cover a wide range of frequencies (L-, S-, and X-band), and different collection geometries and sea conditions. To guide the selection of the most appropriate model, two goodness of fit metrics are used, the Bhattacharyya distance which measures the overall Distribution error and the threshold error which quantifies mismatch in the Distribution tail. Together, they allow a quantitative evaluation of each Distribution to accurately model radar sea clutter for the purpose of radar ship detection.

David Biron - One of the best experts on this subject based on the ideXlab platform.

  • Grover’s quantum search algorithm for an arbitrary initial Amplitude Distribution
    Physical Review A, 1999
    Co-Authors: Eli Biham, David Biron, Ofer Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover’s algorithm for quantum searching is generalized to deal with arbitrary initial complex Amplitude Distributions. First-order linear difference equations are found for the time evolution of the Amplitudes of the marked and unmarked states. These equations are solved exactly. New expressions are derived for the optimal time of measurement and the maximal probability of success. They are found to depend on the averages and variances of the initial Amplitude Distributions of the marked and unmarked states, but not on higher moments. Our results imply that Grover’s algorithm is robust against modest noise in the Amplitude initialization procedure. @S1050-2947~99!09009-5# PACS number~s!: 03.67.Lx, 89.70.1c

  • grover s quantum search algorithm for an arbitrary initial Amplitude Distribution
    Physical Review A, 1999
    Co-Authors: Eli Biham, David Biron, Ofer Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover’s algorithm for quantum searching is generalized to deal with arbitrary initial complex Amplitude Distributions. First-order linear difference equations are found for the time evolution of the Amplitudes of the marked and unmarked states. These equations are solved exactly. New expressions are derived for the optimal time of measurement and the maximal probability of success. They are found to depend on the averages and variances of the initial Amplitude Distributions of the marked and unmarked states, but not on higher moments. Our results imply that Grover’s algorithm is robust against modest noise in the Amplitude initialization procedure. @S1050-2947~99!09009-5# PACS number~s!: 03.67.Lx, 89.70.1c

  • QCQC - Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution
    Quantum Computing and Quantum Communications, 1999
    Co-Authors: David Biron, Ofer Biham, Eli Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover's algorithm for quantum searching of a database is generalized to deal with arbitrary initial Amplitude Distributions. First order linear difference equations are found for the time evolution of the Amplitudes of the r marked and N - r unmarked states. These equations are solved exactly. An expression for the optimal measurement time T ∼ O(√N/r) is derived which is shown to depend only on the initial average Amplitudes of the marked and unmarked states. A bound on the probability of measuring a marked state is derived, which depends only on the standard deviation of the initial Amplitude Distributions of the marked or unmarked states.

  • Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution
    arXiv: Quantum Physics, 1998
    Co-Authors: David Biron, Ofer Biham, Eli Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover's algorithm for quantum searching of a database is generalized to deal with arbitrary initial Amplitude Distributions. First order linear difference equations are found for the time evolution of the Amplitudes of the r marked and N-r unmarked states. These equations are solved exactly. An expression for the optimal measurement time T \sim O(\sqrt{N/r}) is derived which is shown to depend only on the initial average Amplitudes of the marked and unmarked states. A bound on the probability of measuring a marked state is derived, which depends only on the standard deviation of the initial Amplitude Distributions of the marked or unmarked states.

Ofer Biham - One of the best experts on this subject based on the ideXlab platform.

  • Grover’s quantum search algorithm for an arbitrary initial Amplitude Distribution
    Physical Review A, 1999
    Co-Authors: Eli Biham, David Biron, Ofer Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover’s algorithm for quantum searching is generalized to deal with arbitrary initial complex Amplitude Distributions. First-order linear difference equations are found for the time evolution of the Amplitudes of the marked and unmarked states. These equations are solved exactly. New expressions are derived for the optimal time of measurement and the maximal probability of success. They are found to depend on the averages and variances of the initial Amplitude Distributions of the marked and unmarked states, but not on higher moments. Our results imply that Grover’s algorithm is robust against modest noise in the Amplitude initialization procedure. @S1050-2947~99!09009-5# PACS number~s!: 03.67.Lx, 89.70.1c

  • grover s quantum search algorithm for an arbitrary initial Amplitude Distribution
    Physical Review A, 1999
    Co-Authors: Eli Biham, David Biron, Ofer Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover’s algorithm for quantum searching is generalized to deal with arbitrary initial complex Amplitude Distributions. First-order linear difference equations are found for the time evolution of the Amplitudes of the marked and unmarked states. These equations are solved exactly. New expressions are derived for the optimal time of measurement and the maximal probability of success. They are found to depend on the averages and variances of the initial Amplitude Distributions of the marked and unmarked states, but not on higher moments. Our results imply that Grover’s algorithm is robust against modest noise in the Amplitude initialization procedure. @S1050-2947~99!09009-5# PACS number~s!: 03.67.Lx, 89.70.1c

  • QCQC - Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution
    Quantum Computing and Quantum Communications, 1999
    Co-Authors: David Biron, Ofer Biham, Eli Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover's algorithm for quantum searching of a database is generalized to deal with arbitrary initial Amplitude Distributions. First order linear difference equations are found for the time evolution of the Amplitudes of the r marked and N - r unmarked states. These equations are solved exactly. An expression for the optimal measurement time T ∼ O(√N/r) is derived which is shown to depend only on the initial average Amplitudes of the marked and unmarked states. A bound on the probability of measuring a marked state is derived, which depends only on the standard deviation of the initial Amplitude Distributions of the marked or unmarked states.

  • Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution
    arXiv: Quantum Physics, 1998
    Co-Authors: David Biron, Ofer Biham, Eli Biham, Markus Grassl, Daniel A. Lidar
    Abstract:

    Grover's algorithm for quantum searching of a database is generalized to deal with arbitrary initial Amplitude Distributions. First order linear difference equations are found for the time evolution of the Amplitudes of the r marked and N-r unmarked states. These equations are solved exactly. An expression for the optimal measurement time T \sim O(\sqrt{N/r}) is derived which is shown to depend only on the initial average Amplitudes of the marked and unmarked states. A bound on the probability of measuring a marked state is derived, which depends only on the standard deviation of the initial Amplitude Distributions of the marked or unmarked states.