Wednesday, April 7, 2021, 2:00 pm — Videoconference / Virtual Event (see link below)
Grover' search is one of the most important algorithms in quantum computing for unstructured search. However, the circuit depth increases prohibitively as the search domain gets bigger, which limits its successful implementation beyond a small number of qubits on near-term quantum computers.
In this talk, we introduce an algorithmic approach – based on quantum partial search and depth optimization – consisting of three different strategies that reduce the depth of the quantum circuits significantly. With this approach, we have been able to design circuits that have improved the previous record in the field for a 4-qubit domain. Moreover, we have successfully implemented a 5-qubit search, for the first time, on IBM's quantum processors. The proposed approach is general enough to be useful beyond the NISQ era machines and has many appealing features, such as parallelizability.
Hosted by: Layla Hormozi
16293 | INT/EXT | Events Calendar
Not all computers/devices will add this event to your calendar automatically.
A calendar event file named "calendar.ics" will be placed in your downloads location. Depending on how your device/computer is configured, you may have to locate this file and double click on it to add the event to your calendar.
Event dates, times, and locations are subject to change. Event details will not be updated automatically once you add this event to your own calendar. Check the Lab's Events Calendar to ensure that you have the latest event information.